Summarizing a posterior distribution of trees using agreement subtrees

被引:25
作者
Cranston, Karen A. [1 ]
Rannala, Bruce
机构
[1] Univ Arizona, Dept Ecol & Evolut Biol, Tucson, AZ 85721 USA
[2] Univ Calif Davis, Genome Ctr, Davis, CA 95616 USA
关键词
CONSENSUS TREES; OPTIMIZATION; INFERENCE; ALGORITHM; EVOLUTION; MRBAYES;
D O I
10.1080/10635150701485091
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Bayesian inference of phylogeny is unique among phylogenetic reconstruction methods in that it produces a posterior distribution of trees rather than a point estimate of the best tree. The most common way to summarize this distribution is to report the majority-rule consensus tree annotated with the marginal posterior probabilities of each partition. Reporting a single tree discards information contained in the full underlying distribution and reduces the Bayesian analysis to simply another method for finding a point estimate of the tree. Even when a point estimate of the phylogeny is desired, the majority- rule consensus tree is only one possible method, and there may be others that are more appropriate for the given data set and application. We present a method for summarizing the distribution of trees that is based on identifying agreement subtrees that are frequently present in the posterior distribution. This method provides fully resolved binary trees for subsets of taxa with high marginal posterior probability on the entire tree and includes additional information about the spread of the distribution.
引用
收藏
页码:578 / 590
页数:13
相关论文
共 35 条
[1]   ON THE CONVERGENCE OF THRESHOLD ACCEPTING [J].
ALTHOFER, I ;
KOSCHNICK, KU .
APPLIED MATHEMATICS AND OPTIMIZATION, 1991, 24 (02) :183-195
[2]   Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms [J].
Amir, A ;
Keselman, D .
SIAM JOURNAL ON COMPUTING, 1997, 26 (06) :1656-1669
[3]  
Bryant D., 1997, PhD thesis
[4]  
Chi Y, 2005, FUND INFORM, V66, P161
[5]   An O(n log n) algorithm for the maximum agreement subtree problem for binary trees [J].
Cole, R ;
Colton, MF ;
Hariharan, R ;
Przytycka, T ;
Thorup, M .
SIAM JOURNAL ON COMPUTING, 2000, 30 (05) :1385-1404
[6]   THRESHOLD ACCEPTING - A GENERAL-PURPOSE OPTIMIZATION ALGORITHM APPEARING SUPERIOR TO SIMULATED ANNEALING [J].
DUECK, G ;
SCHEUER, T .
JOURNAL OF COMPUTATIONAL PHYSICS, 1990, 90 (01) :161-175
[7]   OBTAINING COMMON PRUNED TREES [J].
FINDEN, CR ;
GORDON, AD .
JOURNAL OF CLASSIFICATION, 1985, 2 (2-3) :255-276
[8]   Molecular phylogeny of the Arctoidea (Carnivora): Effect of missing data on supertree and supermatrix analyses of multiple gene data sets [J].
Fulton, Tara L. ;
Strobeck, Curtis .
MOLECULAR PHYLOGENETICS AND EVOLUTION, 2006, 41 (01) :165-181
[9]  
GEYER CJ, 1991, COMPUTING SCIENCE AND STATISTICS, P156
[10]   Is it better to add taxa or characters to a difficult phylogenetic problem? [J].
Graybeal, A .
SYSTEMATIC BIOLOGY, 1998, 47 (01) :9-17