VNU-UET Repository: No conditions. Results ordered -Date Deposited. 2021-02-27T04:33:59ZEPrintshttp://eprints.uet.vnu.edu.vn/images/sitelogo.pnghttps://eprints.uet.vnu.edu.vn/eprints/2019-06-03T04:14:06Z2019-06-03T04:14:06Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/3437This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/34372019-06-03T04:14:06ZUFBoot2: Improving the Ultrafast Bootstrap ApproximationAbstract
The standard bootstrap (SBS), despite being computationally intensive, is widely used in maximum likelihood phylogenetic analyses. We recently proposed the ultrafast bootstrap approximation (UFBoot) to reduce computing time while achieving more unbiased branch supports than SBS under mild model violations. UFBoot has been steadily adopted as an efficient alternative to SBS and other bootstrap approaches. Here, we present UFBoot2, which substantially accelerates UFBoot and reduces the risk of overestimating branch supports due to polytomies or severe model violations. Additionally, UFBoot2 provides suitable bootstrap resampling strategies for phylogenomic data. UFBoot2 is 778 times (median) faster than SBS and 8.4 times (median) faster than RAxML rapid bootstrap on tested data sets. UFBoot2 is implemented in the IQ-TREE software package version 1.6 and freely available at http://www.iqtree.org.Thi Diep Hoangdiepht@vnu.edu.vnOlga Chernomorvon Haeseler ArndtQuang Minh BuiSy Vinh Levinhls@vnu.edu.vn2018-12-17T03:07:14Z2018-12-17T03:07:14Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/3310This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/33102018-12-17T03:07:14ZFast phylogenetic maximum parsimony tree inference and bootstrap approximationBackground: The nonparametric bootstrap is widely used to measure the branch support of phylogenetic trees. However, bootstrapping is computationally expensive and remains a bottleneck in phylogenetic analyses. Recently, an ultrafast bootstrap approximation (UFBoot) approach was proposed for maximum likelihood analyses. However, such an approach is still missing for maximum parsimony.
Results: To close this gap we present MPBoot, an adaptation and extension of UFBoot to compute branch supports under the maximum parsimony principle. MPBoot works for both uniform and non-uniform cost matrices. Our analyses on biological DNA and protein showed that under uniform cost matrices, MPBoot runs on average 4.7 (DNA) to 7 times (protein data) (range: 1.2–20.7) faster than the standard parsimony bootstrap implemented in PAUP*; but 1.6 (DNA) to 4.1 times (protein data) slower than the standard bootstrap with a fast search routine in TNT (fast-TNT). However, for non-uniform cost matrices MPBoot is 5 (DNA) to 13 times (protein data) (range:0.3–63. 9) faster than fast-TNT. We note that MPBoot achieves better scores more frequently than PAUP* and fast-TNT. However, this effect is less pronounced if an intensive but slower search in TNT is invoked. Moreover, experiments on large-scale simulated data show that while both PAUP* and TNT bootstrap estimates are too conservative, MPBoot bootstrap estimates appear more unbiased.
Conclusions: MPBoot provides an efficient alternative to the standard maximum parsimony bootstrap procedure. It shows favorable performance in terms of run time, the capability of finding a maximum parsimony tree, and high bootstrap accuracy on simulated as well as empirical data sets. MPBoot is easy-to-use, open-source and available at http://www.cibiv.at/software/mpboot.Thi Diep Hoangdiepht@vnu.edu.vnSy Vinh Levinhls@vnu.edu.vnFlouri TomasStamatakis Alexandrosvon Haeseler ArndtBui Minh