Prediction of Minimum Free Energy Structure for Simple Non-standard Pseudoknot
Predicting the secondary structure with minimum free energy of an RNA molecule is an important problem in computational biology. Unfortunately, the problem is in general NP-hard if there are pseudoknots in the structure. Existing algorithms usually target at some restricted classes of pseudoknots. In this paper, we extend the current classification of pseudoknots to capture more complicated pseudoknots, namely the simple non-standard pseudoknots of degree k. We provide an algorithm to compute the structure with minimum free energy for this type of pseudoknots of degree 4 which covers all known secondary structures of RNAs in this class. Our algorithm runs in O(m 4) time where m is the length of the input RNA sequence.
KeywordsRNA Secondary structure prediction Simple non-standard pseudoknot Complex pseudoknot
Unable to display preview. Download preview PDF.
- 3.Deogun, J., Donis, R., Komina, O., Ma, F.: Rna secondary structure prediction with simple pseudoknots. In: Proceedings of the second conference on Asia- Pacific Bioinformatics Conference (APBC 2004), pp. 239–246 (2004)Google Scholar
- 7.Lyngso, R., Pedersen, C.: A dynamic programming algorithm for rna structure prediction including pseudoknots. In: Proc. of the Fourth Annual International Conferences on Compututational Molecular Biology (RECOMB 2000). ACM Press, New York (2000)Google Scholar