返回
Multipolar consensus for phylogenetic trees
DOI:10.1080/10635150600969880.png)
摘要
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.
Keyword:
BAYESIAN POSTERIOR PROBABILITIES
CONFIDENCE
INFERENCE
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.7
论文数:
2.2K
被引数:
1.9W
机构
暂无机构信息
引用论文
A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood一种通过最大似然估计大型系统发育的简单,快速且准确的算法
SYSTEMATIC BIOLOGY
IF5.7
Markov chain Monte Carlo algorithms for the Bayesian analysis of phylogenetic trees用于系统发育树的贝叶斯分析的马尔可夫链蒙特卡洛算法
Visualizing conflicting evolutionary hypotheses in large collections of trees: Using consensus networks to study the origins of placentals and hexapods
SYSTEMATIC BIOLOGY
IF5.7

