bioRxivBioinformaticsPreprint
Selecting Reads for Haplotype Assembly
Abstract
Haplotype assembly or read-based phasing is the problem of reconstructing both haplotypes of a diploid genome from next-generation sequencing data. This problem is formalized as the Minimum Error Correction (MEC) problem and can be solved using algorithms such as WhatsHap. The runtime of WhatsHap is exponential in the maximum coverage, which is hence controlled in a pre-processing step that selects reads to be used for phasing. Here, we report on a heuristic algorithm designed to choose beneficial reads for phasing, in particular to increase the connectivity of the phased blocks and the number of correctly phased variants compared to the random selection previously employed in by WhatsHap. The algorithm we describe has been integrated into the WhatsHap software, which is available under MIT licence from https://bitbucket.org/whatshap/whatshap.
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
- Read-Based Phasing of Related Individuals
Shilpa Garg, Marcel Martin, Tobias Marschall·bioRxiv·Jan 18, 2016
- WhatsHap: fast and accurate read-based phasing
Marcel Martin, Murray Patterson, … Tobias Marschall·bioRxiv·Nov 14, 2016
- HapCHAT: Adaptive haplotype assembly for efficiently leveraging high coverage in long reads
Stefano Beretta, Murray Patterson, … Paola Bonizzoni·BMC BioinformaticsPeer-reviewed·Jul 3, 2018
- SpecHap: a diploid phasing algorithm based on spectral graph theory
Yonghan Yu, Lingxi Chen, … Shuai Cheng Li·bioRxiv·Mar 12, 2021
- MAtCHap: an ultra fast algorithm for solving the single individual haplotype assembly problem.
Alberto Magi·bioRxiv·Dec 2, 2019
- TinkerHap - A Novel Read-Based Phasing Algorithm with Integrated Multi-Method Support for Enhanced Accuracy
Uri Hartmann, Eran Shaham, … Danny Zeevi·GigaSciencePeer-reviewed·Jan 1, 2025