Computing unrooted maximum subtrees in sub-quartic time

This paper presents an O(n1.75+o(1)) time algorithm for the Unrooted Maximum Agreement Subtree (UMAST) problem: Given a set A of n items (e.g. species) and two unrooted trees T and T', each with n leaves uniquely labeled by the items of A, we want to compute the largest subset B of A such that the subtrees of T and T' induced by B are isomorphic. The UMAST problem is closely related to some problems in biology, in particular, the one of finding the consensus between evolutionary trees (or phylogenies) of a set of species.

[1]  Mikkel Thorup,et al.  Computing the Agreement of Trees with Bounded Degrees , 1995, ESA.

[2]  Michael R. Fellows,et al.  Two Strikes Against Perfect Phylogeny , 1992, ICALP.

[3]  Amihood Amir,et al.  Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms , 1997, SIAM J. Comput..

[4]  A. D. Gordon,et al.  Obtaining common pruned trees , 1985 .

[5]  W. H. Day Computational complexity of inferring phylogenies from dissimilarity matrices. , 1987, Bulletin of mathematical biology.

[6]  David Fernández-Baca,et al.  A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed , 1993, FOCS.

[7]  Robert E. Tarjan,et al.  Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..

[8]  Sampath Kannan,et al.  Computing the local consensus of trees , 1995, SODA '95.

[9]  John D. Kececioglu,et al.  Reconstructing a history of recombinations from a set of sequences , 1994, SODA '94.

[10]  Amihood Amir,et al.  Maximum agreement subtree in a set of evolutionary trees-metrics and efficient algorithms , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[11]  F. McMorris,et al.  An algorithm to find agreement subtrees , 1995 .

[12]  Mikkel Thorup,et al.  An O(n log n) algorithm for the maximum agreement subtree problem for binary trees , 1996, SODA '96.

[13]  Mikkel Thorup,et al.  Fast comparison of evolutionary trees , 1994, SODA '94.

[14]  Mikkel Thorup,et al.  Optimal evolutionary tree comparison by sparse dynamic programming , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[15]  J. Felsenstein Numerical Methods for Inferring Evolutionary Trees , 1982, The Quarterly Review of Biology.

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