BackgroundThe general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include arbitrary pseudoknots. For restricted classes of pseudoknots, several polynomial time algorithms have been designed, where the O(n6)time and O(n4) space algorithm by Rivas and Eddy is currently the best available program.ResultsWe introduce the class of canonical simple recursive pseudoknots and present an algorithm that requires O(n4) time and O(n2) space to predict the energetically optimal structure of an RNA sequence, possible containing such pseudoknots. Evaluation against a large collection of known pseudoknotted structures shows the adequacy of the canonization approach and our algorithm.ConclusionsRNA pseudoknots of medium size can now be predicted reliably as well as efficiently by the new algorithm.
Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics
Published 2004 in BMC Bioinformatics
ABSTRACT
PUBLICATION RECORD
- Publication year
2004
- Venue
BMC Bioinformatics
- Publication date
2004-08-04
- Fields of study
Biology, Medicine, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar, PubMed
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-33 of 33 references · Page 1 of 1