Note: These tutorials are incomplete. More complete versions are being made available for our members. Sign up for free.
ELAND
ELAND algorithm was written by A. J. Cox at Illumina and is not described in a paper. It was among the earliest short read mapping programs. In terms of algorithm, ELAND broke each short read into six seeds and stored them in a hash. They were used to map the reads against a reference genome. The mapping strategy worked up to two mismatches.
Please note that ELAND indexed the reads, not the reference.
