Abstract
This paper presents the first sub-quadratic 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 {otn} 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. The previous best algorithm for the UMAST problem requires time O(n 2+o(1)) [5]; the algorithm in this paper improves the time bound to O(n 1.75+o(1)). The rooted version of this problem has also attracted a lot of attention; the time complexity has recently been improved from O(n 2) [5] to O(n 1-5 log {otn}) [6].
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Agarwala and D. Fernandez-Baca, A polynomial-time algorithm for the phylogeny problem when the number of character states is fixed, FOCS, 140–147, 1993.
H. Bodlaender, M. Fellows and T. Warnow, Two strikes against perfect phylogeny, ICALP, 273–283, 1992.
R. Cole and R. Hariharan, An O(n log n) algorithm for the maximum agreement subtree problem for binary trees, SODA, 323–332, 1996.
W.H.E. Day, Computational complexity of inferring phylogenies from dissimilarity matrices, Bulletin of Mathematical Biology, 49(4):461–467, 1987.
M. Farach and M. Thorup, Fast comparison of evolutionary trees, SODA, 481–488, 1994.
M. Farach and M. Thorup, Optimal evolutionary tree comparison by sparse dynamic programming, FOCS, 770–779, 1994.
M. Farach, T. Przytycka and M. Thorup, Computing the agreement of trees with bounded degrees, ESA, 381–393, 1995.
J. Felsenstein, Numerical methods for inferring evolutionary tree, The Quarterly Review of Biology, 57(4):379–404, 1982.
C. Finden and A. Gordon, Obtaining common pruned trees, Journal of Classification, 2:255–276, 1985.
H. Gabow and R. Tarjan, Faster scaling algorithms for network problems, SIAM Journal of Computing, 18(5): 1013–1036, 1989.
S. Kannan, T. Warnow and S. Yooseph, Computing the local consensus of trees, SODA, 68–77, 1995.
J. Kececioglu and D. Gusfield, Reconstructing a history of recombinations from a set of sequences, SODA, 471–480, 1994.
D. Keselman and A. Amir, Maximum agreement subtree in a set of evolutionary trees — Metrics and efficient algorithms, FOCS, 758–769, 1994.
E. Kubicka, G. Kubicki and F. McMorris, An algorithm to find agreement subtrees, Journal of Classification, 1994.
M. Steel and T. Warnow, Kaikoura tree theorems: computing the maximum agreement subtree, Information Processing Letters, 48:77–82, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lam, T.W., Sung, W.K., Ting, H.F. (1996). Computing the unrooted maximum agreement subtree in sub-quadratic time. In: Karlsson, R., Lingas, A. (eds) Algorithm Theory — SWAT'96. SWAT 1996. Lecture Notes in Computer Science, vol 1097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61422-2_126
Download citation
DOI: https://doi.org/10.1007/3-540-61422-2_126
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61422-7
Online ISBN: 978-3-540-68529-6
eBook Packages: Springer Book Archive