EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Variational Supertrees for Bayesian Phylogenetics

Michael D Karcher iD, Cheng Zhang, Frederic A Matsen

Bulletin of Mathematical Biology · 2024

DOI: 10.1007/s11538-024-01338-5 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Bulletin of Mathematical Biology, 2024. Verfasst von Michael D Karcher und 2 weiteren Autor:innen. Beteiligte Einrichtung: Department of Math & CS, Muhlenberg College, 2400 W Chew St, Allentown, PA, 18104, USA. michaelkarcher@muhlenberg.edu. Hauptthemen laut MEDLINE: Bayes Theorem, Phylogeny, Algorithms, Markov Chains. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 23 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: NIH HHS, NIAID NIH HHS, NIGMS NIH HHS.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Bayes TheoremPhylogenyAlgorithmsMarkov ChainsMathematical ConceptsModels, GeneticComputer SimulationProbability

Stichwörter der Autor:innen

Divide-and-conquerGradient descentPhylogeneticsSupertreesVariational methods

Autor:innen und Institutionen

  • Department of Math & CS, Muhlenberg College, 2400 W Chew St, Allentown, PA, 18104, USA. michaelkarcher@muhlenberg.edu.
  • Computational Biology Program, Fred Hutchinson Cancer Research Center, 1100 Fairview Ave. N., Seattle, WA, 98109, USA. michaelkarcher@muhlenberg.edu.
  • School of Mathematical Sciences and Center for Statistical Science, Peking University, No. 5 Yiheyuan Road, Haidian District, Beijing, 100871, People's Republic of China.
  • Computational Biology Program, Fred Hutchinson Cancer Research Center, 1100 Fairview Ave. N., Seattle, WA, 98109, USA.

ORCID-Profile: Michael D Karcher

Förderung

  • NIH HHS
  • NIAID NIH HHS
  • NIGMS NIH HHS
  • National Science Foundation
  • Office of Research Infrastructure Programs, National Institutes of Health
  • National Institutes of Health

Zitieren

APA

Karcher, M. D., Zhang, C., & Matsen, F. A. (2024). Variational Supertrees for Bayesian Phylogenetics. Bulletin of Mathematical Biology. https://doi.org/10.1007/s11538-024-01338-5

Vancouver

Karcher MD, Zhang C, Matsen FA. Variational Supertrees for Bayesian Phylogenetics. Bulletin of Mathematical Biology. 2024. doi:10.1007/s11538-024-01338-5

BibTeX
@article{Karcher2024,
  author = {Karcher, Michael D and Zhang, Cheng and Matsen, Frederic A},
  title = {Variational Supertrees for Bayesian Phylogenetics},
  journal = {Bulletin of Mathematical Biology},
  year = {2024},
  doi = {10.1007/s11538-024-01338-5}
}
Kostenlos starten →