CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2011 vol.8 Issue No.04 - July/August
Issue No.04 - July/August (2011 vol.8)
Nicholas D. Pattengale , Sandia National Laboratories, Albuquerque
Andre J. Aberer , TUM, Munich
Krister M. Swenson , University of Ottawa/Université du Québec à Montréal, Montreal
Alexandros Stamatakis , TUM, Munich
Bernard M.E. Moret , Ecole Polytechnique Federale de Lausanne
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2011.28
Many of the steps in phylogenetic reconstruction can be confounded by "rogue” taxa—taxa that cannot be placed with assurance anywhere within the tree, indeed, whose location within the tree varies with almost any choice of algorithm or parameters. Phylogenetic consensus methods, in particular, are known to suffer from this problem. In this paper, we provide a novel framework to define and identify rogue taxa. In this framework, we formulate a bicriterion optimization problem, the relative information criterion, that models the net increase in useful information present in the consensus tree when certain taxa are removed from the input data. We also provide an effective greedy heuristic to identify a subset of rogue taxa and use this heuristic in a series of experiments, with both pathological examples from the literature and a collection of large biological data sets. As the presence of rogue taxa in a set of bootstrap replicates can lead to deceivingly poor support values, we propose a procedure to recompute support values in light of the rogue taxa identified by our algorithm; applying this procedure to our biological data sets caused a large number of edges to move from "unsupported” to "supported” status, indicating that many existing phylogenies should be recomputed and reevaluated to reduce any inaccuracies introduced by rogue taxa. We also discuss the implementation issues encountered while integrating our algorithm into RAxML v7.2.7, particularly those dealing with scaling up the analyses. This integration enables practitioners to benefit from our algorithm in the analysis of very large data sets (up to 2,500 taxa and 10,000 trees, although we present the results of even larger analyses).
Phylogeny, consensus methods, bootstrapping, support values, MAST.
Nicholas D. Pattengale, Andre J. Aberer, Krister M. Swenson, Alexandros Stamatakis, Bernard M.E. Moret, "Uncovering Hidden Phylogenetic Consensus in Large Data Sets", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.8, no. 4, pp. 902-911, July/August 2011, doi:10.1109/TCBB.2011.28