An improved algorithm for the maximum agreement subtree problem

Information Processing Letters

Volumn 94, Issue 5, 2005, Pages 211-216

  Lee, Chuan Min ^a   Hung, Ling Ju ^a   Chang, Maw Shang ^a   Shen, Chia Ben ^b   Tang, Chuan Yi ^b  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Design of algorithms; Evolutionary tree; Leaf labeled tree; Maximum agreement subtree; Multidimensional binary search tree; Multidimensional range search tree

Indexed keywords

DATA REDUCTION; DATA STRUCTURES; DATABASE SYSTEMS; DYNAMIC PROGRAMMING; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

DESIGN OF ALGORITHMS; EVOLUTIONARY TREE; LEAF-LABELED TREE; MAXIMUM AGREEMENT SUBTREE; MULTIDIMENSIONAL BINARY SEARCH TREE; MULTIDIMENSIONAL RANGE SEARCH TREE;

EVOLUTIONARY ALGORITHMS;

EID: 18444374444     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.02.005     Document Type: Article

References (16)

1. A. Amir, and D. Keselman Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithms SIAM J. Comput. 26 1997 1656 1669
2. J.L. Bentley Multidimensional binary search trees in database applications IEEE Trans. Softw. Eng. SE-5 4 1979 333 340
3. D. Bryant, Building trees, hunting for trees, and comparing trees: theory and methods in phylogenetic analysis, Ph.D. thesis, Dept. Math., University of Canterbury, 1997, pp. 174-182
4. R. Cole, M. Farach, R. Hariharan, T. Przytycka, and M. Thorup An O (n log n) algorithm for the maximum agreement subtree problem for binary trees SIAM J. Comput. 30 2000 1385 1404
5. M. Farach, T. Przytycka, and M. Thorup The maximum agreement subtree problem for binary trees Proc. 2nd European Symp. on Algorithms, Corfu, Greece, 1995 Lecture Notes in Comput. Sci. vol. 979 1995 Springer-Verlag New York 381 393
6. M. Farach, T. Przytycka, and M. Thorup On the agreement of many trees Inform. Process. Lett. 55 1995 297 301
7. M. Farach, and M. Thorup Fast comparison of evolutionary trees Inform. and Comput. 123 1995 29 37
8. M. Farach, and M. Thorup Sparse dynamic programming for evolutionary-tree comparison SIAM J. Comput. 26 1997 210 230
9. J. Felsenstein Inferring Phylogenies 2004 Sinauer Associates Sunderland, MA
10. C.R. Finden, and A.D. Gordon Obtaining common pruned trees J. Classification 2 1985 255 276
11. H.N. Gabow, J.L. Bentley, R.E. Tarjan, Scaling and related techniques for geometry problems, in: Proc. 16th Annual ACM Symp. on Theory of Computing, 1984, pp. 135-143
12. M.Y. Kao Tree contractions and evolutionary trees SIAM J. Comput. 27 1998 1592 1616
13. E. Kubicka, G. Kubicki, and F.R. McMorris An algorithm to find agreement subtrees J. Classification 12 1995 91 100
14. D.T. Lee, and C.K. Wong Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees Acta Inform. 9 1977 23 29
15. K. Mehlhorn Multi-Dimensional Searching and Computational Geometry Data Structures and Algorithms vol. 3 1984 Springer Berlin
16. M. Steel, and T. Warnow Kaikoura tree theorems: Computing the maximum agreement subtree Inform. Process. Lett. 48 1993 77 82