Constructing rooted supertrees using distances

Suppose that a family of rooted phylogenetic trees Ti with different sets Xi of leaves is given. A supertree for the family is a single rooted tree T whose leaf set is the union of all the Xi, such that the branching information in T corresponds to the branching information in all the trees Ti. This paper proposes a polynomial-time method BUILD-WITH-DISTANCES that makes essential use of distance information provided by the trees Ti to construct a rooted tree S0. When a supertree also containing the distance information exists, then S0 is a supertree. The supertree S0 often shows increased resolution over the trees found by methods that utilize only the topology of the input trees. When no supertree exists because the input trees are incompatible, several variants of the method are described which still produce trees with provable properties.

[1]  François-Joseph Lapointe,et al.  THE AVERAGE CONSENSUS PROCEDURE: COMBINATION OF WEIGHTED TREES CONTAINING IDENTICAL OR OVERLAPPING SETS OF TAXA , 1997 .

[2]  S. C. Johnson.  Hierarchical clustering schemes , 1967, Psychometrika.

[3]  B. Baum.  Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees , 1992 .

[4]  J. Hartigan.  REPRESENTATION OF SIMILARITY MATRICES BY TREES , 1967 .

[5]  H. Colonius,et al.  Tree structures for proximity data , 1981 .

[6]  J. L. Gittleman,et al.  The (Super)Tree of Life: Procedures, Problems, and Prospects , 2002 .

[7]  Charles Semple,et al.  A supertree method for rooted trees , 2000, Discret. Appl. Math..

[8]  L. Hubert.  Monotone invariant clustering procedures , 1973 .

[9]  Charles Semple,et al.  Supertree Methods for Ancestral Divergence Dates and other Applications , 2004 .

[10]  Joseph L. Thorley,et al.  RadCon: phylogenetic tree comparison and consensus , 2000, Bioinform..

[11]  M J Sanderson,et al.  Assessment of the accuracy of matrix representation with parsimony analysis supertree construction. , 2001, Systematic biology.

[12]  François-Joseph Lapointe,et al.  Matrix representations with parsimony or with distances: two sides of the same coin? , 2003, Systematic biology.

[13]  W. Fitch,et al.  Construction of phylogenetic trees. , 1967, Science.

[14]  Alfred V. Aho,et al.  Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions , 1981, SIAM J. Comput..

[15]  F. Lapointe,et al.  Branch lengths and support. , 2003, Systematic biology.

[16]  M. P. Cummings,et al.  PAUP* Phylogenetic analysis using parsimony (*and other methods) Version 4 , 2000 .

[17]  M. Ragan.  Phylogenetic inference based on matrix representation of trees. , 1992, Molecular phylogenetics and evolution.

[18]  L. Hubert.  Some extensions of Johnson's hierarchical clustering algorithms , 1972 .

[19]  Andy Purvis,et al.  Phylogenetic supertrees: Assembling the trees of life. , 1998, Trends in ecology & evolution.

[20]  Michael P. Cummings,et al.  PAUP* [Phylogenetic Analysis Using Parsimony (and Other Methods)] , 2004 .

[21]  François-Joseph Lapointe,et al.  Everything You always wanted to Know about the Average Consensus, and More , 2004 .

[22]  Roderic D. M. Page,et al.  Modified Mincut Supertrees , 2002, WABI.

[23]  Péter L. Erdös,et al.  X-Trees and Weighted Quartet Systems , 2003 .