谷歌Chrome浏览器插件
订阅小程序
在清言上使用

Variational Supertrees for Bayesian Phylogenetics

Michael D. Karcher,Cheng Zhang, Frederic A. Matsen

Bulletin of Mathematical Biology(2024)

引用 0|浏览0
暂无评分
摘要
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.
更多
查看译文
关键词
Supertrees,Variational methods,Phylogenetics,Gradient descent,Divide-and-conquer,49-04,49N99,62-08,92-08,92D20,92D30
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要