Sparse RNA folding: Time and space efficient algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5577 LNCS, Issue , 2009, Pages 249-262

  Backofen, Rolf ^a   Tsur, Dekel ^b   Zakov, Shay ^b   Ziv Ukelson, Michal ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BASE-PAIRING; CARDINALITIES; CLASSICAL ALGORITHMS; INPUT SEQUENCE; RNA FOLDING; SECONDARY STRUCTURES; SIMULTANEOUS ALIGNMENT; SPACE ALGORITHMS; SPACE COMPLEXITY; SPACE REDUCTIONS; SPEED-UPS; SUB-PROBLEMS; SUPPORTING MATERIAL; TIME AND SPACE;

NUCLEIC ACIDS; PATTERN MATCHING; PHASE MODULATION; RNA;

ALGORITHMS;

EID: 70350639137     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02441-2_22     Document Type: Conference Paper

References (21)

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)
2. Zuker, M.: Mfold web server for nucleic acid folding and hybridization prediction. Nucleic Acids Research (13), 3406-3415 (2003)
3. Hofacker, I.L.: Vienna RNA secondary structure server. Nucleic Acids Research (13), 3429-3431 (2003)
4. Zuker, M.: Computer prediction of RNA structure. Methods Enzymol. 180, 262-288 (1989)
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)
6. Waterman, M., Smith, T.: RNA secondary structure: a complete mathematical analysis. Mathematical Biosciences 42, 257-266 (1978)
7. Nussinov, R., Jacobson, A.B.: Fast algorithm for predicting the secondary structure of single-stranded RNA. PNAS 77(11), 6309-6313 (1980)
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)
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)
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)
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)
12. Sankoff, D.: Simultaneous solution of the RNA folding, alignment and protose-quence problems. SIAM Journal on Applied Mathematics 45(5), 810-825 (1985)
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)
14. Havgaard, J., Lyngso, R., Stormo, G., Gorodkin, J.: Pairwise local structural alignment of RNA sequences with sequence similarity less than 40%. Bioinfor-matics 21(9), 1815-1824 (2005)
15. Ziv-Ukelson, M., Gat-Viks, I., Wexler, Y., Shamir, R.: A faster algorithm for RNA co-folding, pp. 174-185 (2008)
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)
17. Gardner, P.P., Giegerich, R.: A comprehensive comparison of comparative RNA structure prediction approaches. BMC Bioinformatics 5, 140 (2004)
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. Al-gorithmica 46(2), 223-245 (2006)
19. Durbin, R., Eddy, S., Krogh, A., Mitchison, G.: Biological sequence analysis: Probabilistic models of proteins and nucleic acids. Cambridge University Press, Cambridge (1998)
20. Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Communications of the ACM 18(6), 341-343 (1975)
21. Hirschberg, D.S.: Algorithms for the longest common subsequence problem. JACM 24, 664-675 (1977)