Journal of Mathematical Biology

, Volume 56, Issue 1, pp 129–144

Variations on RNA folding and alignment: lessons from Benasque

Authors

  • Athanasius F. Bompfünewerer
    • Zentralfriedhof Wien
    • Department of Theoretical ChemistryUniversity of Vienna
  • Rolf Backofen
    • Bioinformatics Group, Department of Computer ScienceUniversity of Freiburg
  • Stephan H. Bernhart
    • Department of Theoretical ChemistryUniversity of Vienna
  • Jana Hertel
    • Bioinformatics Group, Department of Computer Science, and Interdisciplinary Center for BioinformaticsUniversity of Leipzig
  • Ivo L. Hofacker
    • Department of Theoretical ChemistryUniversity of Vienna
    • Department of Theoretical ChemistryUniversity of Vienna
    • Bioinformatics Group, Department of Computer Science, and Interdisciplinary Center for BioinformaticsUniversity of Leipzig
    • Santa Fe Institute
  • Sebastian Will
    • Bioinformatics Group, Department of Computer ScienceUniversity of Freiburg
Article

DOI: 10.1007/s00285-007-0107-5

Cite this article as:
Bompfünewerer, A.F., Backofen, R., Bernhart, S.H. et al. J. Math. Biol. (2008) 56: 129. doi:10.1007/s00285-007-0107-5

Abstract

Dynamic programming algorithms solve many standard problems of RNA bioinformatics in polynomial time. In this contribution we discuss a series of variations on these standard methods that implement refined biophysical models, such as a restriction of RNA folding to canonical structures, and an extension of structural alignments to an explicit scoring of stacking propensities. Furthermore, we demonstrate that a local structural alignment can be employed for ncRNA gene finding. In this context we discuss scanning variants for folding and alignment algorithms.

Keywords

RNA foldingSecondary structure alignmentDynamic programming

Mathematics Subject Classification (2000)

90C2790C9092C40

Copyright information

© Springer-Verlag 2007