HapCHAT: Adaptive haplotype assembly for efficiently leveraging high coverage in long reads
Stefano BerettaiD, Murray PattersoniD, Simone ZaccariaiD, Gianluca Della VedovaiD, Paola BonizzoniiD
Abstract
BackgroundHaplotype assembly is the process of assigning the different alleles of the variants covered by mapped sequencing reads to the two haplotypes of the genome of a human individual. Long reads, which are nowadays cheaper to produce and more widely available than ever before, have been used to reduce the fragmentation of the assembled haplotypes since their ability to span several variants along the genome. These long reads are also characterized by a high error rate, an issue which may be mitigated, however, with larger sets of reads, when this error rate is uniform across genome positions. Unfortunately, current state-of-the-art dynamic programming approaches designed for long reads deal only with limited coverages.\n\nResultsHere, we propose a new method for assembling haplotypes which combines and extends the features of previous approaches to deal with long reads and higher coverages. In particular, our algorithm is able to dynamically adapt the estimated number of errors at each variant site, while minimizing the total number of error corrections necessary for finding a feasible solution. This allows our method to significantly reduce the required computational resources, allowing to consider datasets composed of higher coverages. The algorithm has been implemented in a freely available tool, HapCHAT: Haplotype Assembly Coverage Handling by Adapting Thresholds. An experimental analysis on sequencing reads with up to 60x coverage reveals improvements in accuracy and recall achieved by considering a higher coverage with lower runtimes.\n\nConclusionsOur method leverages the long-range information of sequencing reads that allows to obtain assembled haplotypes fragmented in a lower number of unphased haplotype blocks. At the same time, our method is also able to deal with higher coverages to better correct the errors in the original reads and to obtain more accurate haplotypes as a result.\n\nAvailabilityHapCHAT is available at http://hapchat.algolab.eu under the GPL license.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 12
- FWCI
- 0.36
- Field percentile
- top 44%
- Organism
- Assay
- Research Focus
- Approach
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
- MAtCHap: an ultra fast algorithm for solving the single individual haplotype assembly problem.
Alberto Magi·bioRxiv·Dec 2, 2019
- Haplotype-aware long-read error correction
Parvesh Barak, Daniel Gibney, Chirag Jain·DOAJ (DOAJ: Directory of Open Access Journals)Peer-reviewed·Jun 1, 2026
- phasebook: haplotype-aware de novo assembly of diploid genomes from long reads
Xiao Ling Luo, Xiongbin Kang, Alexander Schönhuth·Genome biologyPeer-reviewed·Oct 27, 2021
- HAT: Haplotype Assembly Tool using short and error-prone long reads
Ramin Shirali Hossein Zade, Aysun Urhan, … Thomas Abeel·BioinformaticsPeer-reviewed·Oct 29, 2022
- Selecting Reads for Haplotype Assembly
Sarah O. Fischer, Tobias Marschall·bioRxiv·Apr 6, 2016
- Hapo-G, Haplotype-Aware Polishing Of Genome Assemblies
Jean‐Marc Aury, Benjamin Istace·NAR Genomics and BioinformaticsPeer-reviewed·Apr 9, 2021