Accel-Align: A Fast Sequence Mapper and Aligner based on the Seed-Embed-Extend Method

BackgroundImprovements in sequencing technology continue to drive sequencing cost towards $100 per genome. However, mapping sequenced data to a reference genome remains a computationally-intensive task due to the dependence on edit distance for dealing with indels and mismatches introduced by sequencing. All modern aligners use seed-filter-extend (SFE) methodology and rely on filtration heuristics to reduce the overhead of edit distance computation. However, filtering has inherent performance-accuracy trade-offs that limits its effectiveness. ResultsMotivated by algorithmic advances in randomized low-distortion embedding, we introduce seed- embed-extend (SEE), a new methodology for developing sequence mappers and aligners. While SFE focuses on eliminating sub-optimal candidates, SEE focuses instead on identifying optimal candidates. To do so, SEE transforms the read and reference strings from edit distance regime to the Hamming regime by embedding them using a randomized algorithm, and uses Hamming distance over the embedded set to identify optimal candidates. To show that SEE performs well in practice, we present Accel-Align, an SEE-based short-read sequence mapper and aligner that is 3-12x faster than state-of-the-art aligners on commodity CPUs, without any special-purpose hardware, while providing comparable accuracy. ConclusionsAs sequencing technologies continue to increase read length while improving throughput and accuracy, we believe that randomized embeddings open up new avenues for optimization that cannot be achieved by using edit distance. Thus, the techniques presented in this paper have a much broader scope as they can be used for other applications like graph alignment, multiple sequence alignment, and sequence assembly. Availabilityhttps://github.com/raja-appuswamy/accel-align-release