bioRxivBioinformaticsPreprint
MoleMap: fast alignment-free molecule mapping for long-read and linked-read sequencing data
Richard LüpkeniD, Thomas KrannichiD, Birte KehriD, Markus SchuelkeiD
Abstract
MotivationThe bottleneck for genome analysis will soon shift from sequencing cost to computationally expensive read alignment. When only portions of the genome are of interest, read alignment on whole-genome sequencing (WGS) data can be replaced by a fast mapping step. ResultsWe propose an approach that can map both long reads or linked-read molecules, as a pre-processing step for downstream targeted analyses. Our "molecule mapping" approach, implemented in the tool MoleMap, uses a minimized open-addressing k-mer index of the reference genome and a fast k-mer clustering procedure. We demonstrate that MoleMaps accuracy is competitive with standard alignment and mapping tools and its running time outperforms other mapping tools on 32 threads by a factor of 3 to 8 and read alignment tools by a factor of 10 to 60. Its low memory footprint allows us to analyze whole genomes on a standard laptop computer. As proofs of concept, we use MoleMap to filter reads for local assembly of a known variant region that involves non-reference sequence and showcase its use in diagnosing a patient with a rare disease. Our work contributes to more scalable genome analysis and promotes WGS for targeted analyses. Availability and ImplementationSource code of MoleMap is available at https://github.com/kehrlab/molemap.
- assay: long-read sequencing
- assay: whole-genome sequencing
- research focus: variant calling
- approach: statistical model
- Citations
- 1
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- mapquik: Efficient low-divergence mapping of long reads in minimizer space
Barış Ekim, Kristoffer Sahlin, … Rayan Chikhi·Genome ResearchPeer-reviewed·Jun 30, 2023
- Fast and accurate short read alignment with Burrows–Wheeler transform
Heng Li, Richard Michael Durbin·BioinformaticsPeer-reviewed·May 18, 2009
- MMR: A Tool for Read Multi-Mapper Resolution
Andre Kahles, Jonas Behr, Gunnar Rätsch·BioinformaticsPeer-reviewed·Oct 30, 2015
- A fast approximate algorithm for mapping long reads to large reference databases
Chirag Jain, Alexander Dilthey, … Adam M. Phillippy·Journal of Computational BiologyPeer-reviewed·Apr 30, 2018
- Whisper: Read sorting allows robust mapping of sequencing data
Sebastian Deorowicz, Agnieszka Debudaj-Grabysz, … Szymon Grabowski·BioinformaticsPeer-reviewed·Nov 6, 2018
- A Fast Adaptive Algorithm for Computing Whole-Genome Homology Maps
Chirag Jain, Sergey Koren, … Srinivas Aluru·BioinformaticsPeer-reviewed·Jul 31, 2018