On the complexity of computing evolutionary trees

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

Volumn 1276, Issue , 1997, Pages 134-145

  Gasieniec, Leszek ^a   Jansson, Jesper ^b   Lingas, Andrzej ^b   Östlin, Anna ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

AGREEMENT SUBTREE; COMPUTATIONAL BIOLOGY; CONSENSUS TREES; CONSTANT FACTORS; EVOLUTIONARY TREE; LOCAL CONSENSUS; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME;

TREES (MATHEMATICS);

EID: 84877796796     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0045080     Document Type: Conference Paper

References (20)

1. A.V. Aho, Y. Sagiv, T.G. Szymanski, and J.D. Ullman. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM Journal of Computing, Vol. 10, No. 3, 1981, pp. 405-421.
2. M. Bellare and M. Sudan. Improved non-approximability results. Proc. of the 26th ACM STOC, 1994, pp. 184-193.
3. M. Farach, T. Przytycka, and M. Thorup. Computing the agreement of trees with bounded degrees. Proc. of the 3rd ESA, 1995, pp. 381-393.
4. M. Farach and M. Thorup. Fast Comparison of Evolutionary Trees. Proc. of the 5th ACM-SIAM SODA, 1994, pp. 481-488.
5. M. Farach and M. Thorup. Optimal evolutionary tree comparison by sparse dynamic programming. Proc. of the 35th FOGS, 1994, pp. 770-779.
6. C.R. Finden and A.D. Gordon. Obtaining common pruned trees. Journal of Classification 2, 1985, pp. 255-276.
7. L. Gasieniec, J. Jansson, A. Lingas, and A. Östlin. On the complexity of computing evolutionary trees. Technical Report MPI-I-96-1-031, Max-Planck Institut für Informatik, Saarbrücken, November 1996.
8. M.X. Goemans and D.P. Williamson. New 3/4-approximation algorithms for MAX SAT. SIAM Journal of Discrete Mathematics, 7, 1994, pp. 656-666.
9. J. Hein, T. Jiang, L. Wang, and K. Zhang. On the Complexity of Comparing Evolutionary Trees. Discrete Applied Mathematics, 71, 1996, pp. 153-169.
10. M.R. Henzinger, V. King, and T. Warnow. Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Biology. Proc. of the 7th ACM-SIAM SODA, 1996, pp. 333-340.
11. D.S. Hochbaum (editor). Approximation Algorithms for NP-hard Problems. PWS Publishing Company, Boston, 1995.
12. C.A.J. Hurkens and A. Schrijver. On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM Journal of Discrete Mathematics, Vol. 2, No. 1, 1989, pp. 68-72.
13. D.S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9, 1974, pp. 256-278.
14. S. Kannan, T. Warnow, and S. Yooseph. Computing the Local Consensus of Trees. Proc. of the 6th ACM-SIAM SODA, 1995, pp. 68-77.
15. D.R. Karger. Minimum Cuts in Near-Linear Time. Proc. of the 28th ACM STOC, 1996, pp. 56-63.
16. D. Keselman and A. Amir. Maximum agreement subtree in a set of evolutionary trees - Metrics and efficient algorithms. Proc. of the 35th FOCS, 1994, pp. 758-769.
17. T.W. Lam, W.K. Sung, and H.F. Ting. Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time. Proc. of the 5th SWAT, 1996, pp. 124-135.
18. C.H. Papadimitriou. Computational Complexity, Addison-Wesley, Reading, 1994.
19. C. Phillips and T.J. Warnow. The Asymmetric Median Tree - A New Model for Building Consensus Trees. Proc. of the 7th CPM, LNCS 1075, 1996, pp. 234-252.
20. M. Steel and T. Warnow. Kaikoura tree theorems: Computing the maximum agreement subtree. Information Processing Letters 48, 1993, pp. 77-82.