RNA Pseudoknot Prediction in Energy-Based Models
- 1 August 2000
- journal article
- research article
- Published by Mary Ann Liebert Inc in Journal of Computational Biology
- Vol. 7 (3-4), 409-427
- https://doi.org/10.1089/106652700750050862
Abstract
RNA molecules are sequences of nucleotides that serve as more than mere intermediaries between DNA and proteins, e.g., as catalytic molecules. Computational prediction of RNA secondary structure is among the few structure prediction problems that can be solved satisfactorily in polynomial time. Most work has been done to predict structures that do not contain pseudoknots. Allowing pseudoknots introduces modeling and computational problems. In this paper we consider the problem of predicting RNA secondary structures with pseudoknots based on free energy minimization. We first give a brief comparison of energy-based methods for predicting RNA secondary structures with pseudoknots. We then prove that the general problem of predicting RNA secondary structures containing pseudoknots is NP complete for a large class of reasonable models of pseudoknots.Keywords
This publication has 19 references indexed in Scilit:
- Fast evaluation of internal loops in RNA secondary structure prediction.Bioinformatics, 1999
- RNA secondary structure prediction using stochastic context-free grammars and evolutionary history.Bioinformatics, 1999
- Expanded sequence dependence of thermodynamic parameters improves prediction of RNA secondary structureJournal of Molecular Biology, 1999
- A dynamic programming algorithm for RNA structure prediction including pseudoknots 1 1Edited by I. TinocoJournal of Molecular Biology, 1999
- RNA sequence analysis using covariance modelsNucleic Acids Research, 1994
- The equilibrium partition function and base pair binding probabilities for RNA secondary structureBiopolymers, 1990
- An energy model that predicts the correct folding of both the tRNA and the 5S RNA moleculesNucleic Acids Research, 1984
- Fast algorithm for predicting the secondary structure of single-stranded RNA.Proceedings of the National Academy of Sciences, 1980
- Algorithms for Loop MatchingsSIAM Journal on Applied Mathematics, 1978
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975