Advertisement

Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots

  • Mathias Möhl
  • Sebastian Will
  • Rolf Backofen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5029)

Abstract

We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is NP-hard, the algorithmic complexity adapts to the complexity of the RNA structures. Due to fixed parameter tractability, we can guarantee polynomial run-time for a parameter which is small in practice. Our algorithm can be considered as a generalization of the algorithm of Jiang et al. [1] to arbitrary pseudoknots. In their absence, it gracefully degrades to the same polynomial algorithm. A prototypical implementation demonstrates the applicability of the method.

Keywords

RNA alignment pseudoknots fixed parameter tractability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Jiang, T., Lin, G., Ma, B., Zhang, K.: A general edit distance between RNA structures. J. Comput. Biol. 9(2), 371–388 (2002)CrossRefGoogle Scholar
  2. 2.
    Couzin, J.: Breakthrough of the year. Small RNAs make big splash. Science 298(5602), 2296–2297 (2002)Google Scholar
  3. 3.
    Siebert, S., Backofen, R.: MARNA: multiple alignment and consensus structure prediction of RNAs based on sequence structure comparisons. Bioinformatics 21(16), 3352–3359 (2005)CrossRefGoogle Scholar
  4. 4.
    Havgaard, J.H., Torarinsson, E., Gorodkin, J.: Fast pairwise structural RNA alignments by pruning of the dynamical programming matrix. PLoS Comput. Biol. 3(10), 1896–1908 (2007)CrossRefGoogle Scholar
  5. 5.
    Will, S., Reiche, K., Hofacker, I.L., Stadler, P.F., Backofen, R.: Inferring non-coding RNA families and classes by means of genome-scale structure-based clustering. PLoS Comput. Biol. 3(4), 65 (2007)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Bauer, M., Klau, G.W., Reinert, K.: Accurate multiple sequence-structure alignment of RNA sequences using combinatorial optimization. BMC Bioinformatics 8, 271 (2007)CrossRefGoogle Scholar
  7. 7.
    Staple, D.W., Butcher, S.E.: Pseudoknots: RNA structures with diverse functions. PLoS Biol. 3(6), 213 (2005)CrossRefGoogle Scholar
  8. 8.
    Theimer, C.A., Blois, C.A., Feigon, J.: Structure of the human telomerase RNA pseudoknot reveals conserved tertiary interactions essential for function. Mol. Cell 17(5), 671–682 (2005)CrossRefGoogle Scholar
  9. 9.
    Evans, P.A.: Finding common subsequences with arcs and pseudoknots. In: CPM 1999: Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching, London, UK, pp. 270–280. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  10. 10.
    Rivas, E., Eddy, S.R.: A dynamic programming algorithm for RNA structure prediction including pseudoknots. J. Mol. Biol. 285(5), 2053–2068 (1999)CrossRefGoogle Scholar
  11. 11.
    Reeder, J., Giegerich, R.: Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics. BMC Bioinformatics 5, 104 (2004)CrossRefGoogle Scholar
  12. 12.
    Evans, P.A.: Finding common RNA pseudoknot structures in polynomial time. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 223–232. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  13. 13.
    Sankoff, D.: Simultaneous solution of the RNA folding, alignment and protosequence problems. SIAM J. Appl. Math. 45(5), 810–825 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Matsui, H., Sato, K., Sakakibara, Y.: Pair stochastic tree adjoining grammars for aligning and predicting pseudoknot RNA structures. Bioinformatics 21(11), 2611–2617 (2005)CrossRefGoogle Scholar
  15. 15.
    Dost, B., Han, B., Zhang, S., Bafna, V.: Structural alignment of pseudoknotted RNA. In: Apostolico, A., Guerra, C., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2006. LNCS (LNBI), vol. 3909, pp. 143–158. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  16. 16.
    Blin, G., Fertin, G., Hermelin, D., Vialette, S.: Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 271–282. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  17. 17.
    Zwieb, C., Gorodkin, J., Knudsen, B., Burks, J., Wower, J.: tmRDB (tmRNA database). Nucleic Acids Res. 31(1), 446–447 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Mathias Möhl
    • 1
  • Sebastian Will
    • 2
  • Rolf Backofen
    • 2
  1. 1.Programming Systems LabSaarland UniversitySaarbrückenGermany
  2. 2.Bioinformatics, Institute of Computer ScienceAlbert-Ludwigs-UniversitätFreiburgGermany

Personalised recommendations