RNA multiple structural alignment with longest common subsequences

Journal of Combinatorial Optimization

Volumn 13, Issue 2, 2007, Pages 179-188

  Bereg, Sergey ^a   Kubica, Marcin ^b   Waleń, Tomasz ^b   Zhu, Binhai ^c  

^a The University of Texas at Dallas   (United States)

^b UNIVERSITY OF WARSAW   (Poland)

^c Montana State University   (United States)

Author keywords

Dynamic programming; Longest common subsequence; RNA multiple structure alignment

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DYNAMIC PROGRAMMING; POLYNOMIALS;

MAXIMUM LOOP CHAIN PROBLEMS; RNA MULTIPLE STRUCTURE ALIGNMENT; RNA SEQUENCES;

RNA;

EID: 33845917083     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-006-9020-x     Document Type: Article

References (23)

1. Chin FYL, De Santis A, Ferrara AL, Ho NL, Kim SK (2004) A simple algorithm for the constrained sequence problems. Inform Proc Lett 90(4):175-179
2. Cormen T, Leiserson C, Rivest R, Stein C (2001) Introduction to Algorithms, 2nd edn, MIT Press
3. Dayhoff M (1965) Computer aids to protein sequence determination. J Theoret Biol 8(1):97-112
4. Dayhoff M (1969) Computer analysis of protein evolution. Sci Am 221(1):86-95
5. Davydov E, Batzoglu S (2004) A computational model for RNA multiple structural alignment. In: Proc. 15th Ann. Symp. Combinatorial Pattern Matching, LNCS 3109, pp 254-269
6. Deng X, Li G, Li Z, Ma B, Wang L (2002) A PTAS for distinguishing (sub)string selection. In: Proc. ICALP'02, pp 740-751
7. Eddy SR (2001) Noncoding RNA genes and the modern RNA world. Nat Rev Genet 2:919-929
8. Goldman D, Istrail S, Papadimitriou C (1999) Algorithmic aspects of protein structure similarity. In: Proc. 40th Ann. Symp. Foundations of Computer Science (FOCS'99), pp 512-522
9. Greenberg RI (2003) Bounds on the Number of the Longest Common Subsequence Problem. CoRR cs.DM/0301030
10. Hirschberg D (1975) The longest common subsequence problem. PhD Thesis, Princeton University
11. Hsu WJ, Du MW (1984) Computing a longest common subsequence for a set of strings. BIT 24:45-59
12. Jiang T, Li M (1995) On the approximation of shortest common supersequences and longest common subsequences. SIAM J Comput 24(5):1122-1139
13. Kubica M, Rizzi R, Vialette S, Walen T (2006) Approximation of RNA multiple structural alignment. In: Proc. 17th Ann Symp Combinatorial Pattern Matching, LNCS 4009, pp 211-222
14. Lanctot K, Li M, Ma B, Wang S, Zhang L (1999) Distinguishing string selection problems. In: Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp 633-642
15. M, Ma B, Wang L (1999) Finding similar regions in many strings. In: Proc. 31st ACM Symp. on Theory of Computing (STOC'99), pp 473-482
16. Maier D (1978) The complexity of some problems on subsequences and supersequences. J ACM 25:322-336
17. Nussinov R, Pieczenik G, Griggs J, Kleitman D (1978) Algorithms for loop matching. SIAM J Appl Math 35:68-82
18. Rick C (2000) Efficient computation of all longest common subsequences. In: Proc. 7th Scandinavian Workshop on Algorithm Theory (SWAT'00), pp 407-418
19. Rivas E, Eddy SR (1999) A dynamic programming algorithm for RNA structure prediction including pseudoknots. J Mol Biol 285:2053-2068
20. Smith TF, Waterman MS (1981) Identification of common molecular subsequences. J Mol Biol 147:195-197
21. Tsai Y-T (2003) The constrained longest common subsequence problem. Inform Proc Lett 88(4):173-176
22. Zucker M, Stiegler P (1981) Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Res 9:133-148
23. Zucker M (1989) Computer prediction of RNA structure. Methods Enzymol 180:262-288