Evidence map›Paper›PMID 24675685›Full record

ArticlePLoS computational biology2014

HapTree: a novel Bayesian framework for single individual polyplotyping using NGS data.

Emily Berger, Deniz Yorukoglu, Jian Peng, Bonnie Berger

Abstract read
In one paragraph

Article in PLoS computational biology, 2014. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 42 papers.

0numbers the graph read from it
0cells of the map it votes in
42citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

42 citing papers in PubMed.

  1. Article
  2. Article
  3. Methods for Chromosome-Scale Haplotype Reconstruction.Methods in molecular biology (Clifton, N.J.) · 2025
    Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. flopp: Extremely Fast Long-Read Polyploid Haplotype Phasing by Uniform Tree Partitioning.Journal of computational biology : a journal of computational molecular cell biology · 2022
    Article
  14. Review
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Emily BergerDepartment of Mathematics, MIT, Cambridge, Massachusetts, United States of America; Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, Massachusetts, United States of America; Department of Mathematics, UC Berkeley, Berkeley, California, United States of America.
Deniz YorukogluComputer Science and Artificial Intelligence Laboratory, MIT, Cambridge, Massachusetts, United States of America.
Jian PengDepartment of Mathematics, MIT, Cambridge, Massachusetts, United States of America; Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, Massachusetts, United States of America.
Bonnie BergerDepartment of Mathematics, MIT, Cambridge, Massachusetts, United States of America; Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, Massachusetts, United States of America.

Funding

Compressive genomics for large omics data sets: Algorithms applications & toolsR01GM108348 · NIGMS · MASSACHUSETTS INSTITUTE OF TECHNOLOGY · PI BERGER, BONNIE · 2013 to 2019
$2.1M
NIGMS NIH HHS R01 GM108348NIGMS NIH HHS R01GM108348-01
6 · The paper itself

Abstract

As the more recent next-generation sequencing (NGS) technologies provide longer read sequences, the use of sequencing datasets for complete haplotype phasing is fast becoming a reality, allowing haplotype reconstruction of a single sequenced genome. Nearly all previous haplotype reconstruction studies have focused on diploid genomes and are rarely scalable to genomes with higher ploidy. Yet computational investigations into polyploid genomes carry great importance, impacting plant, yeast and fish genomics, as well as the studies of the evolution of modern-day eukaryotes and (epi)genetic interactions between copies of genes. In this paper, we describe a novel maximum-likelihood estimation framework, HapTree, for polyploid haplotype assembly of an individual genome using NGS read datasets. We evaluate the performance of HapTree on simulated polyploid sequencing read data modeled after Illumina sequencing technologies. For triploid and higher ploidy genomes, we demonstrate that HapTree substantially improves haplotype assembly accuracy and efficiency over the state-of-the-art; moreover, HapTree is the first scalable polyplotyping method for higher ploidy. As a proof of concept, we also test our method on real sequencing data from NA12878 (1000 Genomes Project) and evaluate the quality of assembled haplotypes with respect to trio-based diplotype annotation as the ground truth. The results indicate that HapTree significantly improves the switch accuracy within phased haplotype blocks as compared to existing haplotype assembly methods, while producing comparable minimum error correction (MEC) values. A summary of this paper appears in the proceedings of the RECOMB 2014 conference, April 2-5.

Indexed as

PloidiesAlgorithmsAllelesAnimalsBayes TheoremComputational BiologyEpigenesis, GeneticFishesGenes, FungalGenomeGenome, HumanGenotypeHaplotypesHigh-Throughput Nucleotide SequencingHumansLikelihood Functions

Identifiers

PMID24675685
PMCPMC3967924

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

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.