Generalization of a suffix tree for RNA structural pattern matching

Algorithmica (New York)

Volumn 39, Issue 1, 2004, Pages 1-19

  Shibuya, Tetsuo ^a  

^a IBM RESEARCH TOKYO   (Japan)

Author keywords

Computational biology; Parameterized suffix tree; Pattern matching; RNA structure matching; Suffix tree generalization

Indexed keywords

ALGORITHMS; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL METHODS; DATABASE SYSTEMS; DNA SEQUENCES; MOLECULAR BIOLOGY; PARAMETER ESTIMATION; PATTERN MATCHING; RNA;

COMPUTATIONAL BIOLOGY; PARAMETERIZED SUFFIX TREE; RNA STRUCTURE MATCHING; SUFFIX TREE GENERALIZATION;

TREES (MATHEMATICS);

EID: 21044459032     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1067-9     Document Type: Article

References (21)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Design and Analysis of Algorithms, Addison-Wesley, Reading, MA, 1974.
2. V. R. Akmaev, S. T. Kelley, and G. D. Stormo, A Phylogenetic Approach to RNA Structure Prediction, Proc. 7th International Conference on Intelligent Systems for Molecular Biology, 1999, pp. 10-17.
3. B. S. Baker, A Program for Identifying Duplicated Code, Computing Science and Statistics, Interface Foundation of North America, Fairfax Station, VA, 1992, pp. 49-57.
4. B. S. Baker, Parameterized Pattern Matching by Boyer-Moore-type Algorithms, Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 541-550.
5. B. S. Baker, Parameterized Pattern Matching: Algorithms and Applications, J. Comput. System Sci., 52(1) (1996), 28-42.
6. B. S. Baker, Parameterized Duplication in Strings: Algorithms and Application to Software Maintenance, SIAM J. Comput., 26(5) (1997), 1343-1362.
7. B. S. Baker, Parameterized Diff, Proc. 10th ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 854-855.
8. R. Cole and R. Hariharan, Dynamic LCA Queries on Trees, Proc. 10th ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 235-244.
9. M. Farach, Optimal Suffix Tree Construction with Large Alphabets, Proc. 3&th IEEE Symposium on Foundations of Computer Science, 1997, pp. 137-143.
10. D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, Cambridge, 1997.
11. D. Harel and R. R. Tarjan, Fast Algorithms for Finding Nearest Common Ancestors, SIAM J. Comput., 13 (1984), 338-355.
12. S. R. Kosaraju, Faster Algorithms for the Construction of Parameterized Suffix Trees, Proc. 36th IEEE Symposium on Foundations of Computer Science, 1995, pp. 631-637.
13. H. P. Lenhof, K. Reinert, and M. Vingron, A Polyhedral Approach to RNA Sequence Structure Alignment, Proc. 2nd Annual International Conference on Computational Molecular Biology (RECOMB '98), 1998, pp. 153-162.
14. R. B. Lyogso, M. Zuker, and C. N. S. Pedersen, Internal Loops in RNA Secondary Structure Prediction, Proc. 3rd Annual International Conference on Computational Molecular Biology (RECOMB '99), 1999, pp. 260-267.
15. E. M. McCreight, A Space-Economical Suffix Tree Construction Algorithm, J. Assoc. Comput. Mach., 23 (1976), 262-272.
16. J. Setubal and J. Meidanis, Introduction to Computational Molecular Biology, PWS, Boston, MA, 1997.
17. D. H. Turner, N. Sugimoto, and S. M. Freier, RNA Structure Prediction, Ann. Rev. Biophys. Chem.,17 (1988), 167-192.
18. E. Ukkonen, On-Line Construction of Suffix-Trees, Algorithmica, 14 (1995), 249-260.
19. Z. Wang and K. Zhang, Finding Common RNA Secondary Structures from RNA Sequences, Proc. 4th Symposium on Combinatorial Pattern Matching, LNCS 1645, Springer-Verlag, Berlin, 1999, pp. 258-269.
20. M. S. Waterman, Introduction to Computational Biology, Chapman & Hall, London, 1995.
21. P. Weiner, Linear Pattern Matching Algorithms, Proc. 14th Symposium on Switching and Automata Theory, 1973, pp. 1-11.