E-MEM: Efficient computation of maximal exact matches for very large genomes

Bioinformatics

Volumn 31, Issue 4, 2015, Pages 509-514

  Khiste, Nilesh ^a   Ilie, Lucian ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ANIMAL; COMPARATIVE STUDY; COMPUTER LANGUAGE; DNA SEQUENCE; FACTUAL DATABASE; GENETICS; GENOME; HUMAN; MOUSE; PROCEDURES; SEQUENCE ALIGNMENT; SOFTWARE; SPECIES DIFFERENCE; SYSTEMS BIOLOGY; WHEAT;

ALGORITHMS; ANIMALS; DATABASES, FACTUAL; GENOME; HUMANS; MICE; PROGRAMMING LANGUAGES; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SOFTWARE; SPECIES SPECIFICITY; SYSTEMS BIOLOGY; TRITICUM;

EID: 84928981780     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btu687     Document Type: Article

References (28)

1. Abouelhoda, M.I. et al. (2004) Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms, 2, 53-86.
2. Bray, N. and Pachter, L. (2004) MAVID: constrained ancestral alignment of multiple sequences. Genome Res., 14, 693-699.
3. Brudno, M. et al. (2003) Fast and sensitive multiple alignment of large genomic sequences. BMC Bioinformatics, 4, 66.
4. Choi, J.-H. et al. (2005) GAME: a simple and efficient whole genome alignment method using maximal exact match filtering. Comput. Biol. Chem, 29, 244-253.
5. Delcher, A.L. et al. (1999) Alignment of whole genomes. Nucleic Acids Res, 27, 2369-2376.
6. Delcher, A.L. et al. (2002) Fast algorithms for large-scale genome alignment and comparison. Nucleic Acids Res., 30, 2478-2483.
7. Deogun, J.S. et al. (2004) Emagen: An efficient approach to multiple whole genome alignment. In: Proceedings of the second conference on Asia-Pacific bioinfor-matics. Vol. 29, Australian Computer Society, Inc, pp. 113-122.
8. Fernandes, F. and Freitas, A.T. (2014) slaMEM: efficient retrieval of maximal exact matches using a sampled LCP array. Bioinformatics, 30, 464-471.
9. Ferragina, P. and Manzini, G. (2000) Opportunistic data structures with applications. In: Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on IEEE. Redondo Beach, CA. pp. 390-398.
10. Gusfield, D. (1997) Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, New York.
11. Höhl, M. et al. (2002) Efficient multiple genome alignment. Bioinformatics, 18 (Suppl. 1), S312-S320.
12. Ilie, L. and Ilie, S. (2007) Multiple spaced seeds for homology search. Bioinformatics, 23, 2969-2977.
13. Ilie, L. et al. (2011) SpEED: fast computation of sensitive spaced seeds. Bioinformatics, 27, 2433-2434.
14. Kärkkäinen, J. and Ukkonen, E. (1996) Sparse suffix trees. In: Computing and Combinatorics. Springer, Berlin Heidelberg, pp. 219-230.
15. Kent, W.J. (2002) Blatthe blast-like alignment tool. Genome Res., 12, 656-664.
16. Khan, Z. et al. (2009) A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays. Bioinformatics, 25, 1609-1616.
17. Kurtz, S. (1999) Reducing the space requirement of suffix trees. Softw. Practice Exp., 29, 1149-71.
18. Kurtz, S. et al. (2004) Versatile and open software for comparing large genomes. Genome Biol., 5, R12.
19. Li, M. et al. (2004) PatternHunter II: Highly sensitive and fast homology search. J. Bioinformatics Comput. Biol., 2, 417-439.
20. Ma, B. et al. (2002) PatternHunter: faster and more sensitive homology search. Bioinformatics, 18, 440-445.
21. Manber, U. and Myers, G. (1993) Suffix arrays: a new method for on-line string searches. Siam J. Comput., 22, 935-948.
22. Menconi, G. et al. (2013) Mobilomics in saccharomyces cerevisiae strains. BMC Bioinformatics, 14, 102.
23. Navarro, G. and Makinen, V. (2007) Compressed full-text indexes. ACM Computing Surveys (CSUR), 39, 2.
24. Ohlebusch, E. and Abouelhoda, M.I. (2006) Chaining algorithms and applications in comparative genomics. In: Handbook of Computational Molecular Biology. Chapman & Hall/CRC, Boca Raton FL.
25. Ohlebusch, E. et al. (2010) Computing matching statistics and maximal exact matches on compressed full-text indexes. In: String Processing and Information Retrieval. Springer, pp. 347-358.
26. Schwartz, S. et al. (2000) Pipmakera web server for aligning two genomic dna sequences. Genome Res., 10, 577-586.
27. Vyverman, M. et al. (2013) essaMEM: finding maximal exact matches using enhanced sparse suffix arrays. Bioinformatics, 29, 802-804.
28. Weiner, P. (1973) Linear pattern matching algorithms. In: Switching and Automata Theory, 1973. SWAT'08. IEEE Conference Record of 14th Annual Symposium on IEEE. pp. 1-11.