Pruning Rogue Taxa Improves Phylogenetic Accuracy: An Efficient Algorithm and Webservice

被引:283
|
作者
Aberer, Andre J. [1 ]
Krompass, Denis [1 ]
Stamatakis, Alexandros [1 ]
机构
[1] Heidelberg Inst Theoret Studies HITS gGmbH, Sci Comp Grp, Exelixis Lab, D-69118 Heidelberg, Germany
关键词
Bootstrap support; consensus tree; phylogenetic postanalysis; rogue taxa; software; webservice; INFERENCE; CONSENSUS; TREE;
D O I
10.1093/sysbio/sys078
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
The presence of rogue taxa (rogues) in a set of trees can frequently have a negative impact on the results of a bootstrap analysis (e.g., the overall support in consensus trees). We introduce an efficient graph-based algorithm for rogue taxon identification as well as an interactive webservice implementing this algorithm. Compared with our previous method, the new algorithm is up to 4 orders of magnitude faster, while returning qualitatively identical results. Because of this significant improvement in scalability, the new algorithm can now identify substantially more complex and compute-intensive rogue taxon constellations. On a large and diverse collection of real-world data sets, we show that our method yields better supported reduced/pruned consensus trees than any competing rogue taxon identification method. Using the parallel version of our open-source code, we successfully identified rogue taxa in a set of 100 trees with 116 334 taxa each. For simulated data sets, we show that when removing/pruning rogue taxa with our method from a tree set, we consistently obtain bootstrap consensus trees as well as maximum-likelihood trees that are topologically closer to the respective true trees.
引用
收藏
页码:162 / 166
页数:5
相关论文
共 50 条
  • [31] A SIFT pruning algorithm for efficient near-duplicate image matching
    Wang J.
    Li X.
    Shou L.
    Chen G.
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2010, 22 (06): : 1042 - 1049+1055
  • [32] Including RNA secondary structures improves accuracy and robustness in reconstruction of phylogenetic trees
    Alexander Keller
    Frank Förster
    Tobias Müller
    Thomas Dandekar
    Jörg Schultz
    Matthias Wolf
    Biology Direct, 5
  • [33] An effIcient pruning algorithm for sparselized higher-order neural networks
    Wang, YB
    Li, TX
    Li, AY
    Li, WC
    ICAI '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, 2005, : 189 - 194
  • [34] An Efficient Statistical Pruning Algorithm for Fixed-Complexity Sphere Decoder
    Lei, Sheng
    Zhang, Xin
    Xiong, Cong
    Yang, Dacheng
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2011, E94B (03) : 834 - 837
  • [35] A Computationally Efficient Weight Pruning Algorithm for Artificial Neural Network Classifiers
    Arabian Journal for Science and Engineering, 2018, 43 : 6787 - 6799
  • [36] Including RNA secondary structures improves accuracy and robustness in reconstruction of phylogenetic trees
    Keller, Alexander
    Foerster, Frank
    Mueller, Tobias
    Dandekar, Thomas
    Schultz, Joerg
    Wolf, Matthias
    BIOLOGY DIRECT, 2010, 5
  • [37] Ordering taxa in image convolution networks improves microbiome-based machine learning accuracy
    Shtossel, Oshrit
    Isakov, Haim
    Turjeman, Sondra
    Koren, Omry
    Louzoun, Yoram
    GUT MICROBES, 2023, 15 (01)
  • [38] Efficient Pruning Methods for Obtaining Compact Associative Classifiers with Enhanced Classification Accuracy Rate
    Mittal, Kavita
    Aggarwal, Gaurav
    Mahajan, Prerna
    INFORMATION, COMMUNICATION AND COMPUTING TECHNOLOGY (ICICCT 2019), 2019, 1025 : 294 - 311
  • [39] Efficient Pruning Algorithm for Top-K Ranking on Dataset with Value Uncertainty
    Chen, Jianwen
    Feng, Ling
    PROCEEDINGS OF THE 22ND ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM'13), 2013, : 2231 - 2236
  • [40] An efficient ordering-based ensemble pruning algorithm via dynamic programming
    Dai, Qun
    Han, Xiaomeng
    APPLIED INTELLIGENCE, 2016, 44 (04) : 816 - 830