Variational Supertrees for Bayesian Phylogenetics

Bayesian phylogenetic inference is powerful but computationally intensive. Researchers may find themselves with two phylogenetic posteriors on overlapping data sets and may wish to approximate a combined result without having to re-run potentially expensive Markov chains on the combined data set. This raises the question: given overlapping subsets of a set of taxa (e.g. species or virus samples), and given posterior distributions on phylogenetic tree topologies for each of these taxon sets, how can we optimize a probability distribution on phylogenetic tree topologies for the entire taxon set? In this paper we develop a variational approach to this problem and demonstrate its effectiveness. Specifically, we develop an algorithm to find a suitable support of the variational tree topology distribution on the entire taxon set, as well as a gradient-descent algorithm to minimize the divergence from the restrictions of the variational distribution to each of the given per-subset probability distributions, in an effort to approximate the posterior distribution on the entire taxon set.

Authors

Institutions

Publication Details

Journal
Bulletin of Mathematical Biology
Published
2024-08-05
DOI
https://doi.org/10.1007/s11538-024-01338-5
Citations
1
Primary Topic
Genomics and Phylogenetic Studies
Type
article
Field-Weighted Citation Impact
0.23

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Variational Supertrees for Bayesian Phylogenetics

Michael D. Karcher, Cheng Zhang, Frederic A. Matsen
1 citations
Bulletin of Mathematical Biology
Genomics and Phylogenetic Studies
0.23
article

Variational Supertrees for Bayesian Phylogenetics

Michael D. Karcher, Cheng Zhang, Frederic A. Matsen
article en
1 citations

Abstract

Bayesian phylogenetic inference is powerful but computationally intensive. Researchers may find themselves with two phylogenetic posteriors on overlapping data sets and may wish to approximate a combined result without having to re-run potentially expensive Markov chains on the combined data set. This raises the question: given overlapping subsets of a set of taxa (e.g. species or virus samples), and given posterior distributions on phylogenetic tree topologies for each of these taxon sets, how can we optimize a probability distribution on phylogenetic tree topologies for the entire taxon set? In this paper we develop a variational approach to this problem and demonstrate its effectiveness. Specifically, we develop an algorithm to find a suitable support of the variational tree topology distribution on the entire taxon set, as well as a gradient-descent algorithm to minimize the divergence from the restrictions of the variational distribution to each of the given per-subset probability distributions, in an effort to approximate the posterior distribution on the entire taxon set.

Bulletin of Mathematical BiologyVol. 86(9)
Peking University (CN), Fred Hutch Cancer Center (US), Muhlenberg College (US)
National Science Foundation, Fred Hutchinson Cancer Research Center, National Institutes of Health, Office of Research Infrastructure Programs, National Institutes of Health
Openalex Percentile: Top 43%
Genomics and Phylogenetic Studies
0.23
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Variational Supertrees for Bayesian Phylogenetics — Michael D. Karcher, Cheng Zhang, et al. · Bulletin of Mathematical Biology (2024) | TGRS Research Map | TGRS