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

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 323-332

  Cole, Richard ^a   Hariharan, Ramesh ^b  

^a NEW YORK UNIVERSITY   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; TREES (MATHEMATICS);

MAXIMUM AGREEMENT SUBTREES; TIME ALGORITHMS;

BINARY TREES;

EID: 84947944860     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. A. V. AHO, D. S. HIRSCHBERG, J. D. ULLMAN. Bounds on the complexity of the longest common subsequence problem. Journal of the ACM, 23, pp. 1-12, 1976.
2. A. AMIR, D. KESELMAN. Maximum agreement subtrees in multiple evolutionary trees. Proc. of the 35th IEEE FOCS, pp. 758-769, 1994.
3. M. FARACH, M. THORUP. Fast comparison of evolutionary trees. Proc. of the 5th SODA, pp. 481-488, 1994.
4. M. FARACH, M. THORUP. Optimal evolutionary tree comparison by sparse dynamic programming. Proc. of the 35th IEEE FOCS, pp. 770-779, 1994.
5. M. FARACH, T. PRZYTYCKA, M. THORUP. The maximum agreement subtree problem for binary trees. Proc. of 2nd ESA, 1995.
6. M. FARACH, T. PRZYTYCKA, M. THORUP. Agreement of many bounded degree evolutionary trees. Manuscript. 1995.
7. C. R. FINDEN, A. D. GORDON. Obtaining common pruned trees. Journal of Classification, Vol. 2, pp. 255-276, 1985.
8. R. GRISHMAN, R. YANQARBER. Private Communication, NYU, 1995.
9. D. S. HIRSCHBERG. An information theoretic lower bound for the longest common subsequence problem. Information Processing Letters, 7, pp. 40-41, 1978.
10. M-Y. KAO. Tree contractions and evolutionary trees. Manuscript, Private Communication, 1995.
11. E. KUBICKA, G. KUBICKI, F. R. MCMORRIS. An algorithm to find agreement subtrees. To appear in Journal of Classification, 1992.
12. M. STEEL, T. WARNOW. Kaikoura tree theorems: computing the maximum agreement subtree. Information Processing Letters, 48, pp. 77-82, 1993.
13. C. K. WONG, A. K. CHANDRA. Bounds for the string editing problem. Journal of the ACM, 23, pp. 13-16, 1976.