A survey of mapping algorithms in the long-reads era
Top Cited Papers
Open Access
- 1 June 2023
- journal article
- review article
- Published by Springer Nature in Genome Biology
- Vol. 24 (1) , 1-23
Abstract
It has been over a decade since the first publication of a method dedicated entirely to mapping long-reads. The distinctive characteristics of long reads resulted in methods moving from the seed-and-extend framework used for short reads to a seed-and-chain framework due to the seed abundance in each read. The main novelties are based on alternative seed constructs or chaining formulations. Dozens of tools now exist, whose heuristics have evolved considerably. We provide an overview of the methods used in long-read mappers. Since they are driven by implementation-specific parameters, we develop an original visualization tool to understand the parameter settings (http://bcazaux.polytech-lille.net/Minimap2/).Keywords
Funding Information
- Agence Nationale de la Recherche (ANR21-CE45-0034-02)
- Vetenskapsrådet (021-04000)
This publication has 108 references indexed in Scilit:
- A random-permutations-based approach to fast read alignmentBMC Bioinformatics, 2013
- Mapping single molecule sequencing reads using basic local alignment with successive refinement (BLASR): application and theoryBMC Bioinformatics, 2012
- YAHA: fast and flexible long-read alignment with optimal breakpoint detectionBioinformatics, 2012
- Efficient computation of spaced seedsBMC Research Notes, 2012
- Fast local fragment chaining using sum-of-pair gap costsAlgorithms for Molecular Biology, 2011
- Adaptive seeds tame genomic sequence comparisonGenome Research, 2011
- Striped Smith–Waterman speeds database searches six times over other SIMD implementationsBioinformatics, 2006
- BLAT—The BLAST-Like Alignment ToolGenome Research, 2002
- Sparse dynamic programming IIJournal of the ACM, 1992
- Basic local alignment search toolJournal of Molecular Biology, 1990