Approximation Algorithms for Bounded Degree Phylogenetic Roots
Tóm tắt
The Degree-
Δ
Closest Phylogenetic
k
th Root Problem (ΔCPR
k
) is the problem of finding a (phylogenetic) tree T from a given graph G=(V,E) such that (1) the degree of each internal node in T is at least 3 and at most Δ, (2) the external nodes (i.e. leaves) of T are exactly the elements of V, and (3) the number of disagreements, i.e., |E
⊕{{u,v} : u,v are leaves of T and d
T
(u,v)≤k}|, is minimized, where d
T
(u,v) denotes the distance between u and v in tree T. This problem arises from theoretical studies in evolutionary biology and generalizes several important combinatorial optimization problems such as the maximum matching problem. Unfortunately, it is known to be NP-hard for all fixed constants Δ,k such that either both Δ≥3 and k≥3, or Δ>3 and k=2. This paper presents a polynomial-time 8-approximation algorithm for Δ
CPR
2 for any fixed Δ>3, a quadratic-time 12-approximation algorithm for 3CPR
3, and a polynomial-time approximation scheme for the maximization version of Δ
CPR
k
for any fixed Δ and k.
Tài liệu tham khảo
Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1–3), 89–113 (2004)
Charikar, M., Guruswami, V., Wirth, A.: Clustering with Qualitative Information. In: Proceedings of 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS’03), pp. 524–533 (2003)
Chen, Z.-Z., Jiang, T., Lin, G.-H.: Computing phylogenetic roots with bounded degrees and errors. SIAM J. Comput. 32(4), 864–879 (2003). A preliminary version appeared in Proceedings of 7th International Workshop on Algorithms and Data Structures (WADS’01). Lecture Notes in Computer Science, vol. 2125, pp. 377–388 (2001)
Chen, Z.-Z., Tsukiji, T.: Computing bounded-degree phylogenetic roots of disconnected graphs. J. Algorithms 59(2), 125–148 (2006). A preliminary version appeared in Proceedings of 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’04). Lecture Notes in Computer Science, vol. 3353, pp. 308–319 (2004)
Dahlhaus, E., Hajnal, P., Karpinski, M.: On the parallel complexity of Hamiltonian cycle and matching problem on dense graphs. J. Algorithms 15, 367–384 (1993)
Hassin, R., Rubinstein, S.: An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes. Inf. Process. Lett. 98, 92–95 (2006)
Lin, G.-H., Kearney, P.E., Jiang, T.: Phylogenetic k-Root and Steiner k-Root. In: Proceedings of the 11th Annual International Symposium on Algorithms and Computation (ISAAC 2000). Lecture Notes in Computer Science, vol. 1969, pp. 539–551 (2000)
Pulleyblank, W.R.: Faces of matching polyhedra. PhD thesis, Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo (1973)
Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Appl. Math. 14, 173–182 (2004)
Swofford, D.L., Olsen, G.J., Waddell, P.J., Hillis, D.M.: Phylogenetic inference. In: Hillis, D.M., Moritz, C., Mable, B.K. (eds.) Molecular Systematics, 2nd edn. pp. 407–514. Sinauer Associates, Sunderland (1996)
Tsukiji, T., Chen, Z.-Z.: Computing phylogenetic roots with bounded degrees and errors is hard. Theor. Comput. Sci. 363, 43–59 (2006). A preliminary version appeared in the Proceedings of 10th Annual International Computing and Combinatorics Conference (COCOON’04). Lecture Notes in Computer Science, vol. 3106, pp. 450–461 (2004)
Weitz, R.R., Lakshminarayanan, S.: An empirical comparison of heuristic methods for creating maximally diverse groups. J. Oper. Res. Soc. 49, 635–646 (1998)