An O(n log n) algorithm for the maximum agreement subtree problem for binary trees

SIAM Journal on Computing

Volumn 30, Issue 5, 2000, Pages 1385-1404

  Cole, Richard ^a   Farach Colton, Martin ^b   Hariharan, Ramesh ^c   Przytycka, Teresa ^d   Thorup, Mikkel ^e  

^a NEW YORK UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c INDIAN INSTITUTE OF SCIENCE   (India)

^d JOHNS HOPKINS UNIVERSITY SCHOOL OF MEDICINE   (United States)

^e AT AND T LABS RESEARCH   (United States)

Author keywords

Agreement subtree; Algorithms

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; SET THEORY; TOPOLOGY;

AGREEMENT SUBTREE PROBLEM; BINARY TREES;

TREES (MATHEMATICS);

EID: 0035189546     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796313477     Document Type: Article

References (14)

1. A. AMIR AND D. KESELMAN, Maximum agreement subtree in a set of evolutionary trees, SIAM J. Comput., 26 (1997), pp. 1656-1669.
2. R. COLE AND R. HARIHARAN, An O(n log n) algorithm for the maximum agreement subtree problem for binary trees, in Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1996, pp. 323-332.
3. M. FARACH, T. PRZYTYCKA, AND M. THORUP, The maximum agreement subtree problem for binary trees, in Proceedings of the 2nd European Symposium on Algorithms, Corfu, Greece, 1995, Lecture Notes in Comput. Sci. 979, Springer-Verlag, New York, 1995, pp. 381-393.
4. M. FARACH, T. PRZYTYCKA, AND M. THORUP, Agreement of many bounded degree evolutionary trees, Inform. Process. Lett., 55 (1995), pp. 297-301.
5. M. FARACH AND M. THORUP, Fast comparison of evolutionary trees, Inform. and Comput., 123 (1995), pp. 29-37.
6. M. FARACH AND M. THORUP, Sparse dynamic programming for evolutionary-tree comparison, SIAM J. Comput., 26 (1997), pp. 210-230.
7. C. R. FINDEN AND A. D. GORDON, Obtaining common pruned trees, J. Classification, 2 (1985), pp. 255-276.
8. M. L. FREDMAN, Two applications of a probabilistic search technique: Sorting X + Y and building balanced search trees, in Proceedings of the 7th ACM Symposium on the Theory of Computing, ACM, New York, 1975, pp. 240-244.
9. R. GRISHMAN AND R. YANGARBER, private communication, New York University, New York, 1995.
10. D. HAREL AND R. E. TARJAN, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13 (1984), pp. 338-355.
11. M.-Y. KAO, Tree contractions and evolutionary trees, SIAM J. Comput., 27 (1998), pp. 1592-1616.
12. E. KUBICKA, G. KUBICKI, AND F. R. MCMORRIS, An algorithm to find agreement subtrees, J. Classification, 12 (1995), pp. 91-100.
13. K. MEHLHORN, A best possible bound for the weighted path length of binary search trees, SIAM J. Computing, 6 (1977), pp. 235-239.
14. M. STEEL AND T. WARNOW, Kaikoura tree theorems: Computing the maximum agreement subtree, Inform. Process. Lett., 48 (1993), pp. 77-82.