We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
pathMap: a path-based mapping tool for long noisy reads with high sensitivity.
- Authors
Wei, Ze-Gang; Zhang, Xiao-Dan; Fan, Xing-Guo; Qian, Yu; Liu, Fei; Wu, Fang-Xiang
- Abstract
With the rapid development of single-molecule sequencing (SMS) technologies, the output read length is continuously increasing. Mapping such reads onto a reference genome is one of the most fundamental tasks in sequence analysis. Mapping sensitivity is becoming a major concern since high sensitivity can detect more aligned regions on the reference and obtain more aligned bases, which are useful for downstream analysis. In this study, we present pathMap, a novel k -mer graph-based mapper that is specifically designed for mapping SMS reads with high sensitivity. By viewing the alignment chain as a path containing as many anchors as possible in the matched k -mer graph, pathMap treats chaining as a path selection problem in the directed graph. pathMap iteratively searches the longest path in the remaining nodes; more candidate chains with high quality can be effectively detected and aligned. Compared to other state-of-the-art mapping methods such as minimap2 and Winnowmap2, experiment results on simulated and real-life datasets demonstrate that pathMap obtains the number of mapped chains at least 11.50% more than its closest competitor and increases the mapping sensitivity by 17.28% and 13.84% of bases over the next-best mapper for Pacific Biosciences and Oxford Nanopore sequencing data, respectively. In addition, pathMap is more robust to sequence errors and more sensitive to species- and strain-specific identification of pathogens using MinION reads.
- Subjects
MAP design; DIRECTED graphs; TASK analysis; SEQUENCE analysis; NUCLEOTIDE sequencing
- Publication
Briefings in Bioinformatics, 2024, Vol 25, Issue 2, p1
- ISSN
1467-5463
- Publication type
Article
- DOI
10.1093/bib/bbae107