Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

flopp: Extremely Fast Long-Read Polyploid Haplotype Phasing by Uniform Tree Partitioning.

Journal of computational biology : a journal of computational molecular cell biology - 1 Feb 2022

Shaw Jim, Yu Yun William

Abstract excerpt

Resolving haplotypes in polyploid genomes using phase information from sequencing reads is an important and challenging problem. We introduce two new mathematical formulations of polyploid haplotype phasing: (1) the min-sum max tree partition problem, which is a more flexible graphical metric compared with the standard minimum error correction (MEC) model in the polyploid setting, and (2) the uniform...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Computer Simulation
Share to Databases, Genetic
Share to Genome, Plant

Methodology Data sources Editorial policy Privacy Delete account & data About Contact Helena Bioinformatics

Share to Models, Statistical

Share to Multigene Family

Share to Polyploidy

Share to Software

Share to Solanum tuberosum

Source

Open in PubMed Open full text

Identifiers

PMID: 35041529
DOI: 10.1089/cmb.2021.0436
PMCID: PMC8892958

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 7 Sept 2026. Manifest publication-graph-cohort-2026-09-08.1.

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence. Graph snapshot: 2026-09-29.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

flopp: Extremely Fast Long-Read Polyploid Haplotype Phasing by Uniform Tree Partitioning.PMID 35041529Read ↗

PolyCluster: Minimum Fragment Disagreement Clustering for Polyploid Phasing.Semantic proximity Read ↗

TriPoly: haplotype estimation for polyploids using sequencing data of related individuals.Semantic proximity Read ↗

HapTree: a novel Bayesian framework for single individual polyplotyping using NGS data.Semantic proximity Read ↗

WhatsHap: Weighted Haplotype Assembly for Future-Generation Sequencing Reads.Semantic proximity Read ↗

LongPhase: an ultra-fast chromosome-scale phasing algorithm for small and large variantsSemantic proximity Read ↗

Chromosome-scale and haplotype-resolved genome assembly of a tetraploid potato cultivar.Semantic proximity Read ↗

De novo phasing resolves haplotype sequences in complex plant genomes.Semantic proximity Read ↗

HapCol: accurate and memory-efficient haplotype assembly from long reads.Semantic proximity Read ↗

Leveraging a phased pangenome for haplotype design of hybrid potato.Semantic proximity Read ↗

Improved haplotype inference by exploiting long-range linking and allelic imbalance in RNA-seq datasets.Semantic proximity Read ↗

Hap10: reconstructing accurate and long polyploid haplotypes using linked readsSemantic proximity Read ↗

The phased pan-genome of tetraploid European potato.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.