• Corpus ID: 233347169

Variational Bayesian Supertrees

@inproceedings{Karcher2021VariationalBS,
  title={Variational Bayesian Supertrees},
  author={Michael D. Karcher and Cheng Zhang and IV FrederickAMatsen},
  year={2021}
}
Given overlapping subsets of a set of taxa (e.g. species), and posterior distributions on phylogenetic tree topologies for each of these taxon sets, how can we infer a posterior distribution on phylogenetic tree topologies for the entire taxon set? Although the equivalent problem for in the nonBayesian case has attracted substantial research, the Bayesian case has not attracted the attention it deserves. In this paper we develop a variational Bayes approach to this problem and demonstrate its… 

Figures from this paper

References

SHOWING 1-10 OF 24 REFERENCES

Guided tree topology proposals for Bayesian phylogenetic inference.

This work investigates the performance of common MCMC proposal distributions in terms of median and variance of run time to convergence on 11 data sets, and introduces two new Metropolized Gibbs Samplers for moving through "tree space".

Species trees from gene trees: reconstructing Bayesian posterior distributions of a species phylogeny using estimated gene tree distributions.

A Bayesian hierarchical model to estimate the phylogeny of a group of species using multiple estimated gene tree distributions, such as those that arise in a Bayesian analysis of DNA sequence data, is proposed and applied to two multilocus data sets of DNA sequences.

A Bayesian Supertree Model for Genome-Wide Species Tree Reconstruction

This manuscript addresses the problem of species tree inference from multilocus, genome-wide data sets regardless of the presence of gene duplication and loss and ILS therefore without the need to identify orthologs or to use a single individual per species by extending the idea of Maximum Likelihood to a hierarchical Bayesian model.

Phylogenetic Inference via Sequential Monte Carlo

This paper develops an extension of classical SMC based on partially ordered sets and shows how to apply this framework—which is referred to as PosetSMC—to phylogenetic analysis, and provides a theoretical treatment and empirical results that demonstrate that Poset SMC is a very promising alternative to MCMC.

Bayesian Phylogenetic Inference Using a Combinatorial Sequential Monte Carlo Method

The application of Bayesian methods to large-scale phylogenetics problems is increasingly limited by computational issues, motivating the development of methods that can complement existing Markov

Variational Bayesian Phylogenetic Inference

This paper presents an alternative approach: a variational framework for Bayesian phylogenetic analysis, showing that the structured variational approximations are flexible enough to provide comparable posterior estimation to MCMC, while requiring less computation due to a more efficient tree exploration mechanism enabled by variational inference.

The estimation of tree posterior probabilities using conditional clade probability distributions.

  • B. Larget
  • Computer Science
    Systematic biology
  • 2013
The idea of conditional independence of separated subtrees as a principle by which to estimate the posterior probability of trees using conditional clade probability distributions rather than simple sample relative frequencies is introduced.

Bayesian phylogenetic and phylodynamic data integration using BEAST 1.10

The BEAST software package unifies molecular phylogenetic reconstruction with complex discrete and continuous trait evolution, divergence-time dating, and coalescent demographic models in an efficient statistical inference engine using Markov chain Monte Carlo integration.

Disk-Covering, a Fast-Converging Method for Phylogenetic Tree Reconstruction

A simple method is presented, the Disk-Covering Method (DCM), which boosts the performance of base phylogenetic methods under various Markov models of evolution, and it is proved that for almost all trees, polylogarithmic length sequences suffice for complete accuracy with high probability, while polynomial length sequences always suffice.