ArticleNature plants2026
Assembly-graph-assisted haplotype-resolved scaffolding of polyploid genomes.
Article in Nature plants, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
14 authors.
Funding
Abstract
Assembling polyploid genomes at the chromosome level remains a major challenge due to the difficulty of accurately distinguishing homologous chromosomes, leaving a vast number of polyploid species without high-quality genome sequences. Current chromatin conformation capture (3C)-based haplotype-resolved scaffolding methods often produce highly incomplete and mis-phased assemblies of complex polyploids, as short sequences lacking sufficient interaction support and collapsed regions with misleading signals are difficult to resolve. Here we present GPhase, a haplotype-resolved scaffolding algorithm that integrates 3C (for example, Hi-C, Pore-C and Omni-C) data with assembly graphs to enhance accuracy, completeness and contiguity. By leveraging graph connectivity derived from long-read overlaps, GPhase effectively overcomes key limitations of 3C. When applied to 15 complex polyploid genomes, GPhase reduced the sequence missing rate (BUSCO-based) by up to tens-fold, decreased the sequence error rate (k-mer-based) by up to an order of magnitude and improved the contiguity (N50) of gap-free sequences by several-fold compared with existing tools.
Identifiers
42888234What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.