TY  - JOUR
AB  - Background: The 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. Results: We 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. Conclusions: RNA pseudoknots of medium size can now be predicted reliably as well as efficiently by the new algorithm.
DA  - 2004
DO  - 10.1186/1471-2105-5-104
LA  - eng
IS  - 1
PY  - 2004
SN  - 1471-2105
T2  - BMC Bioinformatics
TI  - Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics
UR  - https://nbn-resolving.org/urn:nbn:de:0070-pub-17737588
Y2  - 2024-11-22T02:38:23
ER  -