The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Efficiency of Markov Chain Monte Carlo Tree Proposals in Bayesian Phylogenetics
Abstract
The main limiting factor in Bayesian MCMC analysis of phylogeny is typically the efficiency with which topology proposals sample tree space. Here we evaluate the performance of seven different proposal mechanisms, including most of those used in current Bayesian phylogenetics software. We sampled 12 empirical nucleotide data sets--ranging in size from 27 to 71 taxa and from 378 to 2,520 sites--under difficult conditions: short runs, no Metropolis-coupling, and an oversimplified substitution model producing difficult tree spaces (Jukes Cantor with equal site rates). Convergence was assessed by comparison to reference samples obtained from multiple Metropolis-coupled runs. We find that proposals producing topology changes as a side effect of branch length changes (LOCAL and Continuous Change) consistently perform worse than those involving stochastic branch rearrangements (nearest neighbor interchange, subtree pruning and regrafting, tree bisection and reconnection, or subtree swapping). Among the latter, moves that use an extension mechanism to mix local with more distant rearrangements show better overall performance than those involving only local or only random rearrangements. Moves with only local rearrangements tend to mix well but have long burn-in periods, whereas moves with random rearrangements often show the reverse pattern. Combinations of moves tend to perform better than single moves. The time to convergence can be shortened considerably by starting with a good tree, but this comes at the cost of compromising convergence diagnostics based on overdispersed starting points. Our results have important implications for developers of Bayesian MCMC implementations and for the large group of users of Bayesian phylogenetics software.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
MRBAYES: Bayesian inference of phylogenetic trees.
Huelsenbeck, J. P., & Ronquist, F. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.8.754 · Cited by 21,937
Self-citationMonte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195
Evolution of Protein Molecules
JUKES, T. H., & CANTOR, C. R. (1969) · Mammalian Protein Metabolism · doi:10.1016/b978-1-4832-3211-9.50009-7 · Cited by 11,032
Practical markov chain monte carlo
Geyer, C. J. (1992) · Statistical Science · doi:10.1214/ss/1177011137 · Cited by 2,045
Minimax and maximin distance designs
Johnson, M. E., Moore, L. M., & Ylvisaker, D. (1990) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(90)90122-b · Cited by 1,451
Bayesian Selection of Continuous-Time Markov Chain Evolutionary Models
Suchard, M. A., Weiss, R. E., & Sinsheimer, J. S. (2001) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a003872 · Cited by 791
Lartillot, N., Brinkmann, H., & Philippe, H. (2007) · BMC Evolutionary Biology · doi:10.1186/1471-2148-7-s1-s4 · Cited by 705
Cited by
MrBayes 3.2: Efficient Bayesian Phylogenetic Inference and Model Choice Across a Large Model Space
Ronquist, F., Teslenko, M., van der Mark, P., Ayres, D. L., Darling, A., Höhna, S., Larget, B., Liu, L., Suchard, M. A., & Huelsenbeck, J. P. (2012) · Systematic Biology · doi:10.1093/sysbio/sys029 · Cited by 27,843
Self-citationHöhna, S., Landis, M. J., Heath, T. A., Boussau, B., Lartillot, N., Moore, B. R., Huelsenbeck, J. P., & Ronquist, F. (2016) · Systematic Biology · doi:10.1093/sysbio/syw021 · Cited by 827
Self-citationBayesian Evolutionary Analysis with BEAST
Drummond, A. J., & Bouckaert, R. R. (2015) · Cambridge University Press eBooks · doi:10.1017/cbo9781139095112 · Cited by 527
ExaBayes: Massively Parallel Bayesian Tree Inference for the Whole-Genome Era
Aberer, A. J., Kobert, K., & Stamatakis, A. (2014) · Molecular Biology and Evolution · doi:10.1093/molbev/msu236 · Cited by 462
Using RAxML to infer phylogenies
Stamatakis, A. (2015) · Current Protocols in Bioinformatics · doi:10.1002/0471250953.bi0614s51 · Cited by 243
Metadata
- Authors
- Lakner, C., van der Mark, P., Huelsenbeck, J. P., Larget, B., & Ronquist, F.
- Venue
- Systematic Biology
- Publisher
- Oxford University Press (OUP)
- Published
- 2008-02-01
- Volume
- 57
- Issue
- 1
- Pages
- 86-103
- ISSN
- 1063-5157 (ISSN-L)
- 1076-836X
- OpenAlex
- W2161021958
- Cited by
- 186
- References
- 7
- FWCI
- 5.28
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficiency of Markov Chain Monte Carlo Tree Proposals in Bayesian Phylogenetics. https://app.cochat.ai/papers/10.1080/10635150801886156
- The paper
- Lakner, C., van der Mark, P., Huelsenbeck, J. P., Larget, B., & Ronquist, F. (2008). Efficiency of Markov Chain Monte Carlo Tree Proposals in Bayesian Phylogenetics. Systematic Biology. https://doi.org/10.1080/10635150801886156
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.