期刊
SYSTEMATIC BIOLOGY
卷 61, 期 1, 页码 1-11出版社
OXFORD UNIV PRESS
DOI: 10.1093/sysbio/syr074
关键词
Bayesian inference; Gibbs sampling; Markov chain Monte Carlo; phylogenetics; posterior probability distribution; tree topology proposals
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据