Abstract
In this paper we study a few important tree optimization problems with applications to computational biology. These problems ask for trees that are consistent with an as large part of the given data as possible. We show that the maximum homeomorphic agreement subtree problem cannot be approximated within a factor of \(N^\varepsilon\), where N is the input size, for any 0 ≤ \(\varepsilon < \tfrac{1}{9}\) in polynomial time unless P = NP, even if all the given trees are of height 2. On the other hand, we present an O(N log N)-time heuristic for the restriction of this problem to instances with O(1) trees of height O(1) yielding solutions within a constant factor of the optimum. We prove that the maximum inferred consensus tree problem is NP-complete, and provide a simple, fast heuristic for it yielding solutions within one third of the optimum. We also present a more specialized polynomial-time heuristic for the maximum inferred local consensus tree problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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.
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.
M. Farach and M. Thorup, “Fast comparison of evolutionary trees,” in Proc. of the 5th ACM-SIAM SODA, 1994a, pp. 481-488.
M. Farach and M. Thorup, “Optimal evolutionary tree comparison by sparse dynamic programming,” in Proc. of the 35th FOCS, 1994b, pp. 770-779.
C.R. Finden and A.D. Gordon, “Obtaining common pruned trees,” Journal of Classification, vol. 2, pp. 255-276, 1985.
M.X. Goemans and D.P. Williamson, “New \(\frac{3}{4}\)-approximation algorithms for MAX SAT,” SIAM Journal of Discrete Mathematics, vol. 7, pp. 656-666, 1994.
J. Håstad, “Testing of the long code and hardness for clique,” in Proc. of the 28th ACM STOC, 1996, pp. 11-19.
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.
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.
D.S. Hochbaum, Ed., Approximation Algorithms for NP-hard Problems, PWS Publishing Company: Boston, 1995.
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.
D.S. Johnson, “Approximation algorithms for combinatorial problems,” Journal of Computer and System Sciences, vol. 9, pp. 256-278, 1974.
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.
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.
D.R. Karger, “Minimum cuts in near-linear time,” in Proc. of the 28th ACM STOC, 1996, pp. 56-63.
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.
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.
C.H. Papadimitriou, “Computational Complexity,” Addison-Wesley: Reading, 1994.
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.
M. Steel and T. Warnow, “Kaikoura tree theorems: Computing the maximum agreement subtree,” Information Processing Letters, vol. 48, pp. 77-82, 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gasieniec, L., Jansson, J., Lingas, A. et al. On the Complexity of Constructing Evolutionary Trees. Journal of Combinatorial Optimization 3, 183–197 (1999). https://doi.org/10.1023/A:1009833626004
Issue Date:
DOI: https://doi.org/10.1023/A:1009833626004