Ultrafast Approximation for Phylogenetic Bootstrap
被引:3470
作者:
Bui Quang Minh
论文数: 0引用数: 0
h-index: 0
机构:
Med Univ Vienna, Univ Vienna, Max F Perutz Labs, Ctr Integrat Bioinformat Vienna, Vienna, AustriaMed Univ Vienna, Univ Vienna, Max F Perutz Labs, Ctr Integrat Bioinformat Vienna, Vienna, Austria
Bui Quang Minh
[1
]
Minh Anh Thi Nguyen
论文数: 0引用数: 0
h-index: 0
机构:
Univ Groningen, Groningen Bioinformat Ctr, Groningen, NetherlandsMed Univ Vienna, Univ Vienna, Max F Perutz Labs, Ctr Integrat Bioinformat Vienna, Vienna, Austria
Minh Anh Thi Nguyen
[2
]
von Haeseler, Arndt
论文数: 0引用数: 0
h-index: 0
机构:
Med Univ Vienna, Univ Vienna, Max F Perutz Labs, Ctr Integrat Bioinformat Vienna, Vienna, AustriaMed Univ Vienna, Univ Vienna, Max F Perutz Labs, Ctr Integrat Bioinformat Vienna, Vienna, Austria
von Haeseler, Arndt
[1
]
机构:
[1] Med Univ Vienna, Univ Vienna, Max F Perutz Labs, Ctr Integrat Bioinformat Vienna, Vienna, Austria
phylogenetic inference;
nonparametric bootstrap;
tree reconstruction;
maximum likelihood;
DNA-SEQUENCES;
TREE-SPACE;
MODEL;
EVOLUTION;
INFERENCE;
PROTEIN;
PERFORMANCE;
SATURATION;
CONFIDENCE;
ALGORITHM;
D O I:
10.1093/molbev/mst024
中图分类号:
Q5 [生物化学];
Q7 [分子生物学];
学科分类号:
071010 ;
081704 ;
摘要:
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.
机构:Penn State Univ, Inst Mol Evolut Genet, Mueller Lab 328, University Pk, PA 16802 USA
Suzuki, Y
;
Glazko, GV
论文数: 0引用数: 0
h-index: 0
机构:Penn State Univ, Inst Mol Evolut Genet, Mueller Lab 328, University Pk, PA 16802 USA
Glazko, GV
;
Nei, M
论文数: 0引用数: 0
h-index: 0
机构:
Penn State Univ, Inst Mol Evolut Genet, Mueller Lab 328, University Pk, PA 16802 USAPenn State Univ, Inst Mol Evolut Genet, Mueller Lab 328, University Pk, PA 16802 USA
机构:Penn State Univ, Inst Mol Evolut Genet, Mueller Lab 328, University Pk, PA 16802 USA
Suzuki, Y
;
Glazko, GV
论文数: 0引用数: 0
h-index: 0
机构:Penn State Univ, Inst Mol Evolut Genet, Mueller Lab 328, University Pk, PA 16802 USA
Glazko, GV
;
Nei, M
论文数: 0引用数: 0
h-index: 0
机构:
Penn State Univ, Inst Mol Evolut Genet, Mueller Lab 328, University Pk, PA 16802 USAPenn State Univ, Inst Mol Evolut Genet, Mueller Lab 328, University Pk, PA 16802 USA