Related Experiment Video
Updated: May 14, 2026

Primer Extension Capture: Targeted Sequence Retrieval from Heavily Degraded DNA Sources
Published on: September 3, 2009
essaMEM: finding maximal exact matches using enhanced sparse suffix arrays
Michaël Vyverman1, Bernard De Baets, Veerle Fack
1Department of Applied Mathematics and Computer Science and Department of Mathematical Modelling, Statistics and Bioinformatics, Ghent University, Ghent B-9000, Belgium. Michael.Vyverman@UGent.be
Abstract:
We have developed essaMEM, a tool for finding maximal exact matches that can be used in genome comparison and read mapping. essaMEM enhances an existing sparse suffix array implementation with a sparse child array. Tests indicate that the enhanced algorithm for finding maximal exact matches is much faster, while maintaining the same memory footprint. In this way, sparse suffix arrays remain competitive with the more complex compressed suffix arrays.
Related Concept Videos
Extraction: Advanced Methods
Multi-species Conserved Sequences
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved DNA...
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Sign Test for Matched Pairs
To conduct the sign test, we first calculate the differences in value between...
Wilcoxon Signed-Ranks Test for Matched Pairs
Extraction: Partition and Distribution Coefficients
For extracting a solute from an aqueous phase into an organic...
