A dynamic programming algorithm for finding alternative RNA secondary structures.
AUTOR(ES)
Williams, A L
RESUMO
Dynamic programming algorithms that predict RNA secondary structure by minimizing the free energy have had one important limitation. They were able to predict only one optimal structure. Given the uncertainties of the thermodynamic data and the effects of proteins and other environmental factors on structure, the optimal structure predicted by these methods may not have biological significance. We present a dynamic programming algorithm that can determine optimal and suboptimal secondary structures for an RNA. The power and utility of the method is demonstrated in the folding of the intervening sequence of the rRNA of Tetrahymena. By first identifying the major secondary structures corresponding to the lowest free energy minima, a secondary structure of possible biological significance is derived.
ACESSO AO ARTIGO
http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=339410Documentos Relacionados
- Incorporating chemical modification constraints into a dynamic programming algorithm for prediction of RNA secondary structure
- A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
- A genetic algorithm based molecular modeling technique for RNA stem-loop structures.
- Computer-aided prediction of RNA secondary structures.
- A dynamic programming algorithm for haplotype block partitioning