Measuring inconsistency in phylogenetic trees

被引:17
作者
Willson, SJ [1 ]
机构
[1] Iowa State Univ, Dept Math, Ames, IA 50011 USA
关键词
D O I
10.1006/jtbi.1997.0527
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Suppose that we seek a tree T giving the phylogenetic relationships among the species in a set S. A common method selects for such a tree a maximum parsimony tree using the genome of the species in S. Suppose that K is a proper subset of S. Then T induces a tree U which gives the same relationships among the species in K but omits the species of S which are not in K. Unfortunately, when T is a maximum parsimony tree for the species in S, then U need not be a maximum parsimony tree for the species in K. This phenomenon exhibits an inconsistency in the criterion of maximum parsimony-maximum parsimony trees for different groups of species may be "inconsistent." It implies that the addition of a new species can change relationships already "established" for prior species if the trees are obtained by the criterion of maximum parsimony. The phenomenon occurs both in artificial examples and with real data. An alternative method for generating phylogenetic trees seeks to minimize such inconsistencies. For each group J consisting of four of the species, we find a tree T(J) describing the relationship only among the four species in J, for example by the use of maximum parsimony on those four species alone. In favorable cases one may combine all the trees T(J) into a single tree T that is consistent with all the trees T(J). If such a tree T exists, then it is unique, and there is a computationally efficient algorithm for finding the tree T. In unfavorable cases such a tree T does not exist, but there may still be a tree containing only "mild" inconsistencies with the trees T(J). A numerical measure is given for the inconsistency I(T) of a tree T in terms of the treelengths of the various trees with set J of leaves in comparison with the tree T. We may then seek a "minimally inconsistent tree T" that minimizes the inconsistency I(T). We describe procedures which find a tree T with low inconsistency I(T). Examples are provided using both artificial strings and data from the complete mitochondrial DNA sequences for 16 species. In particular, minimally inconsistent trees are identified for the 16 species. The definition permits a proof that the trees are in fact minimally inconsistent. The criterion can be applied in both a relative and an absolute sense. (C) 1998 Academic Press Limited
引用
收藏
页码:15 / 36
页数:22
相关论文
共 26 条
[1]  
Archie James W., 1996, P153, DOI 10.1016/B978-012618030-5/50008-3
[2]   RECONSTRUCTING THE SHAPE OF A TREE FROM OBSERVED DISSIMILARITY DATA [J].
BANDELT, HJ ;
DRESS, A .
ADVANCES IN APPLIED MATHEMATICS, 1986, 7 (03) :309-343
[3]   TREE-STRUCTURES FOR PROXIMITY DATA [J].
COLONIUS, H ;
SCHULZE, HH .
BRITISH JOURNAL OF MATHEMATICAL & STATISTICAL PSYCHOLOGY, 1981, 34 (NOV) :167-180
[4]   The guinea-pig is not a rodent [J].
DErchia, AM ;
Gissi, C ;
Pesole, G ;
Saccone, C ;
Arnason, U .
NATURE, 1996, 381 (6583) :597-600
[5]   PLACE OF ANCESTOR-DESCENDANT RELATIONSHIPS IN PHYLOGENY RECONSTRUCTION [J].
ENGELMANN, GF ;
WILEY, EO .
SYSTEMATIC ZOOLOGY, 1977, 26 (01) :1-11
[6]   COULD A CLADOGRAM THIS SHORT HAVE ARISEN BY CHANCE ALONE - ON PERMUTATION TESTS FOR CLADISTIC STRUCTURE [J].
FAITH, DP ;
CRANSTON, PS .
CLADISTICS, 1991, 7 (01) :1-28
[7]   A ROBUST MODEL FOR FINDING OPTIMAL EVOLUTIONARY TREES [J].
FARACH, M ;
KANNAN, S ;
WARNOW, T .
ALGORITHMICA, 1995, 13 (1-2) :155-179
[8]   NUMBER OF EVOLUTIONARY TREES [J].
FELSENSTEIN, J .
SYSTEMATIC ZOOLOGY, 1978, 27 (01) :27-33
[9]  
FELSENSTEIN J, 1985, EVOLUTION, V39, P783, DOI 10.1111/j.1558-5646.1985.tb00420.x
[10]  
FELSENSTEIN J, 1985, AM NAT, V1225, P1