bookmark E-MEM / Efficient computation of Maximal Exact Matches Provides a practical solution for finding MEMs between arbitrarily large genomes. E-MEM uses much less memory than the currently available programs. This 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.