Local gapped subforest alignment and its application in finding RNA structural motifs

Journal of Computational Biology

Volumn 13, Issue 3, 2006, Pages 702-718

  Jansson, Jesper ^a   Hieu, Ngo Trung ^a   Sung, Wing Kin ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Dynamic programming; Gapped subforest; Local forest alignment; Local sequence structure motif; RNA secondary structure

Indexed keywords

RNA;

ALGORITHM; COMPUTER PROGRAM; CONCEPT ANALYSIS; CONFERENCE PAPER; LOCAL GAPPED SUBFOREST ALIGNMENT; LOCAL SEQUENCE STRUCTURE ALIGNMENT PROBLEM; PRIORITY JOURNAL; PROTEIN MOTIF; PROTEIN SECONDARY STRUCTURE; RNA MOTIF; RNA STRUCTURE; SEQUENCE ALIGNMENT; STRUCTURE ANALYSIS;

NUCLEIC ACID CONFORMATION; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, RNA; SOFTWARE;

EID: 33744477338     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2006.13.702     Document Type: Conference Paper

References (28)

1. Alber, J., Gramm, J., Guo, J., and Niedermeier, R. 2004. Computing the similarity of two sequences with nested are annotations. Theoret. Comput. Sci. 312(2-3), 337-358.
2. Backofen, R., and Will, S. To appear. Local sequence-structure motifs in RNA. J. Bioinformatics and Computational Biology.
3. Balna, V., Muthukrishnan, S., and Ravi, R. 1995. Computing similarity between RNA strings. Proc. 6th Ann. Symp. on Combinatorial Pattern Matching (CPM 95), 1-16.
4. Baxter, I.D., Yahin, A., Moura, L., Sant'Anna, M., and Bier, L. 1998. Clone detection using abstract syntax trees. Proc. IEEE Int. Conf. on Software Maintenance (ICSM 1998), 368-377.
5. Brown, J.W. 1999. The ribonuclease P database. Nucl. Acids Res. 27(1), 314.
6. Chawathe, S.S., Rajaraman, A., Garcia-Molina, H., and Widom, J. 1996. Change detection in hierarchically structured information. Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD 1996), 493-504.
7. Collins, L.J., Moulton, V., and Penny, D. 2000. Use of RNA secondary structure for studying the evolution of RNase P and RNase MRP. J. Mol. Evol. 51(3), 194-204.
8. Evans, P.A. 1999a. Algorithms and Complexity for Annotated Sequence Analysis. PhD thesis. University of Victoria, Canada.
9. Evans, P.A. 1999b. Finding common subsequences with arcs and pseudoknots. Proc. 10th Ann. Symp. on Combinatorial Pattern Matching (CPM 99), 270-280.
10. Gramm, J., Guo, J., and Niedermeier, R. 2002. Pattern matching for arc-annotated sequences. Proc. 22nd Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002), 182-193.
11. Höchsmann, M., Töller, T. Giegerich, R., and Kurtz, S. 2003. Local similarity in RNA secondary structures. Proc. Computational Systems Bioinformatics Conf. (CSB2003), 159-168.
12. Jansson, J., and Lingas, A. 2003. A fast algorithm for optimal alignment between similar ordered trees. Fundamenta Informaticae 56(1-2), 105-120.
13. Jiang, T., Lin, G., Ma, B., and Zhang, K. 2002. A general edit distance between RNA structures. J. Comp. Biol. 9(2), 371-388.
14. Jiang, T., Lin, G., Ma, B., and Zhang, K. 2004. The longest common subsequence problem for arc-annotated sequences. J. Discrete Algorithms 2(2), 257-270.
15. Jiang, T., Wang, L., and Zhang, K. 1995. Alignment of trees-an alternative to tree edit. Theoret. Comput. Sci. 143(1), 137-148.
16. Le, S.-Y., Nussinov, R., and Maizel, J.V. 1989. Tree graphs of RNA secondary structures and their comparisons. Computers and Biomedical Res. 22, 461-473.
17. Lenhof, H.-P., Reinert, K., and Vingron, M. 1998. A polyhedral approach to RNA sequence structure alignment. J. Comp. Biol. 5(3), 517-530.
18. Lin, G., Chen, Z.-Z., Jiang, T. and Wen, J. 2002. The longest common subsequence problem for sequences with nested arc annotations. J. Computer and System Sci. 65(3), 465-480.
19. Notredame, C., O'Brien, E.A., and Higgins, D.G. 1997. RAGA: RNA sequence alignment by genetic algorithm. Nucl. Acids Res. 25(22), 4570-4580.
20. Shapiro, B.A., and Zhang, K. 1990. Comparing multiple RNA secondary structures using tree comparisons. Computer Applications in the Biosciences 6(4), 309-318.
21. Tai, K.-C. 1979. The tree-to-tree correction problem. J. ACM 26(3), 422-433.
22. Wang, J.T.L., Shasha, D., Chang, G.J.S., Relihan, L., Zhang, K., and Patel, G. 1997. Structural matching and discovery in document databases. Proc. ACM SIGMOD Int. Coonf. on Management of Data (SIGMOD 1997), 560-563.
23. Wang, J.T.L., and Zhang, K. 2000. Identifying consensus of trees through alignment. Information Sci. 126(1-4), 165-189.
24. Wang, L., and Zhao, J. 2003. Parametric alignment of ordered trees. Bioinformatics 19(17), 2237-2245.
25. Wilting, R., Schorling, S., Persson, B.C., and Böck, A. 1997. Selenoprotein synthesis in archaea: Identification of an mRNA element of Methanococcns jannaschii probably directing selenocysteine insertion. J. Mol. Biol. 266(4), 637-641.
26. Yang, W. 1991. Identifying syntactic differences between two programs. Software: Practice and Experience 21(7), 739-755.
27. Zhang, K., and Jiang, T. 1994. Some MAX SNP-hard results concerning unordered labeled trees. Inform. Proc. Lett. 49(5), 249-254.
28. Zhang, K., and Shasha, D. 1989. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18(6), 1245-1262.