Approximating the complement of the maximum compatible subset of leaves of k trees

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

Volumn 2462, Issue , 2002, Pages 122-134

  Ganapathy, Ganeshkumar ^a   Warnow, Tandy ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; FORESTRY; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

BOUNDED DEGREE; COMMON REFINEMENT; K-TREES; MAXIMUM AGREEMENT SUBTREES; NP-HARD; POLYNOMIAL-TIME;

BINARY TREES;

EID: 84956979382     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45753-4_12     Document Type: Conference Paper

References (12)

1. A. Amir and D. Keselman. Maximum agreement subtrees in a set of evolutionary evolutionary trees: Metrics and efficient algorithms. SIAM Journal of Computing, 26(6):1656–1669, 1997. A preliminary version of this paper appeared in FOCS’94.
2. P. Buneman. The recovery of trees from measures of dissimilarity. Mathematics in the Archaelogical and historical Sciences, pages 387–395, 1971.
3. M. F. Colton, T.M. Przytycka, and M. Thorup. On the agreement of many trees. Information Processing Letters, 55:297–301, 1995.
4. M. F. Colton and M. Thorup. Fast comparison of evolutionary trees. In Proc. Of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 481–488, 1994.
5. C.R. Finden and A.D. Gordon. Obtaining common pruned trees. Journal of Classification, 2:255–276, 1985.
6. D. Gusfield. Efficient algorithms for inferring evolutionary trees. Networks, 21:19–28, 1991.
7. A. Hamel and M. A. Steel. Finding a maximum compatible tree is NP-hard for sequences and trees. Applied Mathematics Letters, 9(2):55–60, 1996.
8. J. Hein, T. Jiang, L. Wang, and K. Zhang. On the complexity of comparing evolutionary trees. Discrete and Applied Mathematics, 71:153–169, 1996.
9. M. Steeland T. Warnow. Kaikoura tree theorems: computing the maximum agreement subtree. Information Processing Letters, 48:77–82, 1993.
10. D. Swofford. PAUP*: Phylogenetic analysis using parsimony (and other methods), version 4.0. 1996.
11. D. L. Swofford, G. J. Olsen, P. J. Waddell, and D. M. Hillis. Phylogenetic inference. In D. M. Hillis, B. K. Mable, and C. Moritz, editors, Molecular Systematics, pages 407–514. Sinauer Assoc., 1996.
12. T. Warnow. Tree compatibility and inferring evolutionary history. Journal of Algorithms, 16:388–407, 1994.