RNA Secondary Structure Prediction with Simple Pseudoknots Based on Dynamic Programming
RNA molecules are sequences of nucleotides that serve as more than mere intermediaries between DNA and proteins, e.g. as catalytic molecules. The sequence of nucleotides of an RNA molecule constitutes its primary structure, and the pattern of pairing between nucleotides determines the secondary structure of an RNA. Computational prediction of RNA secondary structure is among the few structure prediction problems that can be solved satisfactory in polynomial time. Most work has been done to predict structures that do not contain pseudoknots. Pseudoknots have generally been excluded from the prediction of RNA secondary structures due to its difficulty in modelling. In this paper, we present a computation the maximum number of base pairs of an RNA sequence with simple pseudoknots. Our approach is based on pseudoknot technique proposed by Akutsu. We show that a structure with the maximum possible number of base pairs could be deduced by a improved Nussinov’s trace-back procedure. In our approach we also considered wobble base pairings (G·U). We introduce an implementation of RNA secondary structure prediction with simple pseudoknots based on dynamic programming algorithm. To evaluate our method we use the 15 sequences with simple pseudoknots of variable size from 19 to 25 nucleotides. We get our experimental data set from PseudoBase. Our program predicts simple pseudoknots with correct or almost correct structure for 53% sequences.
KeywordsNature Publishing Group Pseudoknotted Structure Structure Prediction Problem Wobble Base Pairing Nucleic Acid Secondary Structure
Unable to display preview. Download preview PDF.
- 1.Eddy, S.R.: What is Dynamic Programming? Nature BioTechnology 22(7) (2004) Nature Publishing Group, November, JulyGoogle Scholar
- 2.Robin, D.D.: Prepared under the Direction of Sean R. Eddy.: RNA Structural Alignment Using Stochastic Context-free Grammars. Ph.D thesis presented to the Sever Institute of Washington University (December 2004)Google Scholar
- 3.Stephen McCauley advised by Ian Holmes.: An Analysis of the Relative Efficacy of the Nussinov-Felsenstein, and the Knudsen-Hein, RNA Secondary Structure Prediction, Ph.D thesis presented in October 6 (2003)Google Scholar
- 4.Eddy, S.R.: How do RNA Folding Algorithms Works? Nature BioTechnology, vol. 22. Nature Publishing Group (2004)Google Scholar
- 10.Zuker, M., Stiegler, P.: Optimal Computer Folding of Large RNA Sequences Using Thermodynamics and Auxiliary Information. Nucleic Acids Res. 9(133) (1981)Google Scholar
- 13.Zuker, M., Mathews, D.H., Turner, D.H.: Algorithms and Thermodynamics for RNA Secondary Structure Prediction: A Practical Guide in RNA Biochemistry and Biotechnology. In: Barciszewski, J., Clark, B. (eds.) NATO ASI Series, Kluwer Academic Publishers, Dordrecht (1999)Google Scholar
- 17.Tabaska, J., Stormo, G.: Automated Alignment of RNA Sequences to Pseudoknotted Structures. In: Fifth International Conference on Intelligent Systems for Molecular Biology, pp. 311–318. The AAAI Press, Menlo Park (1997)Google Scholar
- 20.Rivas, E., Eddy, S.R.: Noncoding RNA Gene Detection Using Comparative Sequence Analysis. BioMedCentral 2(8), Bioinformatics (2001)Google Scholar