BioinformaticsBioinformaticsPeer-reviewed journal article
HAT: Haplotype Assembly Tool using short and error-prone long reads
Ramin Shirali Hossein ZadeiD, Aysun UrhaniD, Alvaro Assis de SouzaiD, Akash SinghiD, Thomas AbeeliD
Abstract
MotivationHaplotypes are the set of alleles cooccurring on a single chromosome and inherited together to the next generation. Because a monoploid reference genome loses this co-occurrence information, its usability is limited to associate phenotypes with allelic combinations of genotypes. Therefore, methods to reconstruct the complete haplotypes from DNA sequencing data are crucial. Recently, several attempts have been made at haplotype reconstructions, but significant limitations remain. High-quality continuous haplotypes cannot be created reliably, particularly when there are few differences between the homologous chromosomes. ResultsHere, we introduce HAT, a haplotype assembly tool that exploits short and long reads along with a reference genome to reconstruct haplotypes. HAT tries to take advantage of the accuracy of short reads and the length of the long reads to reconstruct haplotypes. We tested HAT on the aneuploid yeast strain Saccharomyces pastorianus CBS1483 and multiple simulated polyploid data sets of the same strain, showing that it outperforms existing tools. Availabilityhttps://github.com/AbeelLab/hat/ Contactt.abeel@tudelft.nl
- organism: yeast
- assay: whole-genome sequencing
- research focus: variant calling
- approach: experimental assay
- Citations
- 1
- FWCI
- 0.08
- Field percentile
- 31th percentile
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
- HapCHAT: Adaptive haplotype assembly for efficiently leveraging high coverage in long reads
Stefano Beretta, Murray Patterson, … Paola Bonizzoni·BMC BioinformaticsPeer-reviewed·Jul 3, 2018
- Hap10: reconstructing accurate and long polyploid haplotypes using linked reads
Sina Majidian, Mohammad Hossein Kahaei, Dick de Ridder·BMC BioinformaticsPeer-reviewed·Jun 18, 2020
- Haplotype-Resolved Assembly for Synthetic Long Reads Using a Trio-Binning Strategy
Mengyang Xu, Lidong Guo, … Guangyi Fan·bioRxiv·Jun 1, 2020
- MAtCHap: an ultra fast algorithm for solving the single individual haplotype assembly problem.
Alberto Magi·bioRxiv·Dec 2, 2019
- 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
- Sparse Tensor Decomposition For Haplotype Assembly Of Diploids And Polyploids
Abolfazl Hashemi, Banghua Zhu, Haris Vikalo·BMC GenomicsPeer-reviewed·Mar 1, 2018