Return
Multipolar consensus for phylogenetic trees
DOI:10.1080/10635150600969880.png)
Abstract
En 中文
Collections of phylogenetic trees are usually summarized using consensus methods. These methods build a single tree, supposed to be representative of the collection. However, in the case of heterogeneous collections of trees, the resulting consensus may be poorly resolved ( strict consensus, majority-rule consensus,...), or may perform arbitrary choices among mutually incompatible clades, or splits ( greedy consensus). Here, we propose an alternative method, which we call the multipolar consensus ( MPC). Its aim is to display all the splits having a support above a predefined threshold, in a minimum number of consensus trees, or poles. We show that the problem is equivalent to a graph-coloring problem, and propose an implementation of the method. Finally, we apply the MPC to real data sets. Our results indicate that, typically, all the splits down to a weight of 10% can be displayed in no more than 4 trees. In addition, in some cases, biologically relevant secondary signals, which would not have been present in any of the classical consensus trees, are indeed captured by our method, indicating that the MPC provides a convenient exploratory method for phylogenetic analysis. The method was implemented in a package freely available at http://www.lirmm.fr/similar to cbonnard/MPC.html.
Keywords:
BAYESIAN POSTERIOR PROBABILITIES
CONFIDENCE
INFERENCE
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.7
Papers:
2.2K
Citations:
1.9W
Organization
No organization information available
Cited Papers
A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood
SYSTEMATIC BIOLOGY
IF5.7
Visualizing conflicting evolutionary hypotheses in large collections of trees: Using consensus networks to study the origins of placentals and hexapods
SYSTEMATIC BIOLOGY
IF5.7

