Classifying RNA pseudoknotted structures

63Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.

Abstract

Computational prediction of the minimum free energy (mfe) secondary structure of an RNA molecule from its base sequence is valuable in understanding the structure and function of the molecule. Since the general problem of predicting pseudoknotted secondary structures is NP-hard, several algorithms have been proposed that find the mfe secondary structure from a restricted class of secondary structures. In this work, we order the algorithms by generality of the structure classes that they handle. We provide simple characterizations of the classes of structures handled by four algorithms, as well as linear time methods to test whether a given secondary structure is in three of these classes. We report on the percentage of biological structures from the PseudoBase and Gutell databases that are handled by these three algorithms. © 2003 Published by Elsevier B.V.

Cite

CITATION STYLE

APA

Condon, A., Davy, B., Rastegari, B., Zhao, S., & Tarrant, F. (2004). Classifying RNA pseudoknotted structures. Theoretical Computer Science, 320(1), 35–50. https://doi.org/10.1016/j.tcs.2004.03.042

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free