Space efficient computation of rare maximal exact matches between multiple sequences

Journal of Computational Biology

Volumn 15, Issue 4, 2008, Pages 357-377

  Ohlebusch, Enno ^a   Kurtz, Stefan ^b  

^a UNIVERSITY OF ULM   (Germany)

^b UNIVERSITY OF HAMBURG   (Germany)

Author keywords

Algorithms; Alignment; Strings; Suffix trees

Indexed keywords

ALGORITHM; ARTICLE; GENOME; GENOMICS; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; SEQUENCE ANALYSIS;

ALGORITHMS; BASE SEQUENCE; COMPUTATIONAL BIOLOGY; DATABASES, NUCLEIC ACID; GENOMICS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA;

EID: 43449126511     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2007.0105     Document Type: Article

References (23)

1. Abouelhoda, M. 2007. A chaining algorithm for mapping cDNA sequences to multiple genomic sequences. Lect. Notes Comp. Sci., vol. 4726, 1-13. Springer-Verlag, Berlin.
2. Abouelhoda, M., Kurtz, S., and Ohlebusch, E. 2004. Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2, 53-86.
3. Abouelhoda, M., Kurtz, S., and Ohlebusch, E. 2006. Enhanced suffix arrays and applications. In: Aluru, S., ed., Handbook of Computational Molecular Biology, 7-1-7-21. Chapman & Hall, New York.
4. Abouelhoda, M., and Ohlebusch, E. 2003. A local chaining algorithm and its applications in comparative genomics. Lect. Notes Bioinform. 2812, 1-16. Berlin.
5. Bourque, B., and Pevzner, P. 2002. Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Res. 12, 26-36.
6. Chain, P., Kurtz, S., Ohlebusch, E., et al. 2003. An applications-focused review of comparative genomics tools: capabilities, limitations and future challenges. Brief. Bioinform. 4, 105-123.
7. Chang, W., and Lawler, E. (1994). Sublinear approximate string matching and biological applications. Algorithmica 12, 327-344.
8. Chiapello, H., Bourgait, I., Sourivong, F., et al. 2005. Systematic determination of the mosaic structure of bacterial genomes: species backbone versus strain-specific loops. BMC Bioinform., 6, 171.
9. Darling, A., Mau, B., Blattner, F., et al. 2004. Mauve: multiple alignment of conserved genomic sequence with rearrangements. Genome Res. 14, 1394-1403.
10. Delcher, A., Phillippy, A., Carlton, J., et al. 2002. Fast algorithms for large-scale genome alignment and comparison. Nucleic Acids Res. 30, 2478-2483.
11. Deogen, J., Yang, J., and Ma, F. 2004. EMAGEN: an efficient approach to multiple genome alignment. Proc. 2nd Asia Pacific Bioinform. Conf. 113-122.
12. Gusfield, D. 1997. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York.
13. Höhl, M., Kurtz, S., and Ohlebusch, E. 2002. Efficient multiple genome alignment. Bioinformatics 18, S312-S320.
14. Kurtz, S., and Lonardi, S. 2004. Computational biology. In: Mehta, D., and Sahni, S., eds., Handbook on Data Structures and Applications, 58-1-58-17. CRC Press, Boca Raton, FL.
15. Kurtz, S., Phillippy, A., Delcher, A., et al. 2004. Versatile and open software for comparing large genomes. Genome Biol. 5, R12.
16. Manber, U., and Myers, E. 1993. Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22, 935-948.
17. Mau, B., Darling, A., and Perna, N. 2005. Identifying evolutionarily conserved segments among multiple divergent and rearranged genomes. Lect. Notes Bioinform. 3388, 72-84.
18. Pevzner, P., and Tesler, G. 2003. Genome rearrangements in mammalian evolution: lessons from human and mouse genomic sequences. Genome Res. 13, 3-26.
19. Smit, A., and Green, P. 2008. RepeatMasker. Available at: www.repeatmasker.org/. Accessed February 27, 2008.
20. Stoye, J., and Gusfield, D. 2002. Simple and flexible detection of contiguous repeats using a suffix tree. Theoret. Comput. Sci. 270, 843-856.
21. Treangen, T., and Messeguer, X. 2006. M-GCAT: interactively and efficiently constructing large-scale multiple genome comparison frameworks in closely related species. BMC Bioinform. 7, 433.
22. Ukkonen, E. 1995. On-line construction of suffix-trees. Algorithmica 14, 249-260.
23. Weiner, P. 1973. Linear pattern matching algorithms. Proc. 14th IEEE Ann. Symp. Switching Autom. Theory, 1-11.