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

Motivation: Alignment of similar whole genomes is often performed using anchors given by the maximal exact matches (MEMs) between their sequences. In spite of significant amount of research on this problem, the computation of MEMs for large genomes remains a challenging problem. The leading current algorithms employ full text indexes, the sparse suffix array giving the best results. Still, their memory requirements are high, the parallelization is not very efficient, and they cannot handle very large genomes. Results: We present a new algorithm, efficient computation of MEMs (E-MEM) that does not use full text indexes. Our algorithm uses much less space and is highly amenable to parallelization. It can compute all MEMs of minimum length 100 between the whole human and mouse genomes on a 12 core machine in 10 min and 2 GB of memory; the required memory can be as low as 600 MB. It can run efficiently genomes of any size. Extensive testing and comparison with currently best algorithms is provided. Availability and implementation: The source code of E-MEM is freely available at: http://www.csd.uwo.ca/∼ilie/E-MEM/ Contact: ilie@csd.uwo.ca Supplementary information: Supplementary Data are available at Bioinformatics online.

E-MEM: efficient computation of maximal exact matches for very large genomes Journal Articles