On the Complexity of Constructing Evolutionary Trees

Journal of Combinatorial Optimization

Volumn 3, Issue 2-3, 1999, Pages 183-197

  Ga̧sieniec, Leszek ^a   Jansson, Jesper ^b   Lingas, Andrzej ^c   Östlin, Anna ^c  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b LUND INSTITUTE OF TECHNOLOGY   (Sweden)

^c LUND UNIVERSITY   (Sweden)

Author keywords

Algorithm; Consensus tree; Evolutionary tree; Homeomorphism; Time complexity

Indexed keywords

EID: 0043045976     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1009833626004     Document Type: Article

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, pp. 405-421, 1981.
2. M. Farach, T. Przytycka, and M. Thorup, "Computing the agreement of trees with bounded degrees," in Proc. of the 3rd ESA, 1995, pp. 381-393.
3. M. Farach and M. Thorup, "Fast comparison of evolutionary trees," in Proc. of the 5th ACM-SIAM SODA, 1994a, pp. 481-488.
4. M. Farach and M. Thorup, "Optimal evolutionary tree comparison by sparse dynamic programming," in Proc. of the 35th FOCS, 1994b, pp. 770-779.
5. C.R. Finden and A.D. Gordon, "Obtaining common pruned trees," Journal of Classification, vol. 2, pp. 255-276, 1985.
6. M.X. Goemans and D.P. Williamson, "New 3/4-approximation algorithms for MAX SAT," SIAM Journal of Discrete Mathematics, vol. 7, pp. 656-666, 1994.
7. J. Håstad, "Testing of the long code and hardness for clique," in Proc. of the 28th ACM STOC, 1996, pp. 11-19.
8. J. Hein, T. Jiang, L. Wang, and K. Zhang, "On the complexity of comparing evolutionary trees," Discrete Applied Mathematics, vol. 71, pp. 153-169, 1996.
9. M.R. Henzinger, V. King, and T. Warnow, "Constructing a tree from homeomorphic subtrees, with applications to computational biology," in Proc. of the 7th ACM-SIAM SODA, 1996, pp. 333-340.
10. D.S. Hochbaum, Ed., Approximation Algorithms for NP-hard Problems, PWS Publishing Company: Boston, 1995.
11. 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, pp. 68-72, 1989.
12. D.S. Johnson, "Approximation algorithms for combinatorial problems," Journal of Computer and System Sciences, vol. 9, pp. 256-278, 1974.
13. S. Kannan, T. Warnow, and S. Yooseph, "Computing the local consensus of trees," in Proc. of the 6th ACM-SIAM SODA, 1995, pp. 68-77.
14. M.Y. Kao, T.W. Lam, T. Przytycka, W.K. Sung, and H.F. Ting, "General techniques for comparing unrooted evolutionary trees," in Proc. of the 29th ACM STOC, 1997, pp. 54-65.
15. D.R. Karger, "Minimum cuts in near-linear time," in 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," in 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," in 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," in 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, vol. 48, pp. 77-82, 1993.