title: Guided tree topology proposals for Bayesian phylogenetic inference.
abstract: Increasingly, large data sets pose a challenge for computationally intensive phylogenetic methods such as Bayesian Markov chain Monte Carlo (MCMC). Here, we investigate the performance of common MCMC proposal distributions in terms of median and variance of run time to convergence on 11 data sets. We introduce two new Metropolized Gibbs Samplers for moving through "tree space." MCMC simulation using these new proposals shows faster average run time and dramatically improved predictability in performance, with a 20-fold reduction in the variance of the time to estimate the posterior distribution to a given accuracy. We also introduce conditional clade probabilities and demonstrate that they provide a superior means of approximating tree topology posterior probabilities from samples recorded during MCMC.
authors.affiliation: Department of Mathematics, Stockholm University, SE-10691 Stockholm, Sweden. hoehna@math.su.se
authors.forename: Sebastian
authors.initials: S
authors.lastname: Höhna
authors.forename: Alexei J
authors.initials: AJ
authors.lastname: Drummond
mesh_terms: D000465:Algorithms; D001499:Bayes Theorem; D002965:Classification / Q000379:methods*; D003627:Data Interpretation, Statistical; D008390:Markov Chains; D008957:Models, Genetic; D009010:Monte Carlo Method; D010802:Phylogeny; D011336:Probability