Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms

SIAM Journal on Computing

Volumn 26, Issue 6, 1997, Pages 1656-1669

  Amir, Amihood ^a   Keselman, Dmitry ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Classification; Evolutionary trees; Maximum agreement subtrees

Indexed keywords

APPROXIMATION ALGORITHMS; CLASSIFICATION (OF INFORMATION); DYNAMIC PROGRAMMING; FORESTRY; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

AGREEMENT SUBTREE; EVOLUTIONARY TREE; HOMEOMORPHIC; MAXIMUM AGREEMENT SUBTREES; NP COMPLETE; NUMBER OF TREES; OPTIMUM SOLUTION; POLYNOMIAL-TIME ALGORITHMS;

EVOLUTIONARY ALGORITHMS;

EID: 0006683426     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794269461     Document Type: Article

References (18)

1. A. AMIR AND D. KESELMAN, Maximum agreement subtree in a set of evolutionary trees - Metrics and efficient algorithms, in Proc. 35th IEEE Symposium on Foundations of Computer Science, Santa Fe, NM, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 758-769.
2. H. J. BANDELT AND A. DRESS, Reconstructing the shape of a tree from observed dissimilarity data, Adv. Appl. Math, 7 (1986), pp. 309-343.
3. W. H. E. DAY, Optimal algorithms for comparing trees with labeled leaves, J. Classification, 2 (1985), pp. 7-28.
4. M. FARACH, S. KANNAN, AND T. WARNOW, A robust model for finding optimal evolutionary trees, in Proc. 25th Annual ACM Symposium on the Theory of Computing, San Diego, CA, ACM, New York, 1993, pp. 137-145.
5. M. FARACH, T. M. PRZYTYCKA, AND M. THORUP, On the agreement of many trees, in Proc. 3rd European Symposium on Algorithms, Corfo, Greece, 1995, pp. 381-393.
6. M. FARACH AND M. THORUP, Fast comparison of evolutionary trees, in Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, SIAM, Philadelphia, 1994, pp. 481-488.
7. C. R. FINDEN AND A. D. GORDON, Obtaining common pruned trees, J. Classification, 2 (1985), pp. 255-276.
8. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
9. W. GODDARD, E. KUBICKA, G. KUBICKI, AND F. R. MCMORRIS, Agreement subtrees, metric and consensus for labeled binary trees, DIMACS Workshop on Partitioning Data Sets, Rutgers University, New Brunswick, NJ, 1993.
10. A. D. GORDON, A measure of the agreement between rankings, Biometrika, 66 (1979), pp. 7-15.
11. A. D. GORDON, On the assessment and comparison of classifications, in Analyse de Données et Informatique, R. Tomassone, ed., INRIA, 1980, pp. 149-160.
12. J. A. HARTIGAN, Clustering algorithms, John Wiley, New York, 1975.
13. J. HEIN, T. JIANG, L. WANG, AND K. ZHANG, On the Complexity of Comparing Evolutionary Trees, in Proc. 6th Symposium on Combinational Pattern Matching, Helsinki, Finland, 1995, pp. 177-190.
14. E. KUBICKA, G. KUBICKI, AND F. R. MCMORRIS, An algorithm to find agreement subtrees, J. Classification, 1992.
15. D. A. NEUMANN, Faithful consensus methods for n-trees, Bull. Math. Biol., 63 (1983), pp. 271-287.
16. E. A. SMOLENSKII, Jurnal Vicisl. Mat. i Matem. Fiz, 2 (1962), pp. 371-372.
17. M. STEEL AND T. WARNOW, Kaikoura tree theorems: Computing the maximum agreement subtree, Inform. Proc. Lett., 48 (1993), pp. 77-82.
18. M. A. STEEL AND D. PENNY, Distributions of tree comparison metrics - Some new results, Syst. Biol., 42 (1993), pp. 126-141.