@article {19648,
	title = {A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays},
	journal = {Bioinformatics},
	volume = {25},
	year = {2009},
	month = {2009/07/01/},
	pages = {1609 - 1616},
	abstract = {Motivation: High-throughput sequencing technologies place ever increasing demands on existing algorithms for sequence analysis. Algorithms for computing maximal exact matches (MEMs) between sequences appear in two contexts where high-throughput sequencing will vastly increase the volume of sequence data: (i) seeding alignments of high-throughput reads for genome assembly and (ii) designating anchor points for genome{\textendash}genome comparisons.Results: We introduce a new algorithm for finding MEMs. The algorithm leverages a sparse suffix array (SA), a text index that stores every K-th position of the text. In contrast to a full text index that stores every position of the text, a sparse SA occupies much less memory. Even though we use a sparse index, the output of our algorithm is the same as a full text index algorithm as long as the space between the indexed suffixes is not greater than a minimum length of a MEM. By relying on partial matches and additional text scanning between indexed positions, the algorithm trades memory for extra computation. The reduced memory usage makes it possible to determine MEMs between significantly longer sequences.
Availability: Source code for the algorithm is available under a BSD open source license at http://compbio.cs.princeton.edu/mems. The implementation can serve as a drop-in replacement for the MEMs algorithm in MUMmer 3.
Contact: zkhan@cs.princeton.edu;mona@cs.princeton.edu
Supplementary information: Supplementary data are available at Bioinformatics online.
},
	isbn = {1367-4803, 1460-2059},
	url = {http://bioinformatics.oxfordjournals.org/content/25/13/1609},
	author = {Zia Khan and Bloom, Joshua S. and Kruglyak, Leonid and Singh, Mona}
}
