An Efficient Algorithm to Compute the Landscape of Locally Optimal RNA Secondary Structures with Respect to the Nussinov–Jacobson Energy Model
- 1 February 2005
- journal article
- Published by Mary Ann Liebert Inc in Journal of Computational Biology
- Vol. 12 (1) , 83-101
- https://doi.org/10.1089/cmb.2005.12.83
Abstract
We make a novel contribution to the theory of biopolymer folding, by developing an efficient algorithm to compute the number of locally optimal secondary structures of an RNA molecule, with respect to the Nussinov-Jacobson energy model. Additionally, we apply our algorithm to analyze the folding landscape of selenocysteine insertion sequence (SECIS) elements from A. Bock (personal communication), hammerhead ribozymes from Rfam (Griffiths-Jones et al., 2003), and tRNAs from Sprinzl's database (Sprinzl et al., 1998). It had previously been reported that tRNA has lower minimum free energy than random RNA of the same compositional frequency (Clote et al., 2003; Rivas and Eddy, 2000), although the situation is less clear for mRNA (Seffens and Digby, 1999; Workman and Krogh, 1999; Cohen and Skienna, 2002),(1) which plays no structural role. Applications of our algorithm extend knowledge of the energy landscape differences between naturally occurring and random RNA. Given an RNA molecule a(1), ... , a(n) and an integer k > or = 0, a k-locally optimal secondary structure S is a secondary structure on a(1), ... , a(n) which has k fewer base pairs than the maximum possible number, yet for which no basepairs can be added without violation of the definition of secondary structure (e.g., introducing a pseudoknot). Despite the fact that the number numStr(k) of k-locally optimal structures for a given RNA molecule in general is exponential in n, we present an algorithm running in time O(n (4)) and space O(n (3)), which computes numStr(k) for each k. Structurally important RNA, such as SECIS elements, hammerhead ribozymes, and tRNA, all have a markedly smaller number of k-locally optimal structures than that of random RNA of the same dinucleotide frequency, for small and moderate values of k. This suggests a potential future role of our algorithm as a tool to detect noncoding RNA genes.Keywords
This publication has 27 references indexed in Scilit:
- A statistical sampling algorithm for RNA secondary structure predictionNucleic Acids Research, 2003
- Natural Selection and Algorithmic Design of mRNAJournal of Computational Biology, 2003
- Barrier Trees of Degenerate LandscapesZeitschrift für Physikalische Chemie, 2002
- Statistical prediction of single-stranded regions in RNA secondary structure and application to predicting effective antisense target sites and beyondNucleic Acids Research, 2001
- RNA folding at elementary step resolutionRNA, 2000
- Protein Folding in the Hydrophobic-Hydrophilic (HP) Model is NP-CompleteJournal of Computational Biology, 1998
- On the Complexity of Protein FoldingJournal of Computational Biology, 1998
- Compact polymersMacromolecules, 1989
- Spin glasses and the statistical mechanics of protein folding.Proceedings of the National Academy of Sciences, 1987
- Principles that Govern the Folding of Protein ChainsScience, 1973