Advertisement

Prediction of Minimum Free Energy Structure for Simple Non-standard Pseudoknot

  • Thomas K. F. Wong
  • S. M. Yiu
Part of the Communications in Computer and Information Science book series (CCIS, volume 127)

Abstract

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.

Keywords

RNA Secondary structure prediction Simple non-standard pseudoknot Complex pseudoknot 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Akutsu, T.: Dynamic programming algorithms for rna secondary structure prediction with pseudoknots. Discrete Applied Mathematics 104, 45–62 (2000)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Chen, H., Condon, A., Jabbari, H.: An o(n 5) algorithm for mfe prediction of kissing hairpins and 4- chains in nucleic acids. Journal of Computational Biology 16(6), 803–815 (2009)MathSciNetCrossRefGoogle Scholar
  3. 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
  4. 4.
    Dirks, R., Pierce, N.: A partition function algorithm for nucleic acid secondary structure including pseudoknots. Journal of Comput. Chem. 24(13), 1664–1677 (2003)CrossRefGoogle Scholar
  5. 5.
    Frank, D., Pace, N.: Ribonuclease p: unity and diversity in a trna processing ribozyme. Annu. Rev. Biochem. 67, 153–180 (1998)CrossRefGoogle Scholar
  6. 6.
    Gluick, T., Draper, D.: Thermodynamics of folding a pseudoknotted mrna fragment. Journal of Molecular Biology 241, 246–262 (1994)CrossRefGoogle Scholar
  7. 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
  8. 8.
    Nguyen, V., Kiss, T., Michels, A., Bensaude, O.: 7sk small nuclear rna binds to and inhibits the activity of cdk9/cyclin t complexes. Nature 414, 322–325 (2001)CrossRefGoogle Scholar
  9. 9.
    Reeder, J., Giegerich, R.: Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics. BMC Bioinformatics 5, 104 (2004)CrossRefGoogle Scholar
  10. 10.
    Rivas, E., Eddy, S.: A dynamic programming algorithm for rna structure prediction including pseudoknots. Journal of Molecular Biology 285(5), 2053–2068 (1999)CrossRefGoogle Scholar
  11. 11.
    Roland, E.: Pseudoknots in rna secondary structures: representation, enumeration, and prevalence. Journal of Computational Biology 13(6), 1197–1213 (2006)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Uemura, Y., Hasegawa, A., Kobayashi, S., Yokomori, T.: Tree adjoining grammars for rna structure prediction. Theoretical Computer Science 210, 277–303 (1999)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Yang, Z., Zhu, Q., Luo, K., Zhou, Q.: The 7sk small nuclear rna inhibits the cdk9/cyclin t1 kinase to control transcription. Nature 414, 317–322 (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Thomas K. F. Wong
    • 1
  • S. M. Yiu
    • 1
  1. 1.Department of Computer ScienceThe University of Hong KongHong Kong

Personalised recommendations