Overlap graph-based generation of haplotigs for diploids and polyploids
Abstract
Haplotype aware genome assembly plays an important role in genetics, medicine, and various other disciplines, yet generation of haplotype-resolved de novo assemblies remains a major challenge. Beyond distinguishing between errors and true sequential variants, one needs to assign the true variants to the different genome copies. Recent work has pointed out that the enormous quantities of traditional NGS read data have been greatly underexploited in terms of haplotig computation so far, which reflects that methodology for reference independent haplotig computation has not yet reached maturity. We present POLYTE (POLYploid genome fitTEr) as a new approach to de novo generation of haplotigs for diploid and polyploid genomes. Our method follows an iterative scheme where in each iteration reads or contigs are joined, based on their interplay in terms of an underlying haplotype-aware overlap graph. Along the iterations, contigs grow while preserving their haplotype identity. Benchmarking experiments on both real and simulated data demonstrate that POLYTE establishes new standards in terms of error-free reconstruction of haplotype-specific sequence. As a consequence, POLYTE outperforms state-of-the-art approaches in various relevant aspects, where advantages become particularly distinct in polyploid settings. POLYTE is freely available as part of the HaploConduct package at https://github.com/HaploConduct/HaploConduct, implemented in Python and C++.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 23
- FWCI
- 1.32
- Field percentile
- top 21%
- 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
- A chaotic viewpoint-based approach to solve haplotype assembly using hypergraph model
Mohammad Hossein Olyaee, Alireza Khanteymoori, Khosrow Khalifeh·PLoS ONEPeer-reviewed·Oct 29, 2020
- Haplotype assembly of autotetraploid potato using integer linear programming
Enrico Siragusa, Niina Haiminen, … Laxmi Parida·BioinformaticsPeer-reviewed·Jan 23, 2019
- Haplotype-resolved assembly of a tetraploid potato genome using long reads and low-depth offspring data
Rebecca Serra Mari, Sven D. Schrinner, … Tobias Marschall·Genome biologyPeer-reviewed·Jan 19, 2024
- Exploiting Next Generation Sequencing to solve the Haplotyping puzzle in Polyploids: a Simulation study
Ehsan Motazedi, Richard Finkers, … Dick de Ridder·Briefings in BioinformaticsPeer-reviewed·Nov 16, 2016
- 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 Threading: Accurate Polyploid Phasing from Long Reads
Sven D. Schrinner, Rebecca Serra Mari, … Gunnar W. Klau·Genome biologyPeer-reviewed·Sep 20, 2020