Evidence map›Paper›PMID 37878119›Full record

ArticleJournal of mathematical biology2023

Representing and extending ensembles of parsimonious evolutionary histories with a directed acyclic graph.

Will Dumm, Mary Barker, William Howard-Snyder, William S DeWitt Iii, Frederick A Matsen Iv

Abstract read
In one paragraph

Article in Journal of mathematical biology, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 papers.

0numbers the graph read from it
0cells of the map it votes in
9citing 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

9 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Leveraging DAGs to improve context-sensitive and abundance-aware tree estimation.Philosophical transactions of the Royal Society of London. Series B, Biological sciences · 2025
    Article
  7. Article
  8. Article
  9. Article
4 · The record

Corrections and comments

5 · Who and what money

Authors and funding

5 authors.

Will DummComputational Biology Program, Fred Hutchinson Cancer Research Center, Seattle, Washington, USA.ORCID 0000-0002-8617-476X
Mary BarkerComputational Biology Program, Fred Hutchinson Cancer Research Center, Seattle, Washington, USA.ORCID 0000-0002-7829-8017
William Howard-SnyderPaul G. Allen School of Computer Science and Engineering, University of Washington, Seattle, Washington, USA.ORCID 0000-0001-7375-8961
William S DeWitt IiiDepartment of Electrical Engineering and Computer Sciences, University of California, Berkeley, California, USA.ORCID 0000-0002-6802-9139
Frederick A Matsen IvComputational Biology Program, Fred Hutchinson Cancer Research Center, Seattle, Washington, USA. matsen@fredhutch.org.ORCID 0000-0003-0607-6025

Funding

Fast and flexible Bayesian phylogenetics via modern machine learningR01AI162611 · NIAID · FRED HUTCHINSON CANCER RESEARCH CENTER · PI MATSEN, FREDERICK ALBERT · 2021 to 2025
$3.8M
High-Performance Compute Cluster for Comprehensive Cancer and Infectious Diseases ResearchS10OD028685 · OD · FRED HUTCHINSON CANCER RESEARCH CENTER · PI BRADLEY, PHILIP · 2020 to 2020
$2.0M
Evolutionary dynamics of antibody affinity maturationF31AI150163 · NIAID · FRED HUTCHINSON CANCER RESEARCH CENTER · PI DEWITT, WILLIAM S. · 2020 to 2022
$113k
Howard Hughes Medical InstituteNIAID NIH HHS F31 AI150163NIAID NIH HHS R01 AI162611NIH HHS S10 OD028685
6 · The paper itself

Abstract

In many situations, it would be useful to know not just the best phylogenetic tree for a given data set, but the collection of high-quality trees. This goal is typically addressed using Bayesian techniques, however, current Bayesian methods do not scale to large data sets. Furthermore, for large data sets with relatively low signal one cannot even store every good tree individually, especially when the trees are required to be bifurcating. In this paper, we develop a novel object called the "history subpartition directed acyclic graph" (or "history sDAG" for short) that compactly represents an ensemble of trees with labels (e.g. ancestral sequences) mapped onto the internal nodes. The history sDAG can be built efficiently and can also be efficiently trimmed to only represent maximally parsimonious trees. We show that the history sDAG allows us to find many additional equally parsimonious trees, extending combinatorially beyond the ensemble used to construct it. We argue that this object could be useful as the "skeleton" of a more complete uncertainty quantification.

Indexed as

Biological EvolutionRadiopharmaceuticalsBayes TheoremPhylogenyUncertaintyRadiopharmaceuticalsDirected acyclic graphMaximum parsimonyPhylogenetic inferencePhylogenetic uncertainty

Identifiers

PMID37878119
PMCPMC10600060

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.