Ultrafast approximation for phylogenetic bootstrap

Bui Quang Minh*, Minh Anh Thi Nguyen, Arndt Von Haeseler

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2821 Citations (Scopus)

Abstract

Nonparametric bootstrap has been a widely used tool in phylogenetic analysis to assess the clade support of phylogenetic trees. However, with the rapidly growing amount of data, this task remains a computational bottleneck. Recently, approximation methods such as the RAxML rapid bootstrap (RBS) and the Shimodaira-Hasegawa-like approximate likelihood ratio test have been introduced to speed up the bootstrap. Here, we suggest an ultrafast bootstrap approximation approach (UFBoot) to compute the support of phylogenetic groups in maximum likelihood (ML) based trees. To achieve this, we combine the resampling estimated log-likelihood method with a simple but effective collection scheme of candidate trees. We also propose a stopping rule that assesses the convergence of branch support values to automatically determine when to stop collecting candidate trees. UFBoot achieves a median speed up of 3.1 (range: 0.66-33.3) to 10.2 (range: 1.32-41.4) compared with RAxML RBS for real DNA and amino acid alignments, respectively. Moreover, our extensive simulations show that UFBoot is robust against moderate model violations and the support values obtained appear to be relatively unbiased compared with the conservative standard bootstrap. This provides a more direct interpretation of the bootstrap support. We offer an efficient and easy-to-use software (available at http://www.cibiv.at/software/iqtree) to perform the UFBoot analysis with ML tree inference.

Original languageEnglish
Pages (from-to)1188-1195
Number of pages8
JournalMolecular Biology and Evolution
Volume30
Issue number5
DOIs
Publication statusPublished - May 2013
Externally publishedYes

Fingerprint

Dive into the research topics of 'Ultrafast approximation for phylogenetic bootstrap'. Together they form a unique fingerprint.

Cite this