Contributor:
Dutta, Abhinav;
Pellow, David;
Shamir, Ron
Published:
Public Library of Science (PLoS), 2022
Published in:
PLOS Computational Biology, 18 (2022) 10, Seite e1010638
Language:
English
DOI:
10.1371/journal.pcbi.1010638
ISSN:
1553-7358
Origination:
Footnote:
Description:
<jats:sec id="sec001">
<jats:title>Motivation</jats:title>
<jats:p>Sequencing long reads presents novel challenges to mapping. One such challenge is low sequence similarity between the reads and the reference, due to high sequencing error and mutation rates. This occurs, e.g., in a cancer tumor, or due to differences between strains of viruses or bacteria. A key idea in mapping algorithms is to sketch sequences with their minimizers. Recently, syncmers were introduced as an alternative sketching method that is more robust to mutations and sequencing errors.</jats:p>
</jats:sec>
<jats:sec id="sec002">
<jats:title>Results</jats:title>
<jats:p>We introduce parameterized syncmer schemes (PSS), a generalization of syncmers, and provide a theoretical analysis for multi-parameter schemes. By combining PSS with downsampling or minimizers we can achieve any desired compression and window guarantee. We implemented the use of PSS in the popular minimap2 and Winnowmap2 mappers. In tests on simulated and real long-read data from a variety of genomes, the PSS-based algorithms, with scheme parameters selected on the basis of our theoretical analysis, reduced unmapped reads by 20-60% at high compression while usually using less memory. The advantage was more pronounced at low sequence identity. At sequence identity of 75% and medium compression, PSS-minimap had only 37% as many unmapped reads, and 8% fewer of the reads that did map were incorrectly mapped. Even at lower compression and error rates, PSS-based mapping mapped more reads than the original minimizer-based mappers as well as mappers using the original syncmer schemes. We conclude that using PSS can improve mapping of long reads in a wide range of settings.</jats:p>
</jats:sec>