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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3341, Issue , 2004, Pages 754-765

  Peng, Zeshan ^a   Ting, Hingfung ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; BINARY TREES; BINS; TREES (MATHEMATICS);

AGREEMENT SUBTREE; ALGORITHM FOR SOLVING; EVOLUTIONARY TREE; GENERALISATION; MAXIMUM AGREEMENT SUBTREES; TIME ALGORITHMS; TIME COMPLEXITY;

BINARY TREES; PROBLEM SOLVING;

EID: 35048864845     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_65     Document Type: Article

References (12)

1. R. Cole, M. Farach, R. Hariharan, T. Przytycka, and M. Thorup. An O(nlogn) algorithm for the maximum agreement subtree problem for binary trees. SIAM Journal on Computing, 30(5):1385-1404, 2000.
2. M. Farach and M. Throup. Optimal evolutionary tree comparison by sparse dynamic programming. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 770-779, 1994.
3. M. Farach and M. Throup. Fast comparison of evolutionary trees. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 481-488, 1995.
4. C. Finden and A. Gordan. Obtaining common pruned trees. Journal of Classification, 2:255-276, 1985.
5. D. Gusfield. Efficient algorithms for inferring evolutionary trees. Networks, 21:1928, 1991.
6. S. Kannan, E. L. Lawler, and T. Warnow. Determining the evolutionary tree. In Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 475-484, 1990.
7. M.Y. Kao. Tree contractions and evolutionary trees. SIAM Journal on Computing, 27:1592-1616, 1998.
8. M.Y. Kao, T.W. Lam, W.K. Sung, and H.F. Ting. A decomposition theorem for maximum weight bipartite matchings with applications in evolution trees. In Proceddings of the 7th Annual European Symposium on Algorithms, pages 438-449, 1999.
9. M.Y. Kao, T.W. Lam, W.K. Sung, and H.F. Ting. An even faster and more unifying algorithm comparing trees via unbalanced bipartite matchings. Journal of Algorithms, 20(2):212-233, 2001.
10. D. Keselman and A. Amir. Maximum agreement subtree in a set of evolutionary trees- metrics and efficient algorithms. In Proceedings of 35th Annual Symposium on the Foundations of Computer Sciences, pages 758-769, 1994.
11. E. Kubicka, G. Kubicki, and F. McMorris. An algorithm to find agreement subtrees. Journal of Classification, 12:91-99, 1995.
12. M. Steel and T. Warnow. Kaikoura tree theorems: computing the maximum agreement subtree. Information Processing Letters, 48(2):77-82, 1994.