Using long fragments to reconstruct RNA backbones
Paper i proceeding, 2007

This study addresses to what extent RNA backbones consist of long, recurring fragments. A dynamic programming algorithm is presented that finds the smallest set of fragments that are required to reconstruct the backbone of a known macromolecule within a given root mean square bound. This algorithm is guaranteed to find a global minimum. The program has been used for reconstructing the backbones of several known RNA structures, using fragments taken from ribosomal RNA. Each of these target structures could be approximated within a root mean square deviation of 1.0Å using fragments with an average length of more than eight nucleotides.

Författare

Tapani Utriainen

Chalmers, Data- och informationsteknik, Datavetenskap

Graham Kemp

Chalmers, Data- och informationsteknik, Datavetenskap

Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering

1424-1428

Ämneskategorier

Bioinformatik och systembiologi

DOI

10.1109/BIBE.2007.4375760

ISBN

1-4244-1509-8