Modified Mincut Supertrees

A polynomial time supertree algorithm could play a key role in a divide-and-conquer strategy for assembling the tree of life. To date only a single such method capable of accommodate conflicting input trees has been proposed, the MinCutSupertree algorithm of Semple and Steel. This paper describes this algorithm and its implementation, then illustrates some weaknesses of the method. A modification to the algorithm that avoids some of these problems is proposed. The paper concludes by discussing some practical problems in supertree construction.

[1]  D. Swofford.  When are phylogeny estimates from molecular and morphological data incongruent , 1991 .

[2]  William H. Piel,et al.  Phyloinformatics and Tree Networks , 2003, Computational Biology and Genome Informatics.

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

[4]  M. Steel,et al.  Extension Operations on Sets of Leaf-Labeled Trees , 1995 .

[5]  Maurice Queyranne,et al.  On the structure of all minimum cuts in a network and applications , 1982, Math. Program..

[6]  W. Maddison.  RECONSTRUCTING CHARACTER EVOLUTION ON POLYTOMOUS CLADOGRAMS , 1989, Cladistics : the international journal of the Willi Hennig Society.

[7]  Nicholas C. Wormald,et al.  Reconstruction of Rooted Trees From Subtrees , 1996, Discret. Appl. Math..

[8]  J. Slowinski,et al.  Molecular polytomies. , 2001, Molecular phylogenetics and evolution.

[9]  Aravind K. Joshi,et al.  An Introduction to Tree Adjoining Grammar , 1987 .

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

[11]  D. Littlewood,et al.  Interrelationships of the Platyhelminthes , 2001 .

[12]  M Steel,et al.  Simple but fundamental limitations on supertree and consensus tree methods. , 2000, Systematic biology.

[13]  R. Graham,et al.  Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time , 1982 .

[14]  Tandy J. Warnow,et al.  Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time , 2001, WABI.

[15]  Mechthild Stoer,et al.  A simple min-cut algorithm , 1997, JACM.

[16]  William H. E. Day,et al.  Analysis of Quartet Dissimilarity Measures Between Undirected Phylogenetic Trees , 1986 .

[17]  William H. E. Day,et al.  The role of complexity in comparing classifications , 1983 .

[18]  Mike Steel,et al.  Points of View Simple but Fundamental Limitations on Supertree and Consensus Tree Methods , 2000 .

[19]  Mikkel Thorup,et al.  On the Agreement of Many Trees , 1995, Inf. Process. Lett..

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

[21]  David Sankoff,et al.  Tree enumeration modulo a consensus , 1986 .

[22]  Paul P. Wang,et al.  Computational Biology and Genome Informatics , 2003 .

[23]  Tandy J. Warnow,et al.  Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree , 1993, Inf. Process. Lett..

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

[25]  David Fernández-Baca,et al.  Supertrees by Flipping , 2002, COCOON.

[26]  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..

[27]  M. Miyamoto,et al.  Phylogenetic Analysis of DNA Sequences , 1991 .

[28]  R. Page.  Extracting species trees from complex gene trees: reconciled trees and vertebrate phylogeny. , 2000, Molecular phylogenetics and evolution.

[29]  M. Steel.  The complexity of reconstructing trees from qualitative characters and subtrees , 1992 .

[30]  Gareth Nelson,et al.  Multiple Branching in Cladograms: Two Interpretations , 1980 .

[31]  E. N. Adams,et al.  N-trees as nestings: Complexity, similarity, and consensus , 1986 .