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 条
  • [41] An efficient algorithm for statistical multiple alignment on arbitrary phylogenetic trees
    Lunter, GA
    Miklós, I
    Song, YS
    Hein, J
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2003, 10 (06) : 869 - 889
  • [42] An efficient reachability query based pruning algorithm in e-health scenario
    Mondal, Fikureshi
    Mukherjee, Nandini
    JOURNAL OF BIOMEDICAL INFORMATICS, 2019, 94
  • [43] An efficient ordering-based ensemble pruning algorithm via dynamic programming
    Qun Dai
    Xiaomeng Han
    Applied Intelligence, 2016, 44 : 816 - 830
  • [44] An approach towards enhancement of classification accuracy rate using efficient pruning methods with associative classifiers
    Mittal K.
    International Journal of Information Technology, 2022, 14 (3) : 1525 - 1533
  • [45] BAR CODING IMPROVES MICROFILMING ACCURACY, SPEED - EFFICIENT RECORDS RETENTION
    PAUL, BO
    CHEMICAL PROCESSING, 1995, 58 (11): : 100 - &
  • [46] Machine Learning Algorithm Improves Accuracy of Perioperative Risk Prediction Tools
    Terhune, J. H.
    Edge, S. B.
    Nurkin, S.
    ANNALS OF SURGICAL ONCOLOGY, 2019, 26 : S15 - S16
  • [47] An efficient sequential learning algorithm for growing and pruning RBF (GAP-RBF) networks
    Huang, GB
    Saratchandran, P
    Sundararajan, N
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2004, 34 (06): : 2284 - 2292
  • [48] AN EFFICIENT PRUNING ALGORITHM FOR VALUE INDEPENDENT KNAPSACK-PROBLEM USING A DAG STRUCTURE
    SUN, CH
    WANG, SD
    COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (03) : 321 - 334
  • [49] An Efficient Adaptive Anticollision Algorithm Based on 4-Ary Pruning Query Tree
    Zhang, Wei
    Guo, Yajun
    Tang, Xueming
    Cui, Guohua
    Wu, Longkai
    Mei, Ying
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2013,
  • [50] Efficient phylogenetic tree inference for massive taxonomic datasets: harnessing the power of a server to analyze 1 million taxa
    Pineiro, Cesar
    Pichel, Juan C.
    GIGASCIENCE, 2024, 13