A fast approximate algorithm for mapping long reads to large reference databases | bioRxiv

A fast approximate algorithm for mapping long reads to large reference databases | bioRxiv

A fast approximate algorithm for mapping long reads to large reference databases

Chirag Jain, Alexander Dilthey, Sergey Koren, Srinivas Aluru,  View ORCID ProfileAdam M. Phillippy

doi: https://doi.org/10.1101/103812

This article is a preprint and has not been peer-reviewed [what does this mean?].

• Abstract
• Info/History
• Metrics
•  Preview PDF

Abstract

Emerging single-molecule sequencing technologies from Pacific Biosciences and Oxford Nanopore have revived interest in long read mapping algorithms. Alignment-based seed-and-extend methods demonstrate good accuracy, but face limited scalability, while faster alignment-free methods typically trade decreased precision for efficiency. In this paper, we combine a fast approximate read mapping algorithm based on minimizers with a novel MinHash identity estimation technique to achieve both scalability and precision. In contrast to prior methods, we develop a mathematical framework that defines the types of mapping targets we uncover, establish probabilistic estimates of p-value and sensitivity, and demonstrate tolerance for alignment error rates up to 20%. With this framework, our algorithm automatically adapts to different minimum length and identity requirements and provides both positional and identity estimates for each mapping reported. For mapping human PacBio reads to the hg38 reference, our method is 290x faster than BWA-MEM with a lower memory footprint and recall rate of 96%. We further demonstrate the scalability of our method by mapping noisy PacBio reads (each ≥5 kbp in length) to the complete NCBI RefSeq database containing 838 Gbp of sequence and >60,000 genomes.

Copyright 

The copyright holder for this preprint is the author/funder. It is made available under a CC-BY 4.0 International license.