Abstract
Given a collection of phylogenetic trees with identical leaf label-set, the Maximum Agreement Forest problem (maf) asks for a largest common subforest of these input trees. The maf problem on two binary phylogenetic trees has been studied extensively in the literature. In this paper, we will be focused on the maf problem on multiple (i.e., two or more) binary phylogenetic trees and present two polynomial-time approximation algorithms, one for the maf problem on multiple rooted trees, and the other for the maf problem on multiple unrooted trees. The ratio of our algorithm for the maf problem on multiple rooted trees is 3, which is an improvement over the previously best ratio 8 for the problem. Our 4-approximation algorithm for the maf problem on multiple unrooted trees is the first approximation algorithm for the problem.
This work is supported by the National Natural Science Foundation of China under Grants (61103033, 61173051, 61232001).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Robinson, D., Foulds, L.: Comparison of phylogenetic trees. Mathematical Biosciences 53(1-2), 131–147 (1981)
Li, M., Tromp, J., Zhang, L.: On the nearest neighbour interchange distance between evolutionary trees. Journal on Theoretical Biology 182(4), 463–467 (1996)
Hodson, F., Kendall, D., Tauta, P. (eds.): The recovery of trees from measures of dissimilarity. Mathematics in the Archaeological and Historical Sciences, pp. 387–395. Edinburgh University Press, Edinburgh (1971)
Swofford, D., Olsen, G., Waddell, P., Hillis, D.: Phylogenetic inference. In: Molecular Systematics, 2nd edn., pp. 407–513. Sinauer Associates (1996)
Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discrete Applied Mathematics 71, 153–169 (1996)
Allen, B., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics 5(1), 1–15 (2001)
Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics 8(4), 409–423 (2005)
Rodrigues, E.M., Sagot, M.-F., Wakabayashi, Y.: Some approximation results for the maximum agreement forest problem. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, pp. 159–169. Springer, Heidelberg (2001)
Bonet, M., John, R., Mahindru, R., Amenta, N.: Approximating subtree distances between phylogenies. J. Comput. Biol. 13(8), 1419–1434 (2006)
Bordewich, M., McCartin, C., Semple, C.: A 3-approximation algorithm for the subtree distance between phylogenies. J. Discrete Algorithms 6(3), 458–471 (2008)
Rodrigues, E., Sagot, M., Wakabayashi, Y.: The maximum agreement forest problem: approximation algorithms and computational experiments. Theoretical Computer Science 374(1-3), 91–110 (2007)
Whidden, C., Zeh, N.: A unifying view on approximation and FPT of agreement forests. In: Salzberg, S.L., Warnow, T. (eds.) WABI 2009. LNCS, vol. 5724, pp. 390–402. Springer, Heidelberg (2009)
Whidden, C., Beiko, R., Zeh, N.: Fixed-parameter and approximation algorithms for maximum agreement forests. CoRR. abs/1108.2664 (2011)
Chen, J., Fan, J.-H., Sze, S.-H.: Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees. In: Brandstädt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 152–164. Springer, Heidelberg (2013)
Chataigner, F.: Approximating the maximum agreement forest on k trees. Information Processing Letters 93, 239–244 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Shi, F., Chen, J., Feng, Q., Wang, J. (2014). Approximation Algorithms for Maximum Agreement Forest on Multiple Trees. In: Cai, Z., Zelikovsky, A., Bourgeois, A. (eds) Computing and Combinatorics. COCOON 2014. Lecture Notes in Computer Science, vol 8591. Springer, Cham. https://doi.org/10.1007/978-3-319-08783-2_33
Download citation
DOI: https://doi.org/10.1007/978-3-319-08783-2_33
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08782-5
Online ISBN: 978-3-319-08783-2
eBook Packages: Computer ScienceComputer Science (R0)