Spelling approximate repeated or common motifs using a suffix tree

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

Volumn 1380, Issue , 1998, Pages 374-390

  Sagot, Marie France ^a,b  

^a INSTITUT PASTEUR   (France)

^b Université de Marne la Vallée   (France)

Author keywords

[No Author keywords available]

Indexed keywords

HAMMING DISTANCE;

DNA MACROMOLECULES; FIXED SIZE; REPEATED MOTIFS; SPACE BOUNDS; SUFFIX-TREES; TIME BOUND;

FORESTRY;

EID: 80053455778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054337     Document Type: Conference Paper

References (25)

1. R. Baeza-Yates and G. H. Gonnet. A new approach to text searching. Commun. ACM, 35:74-82, 1992.
2. P. Bieganski, J. Riedl, J. V. Carlis, and E.M. Retzel. Generalized suffix trees for biological sequence data: applications and implementations. In Proc. of the 27th Haruai Int. Conf. on Systems Sci., pages 35-44. IEEE Computer Society Press, 1994.
3. B. Clift, D. Haussler, R. McConnell, T. D. Schneider, and G. D. Stormo. Sequence landscapes. Nucleic Acids Res., 14:141-158, 1986.
4. A.L. Cobbs. Fast identification of approximately matching substrings. In Z. Galil and E. Ukkonen, editors, Combinatorial Pattern Matching, volume 937 of Lecture Notes in Computer Science, pages 41-54. Springer Verlag, 1995.
5. M. Crochemore. An optimal algorithm for computing the repetitions in a word. Inf. Proc. Letters, 12:244-250, 1981.
6. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994.
7. D. J. Galas, M. Eggert, and M. S. Waterman. Rigorous pattern-recognition methods for DNA sequences. Analysis of promoter sequences from Escherichia coli. J. Mol. Biol, 186:117-128, 1985.
8. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. Cambridge University Press, 1997.
9. L. C. K. Hui. Color set size problem with applications to string matching. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Combinatorial Pattern Matching, volume 644 of Lecture Notes in Computer Science, pages 230-243. Springer-Verlag, 1992.
10. C. E. Lawrence and A. A. Reilly. An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins: struct., fund., and genetics, 7:41-51, 1990.
11. C. Lefevre and J.-E. Ikeda. A fast word search algorithm for the representation of sequence similarity in genomic DNA. Nucleic Acids Res., 22:404-411, 1994.
12. E. M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23:262-272, 1976.
13. E. W. Myers. A sublinear algorithm for approximate keyword searching. Algorith-mica, 12:345-374, 1994.
14. E. W. Myers. 1997. personal communication.
15. M.-F. Sagot, V. Escalier, A. Viari, and H. Soldano. Searching for repeated words in a text allowing for mismatches and gaps. In R. Baeza-Yates and U. Manber, editors, Second South American Workshop on String Processing, pages 87-100, Viflas del Mar, Chili, 1995. University of Chili.
16. M.-F. Sagot and E. W. Myers. Identifying satellites in nucleic acid sequences. 1998. submitted to RECOMB 1998.
17. M.-F. Sagot and A. Viari. A double combinatorial approach to discovering patterns in biological sequences. In D. Hirschberg and G. Myers, editors, Combinatorial Pattern Matching, volume 1075 of Lecture Notes in Computer Science, pages 186-208. Springer-Verlag, 1996.
18. M.-F. Sagot, A. Viari, and H. Soldano. Multiple comparison: a peptide matching approach. Theoret. Comput. Sci., 180:115-137, 1997. presented at Combinatorial Pattern Matching 1995.
19. E. Ukkonen. Constructing suffix trees on-line in linear time, pages 484-492. IFIP'92, 1992.
20. E. Ukkonen. Approximate string matching over suffix trees. In Z. Galil A. Apos-tolico, M. Crochemore and U. Manber, editors, Combinatorial Pattern Matching, volume 684 of Lecture Notes in Computer Science, pages 228-242. Springer-Verlag, 1993.
21. M. S. Waterman. Multiple sequence alignments by consensus. Nucleic Acids Res., 14:9095-9102, 1986.
22. M. S. Waterman. Consensus patterns in sequences. In M. S. Waterman, editor, Mathematical Methods for DNA Sequences, pages 93-116. CRC Press, 1989.
23. M. S. Waterman, R. Arratia, and D. J. Galas. Pattern recognition in several sequences: consensus and alignment. Bull. Math. Biol., 46:515-527, 1984.
24. S. Wu and U. Manber. Agrep - a fast approximate pattern-matching tool, pages 153-162, San Francisco, CA, 1992. USENIX Technical Conference.
25. S. Wu and U. Manber. Fast text searching allowing errors. Commun. ACM, 35:83-91, 1992.