Evidence map›Paper›PMID 42275602›Full record

ArticleMolecular biology and evolution2026

Bayesian credible sets for phylogenetic tree topologies with applications to coverage analysis and cross-model comparison.

Jonathan Klawitter, Alexei J Drummond

Abstract read
In one paragraph

Article in Molecular biology and evolution, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

2 authors.

Jonathan KlawitterSchool of Computer Science, University of Auckland, Auckland, Aotearoa New Zealand.ORCID 0000-0001-8917-5269
Alexei J DrummondSchool of Biological Sciences, University of Auckland, Auckland, Aotearoa New Zealand.ORCID 0000-0003-4454-2576

Funding

Beyond Prediction Data Science Research Program UOAX1932
6 · The paper itself

Abstract

Credible intervals and credible sets, such as highest posterior density intervals, form an integral statistical tool in Bayesian phylogenetics, both for phylogenetic analyses and for development. Readily available for continuous parameters such as base frequencies and clock rates, the vast and complex space of tree topologies poses significant challenges for defining analogous credible sets. Traditional frequency-based approaches are inadequate for diffuse posteriors where sampled trees are often unique. To address this, we introduce novel and efficient methods for estimating the credible level of individual tree topologies using tractable tree distributions, specifically conditional clade distribution (CCD). Furthermore, we propose a new concept called α credible CCD, which encapsulates a CCD whose trees collectively make up α probability. We present algorithms to compute these credible CCDs efficiently and to determine credible levels of tree topologies as well as of subtrees. We evaluate the accuracy of these credible set methods leveraging simulated and real datasets. Furthermore, to demonstrate the utility of our methods, we use well-calibrated simulation studies to evaluate the performance of different CCD models. In particular, we show how the credible set methods can be used to conduct rank-uniformity validation and produce empirical cumulative distribution function plots, supplementing standard coverage analyzes for continuous parameters.

Indexed as

Models, GeneticPhylogenyAlgorithmsAnimalsBayes TheoremComputer SimulationBayesian phylogeneticsconditional clade distributionscoverage analysiscredible set

Identifiers

PMID42275602
PMCPMC13325671

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.