Sparse RNA Folding: Time and Space Efficient Algorithms

  • Rolf Backofen
  • Dekel Tsur
  • Shay Zakov
  • Michal Ziv-Ukelson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5577)

Abstract

The classical algorithm for RNA single strand folding requires O(nZ) time and O(n2) space, where n denotes the length of the input sequence and Z is a sparsity parameter that satisfies n ≤ Z ≤ n2. We show how to reduce the space complexity of this algorithm. The space reduction is based on the observation that some solutions for subproblems are not examined after a certain stage of the algorithm, and may be discarded from memory. This yields an O(nZ) time and O(Z) space algorithm, that outputs both the cardinality of the optimal folding as well as a corresponding secondary structure. The space-efficient approach also extends to the related RNA simultaneous alignment with folding problem, and can be applied to reduce the space complexity of the fastest algorithm for this problem from O(n2m2) down to \(O(nm^2 + \tilde{Z})\), where n and m denote the lengths of the input sequences to be aligned, and \(\tilde{Z}\) is a sparsity parameter that satisfies nm ≤ \(\tilde{Z}\) ≤ n2m2.

In addition, we also show how to speed up the base-pairing maximization variant of RNA single strand folding. The speed up is achieved by combining two independent existing techniques, which restrict the number of expressions that need to be examined in bottleneck computations of these algorithms. This yields an O(LZ) time and O(Z) space algorithm, where L denotes the maximum cardinality of a folding of the input sequence.

Additional online supporting material may be found at:

http://www.cs.bgu.ac.il/zakovs/RNAfold/CPM09_supporting_material.pdf

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Consortium, A.F.B., Backofen, R., Bernhart, S.H., Flamm, C., Fried, C., Fritzsch, G., Hackermuller, J., Hertel, J., Hofacker, I.L., Missal, K., Mosig, A., Prohaska, S.J., Rose, D., Stadler, P.F., Tanzer, A., Washietl, S., Will, S.: RNAs everywhere: genome-wide annotation of structured RNAs. Journal of Experimental Zoology Part B: Molecular and Developmental Evolution 308(1), 1–25 (2007)Google Scholar
  2. 2.
    Zuker, M.: Mfold web server for nucleic acid folding and hybridization prediction. Nucleic Acids Research (13), 3406–3415 (2003)CrossRefGoogle Scholar
  3. 3.
    Hofacker, I.L.: Vienna RNA secondary structure server. Nucleic Acids Research (13), 3429–3431 (2003)CrossRefGoogle Scholar
  4. 4.
    Zuker, M.: Computer prediction of RNA structure. Methods Enzymol. 180, 262–288 (1989)CrossRefMATHGoogle Scholar
  5. 5.
    Tinoco, I., Borer, P., Dengler, B., Levine, M., Uhlenbeck, O., Crothers, D., Gralla, J.: Improved estimation of secondary structure in ribonucleic acids. Nature New Biology 246, 40–41 (1973)CrossRefGoogle Scholar
  6. 6.
    Waterman, M., Smith, T.: RNA secondary structure: a complete mathematical analysis. Mathematical Biosciences 42, 257–266 (1978)CrossRefMATHGoogle Scholar
  7. 7.
    Nussinov, R., Jacobson, A.B.: Fast algorithm for predicting the secondary structure of single-stranded RNA. PNAS 77(11), 6309–6313 (1980)CrossRefGoogle Scholar
  8. 8.
    Zuker, M., Stiegler, P.: Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Research 9(1), 133–148 (1981)CrossRefGoogle Scholar
  9. 9.
    Akutsu, T.: Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages. Journal of Combinatorial Optimization 3, 321–336 (1999)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Wexler, Y., Zilberstein, C., Ziv-Ukelson, M.: A study of accessible motifs and RNA folding complexity. Journal of Computational Biology 14(6), 856–872 (2007)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. In: Proc. 39th Symposium on the Theory of Computing (STOC), pp. 590–598 (2007)Google Scholar
  12. 12.
    Sankoff, D.: Simultaneous solution of the RNA folding, alignment and protosequence problems. SIAM Journal on Applied Mathematics 45(5), 810–825 (1985)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Mathews, D.H., Turner, D.H.: Dynalign: an algorithm for finding the secondary structure common to two RNA sequences. Journal of Molecular Biology 317(2), 191–203 (2002)CrossRefGoogle Scholar
  14. 14.
    Havgaard, J., Lyngso, R., Stormo, G., Gorodkin, J.: Pairwise local structural alignment of RNA sequences with sequence similarity less than 40%. Bioinformatics 21(9), 1815–1824 (2005)CrossRefGoogle Scholar
  15. 15.
    Ziv-Ukelson, M., Gat-Viks, I., Wexler, Y., Shamir, R.: A faster algorithm for RNA co-folding, pp. 174–185 (2008)Google Scholar
  16. 16.
    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 Computational Biology 3(4), e65 (2007)CrossRefGoogle Scholar
  17. 17.
    Gardner, P.P., Giegerich, R.: A comprehensive comparison of comparative RNA structure prediction approaches. BMC Bioinformatics 5, 140 (2004)CrossRefGoogle Scholar
  18. 18.
    Jansson, J., Ng, S.K., Sung, W.K., Willy, H.: A faster and more space-efficient algorithm for inferring arc-annotations of RNA sequences through alignment. Algorithmica 46(2), 223–245 (2006)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Durbin, R., Eddy, S., Krogh, A., Mitchison, G.: Biological sequence analysis: Probabilistic models of proteins and nucleic acids. Cambridge University Press, Cambridge (1998)CrossRefMATHGoogle Scholar
  20. 20.
    Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Communications of the ACM 18(6), 341–343 (1975)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Hirschberg, D.S.: Algorithms for the longest common subsequence problem. JACM 24, 664–675 (1977)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Rolf Backofen
    • 1
  • Dekel Tsur
    • 2
  • Shay Zakov
    • 2
  • Michal Ziv-Ukelson
    • 2
  1. 1.Albert Ludwigs UniversityFreiburgGermany
  2. 2.Department of Computer ScienceBen-Gurion University of the NegevIsrael

Personalised recommendations