Abstract
Given two rooted binary phylogenetic trees with identical leaf label-set, the Maximum Agreement Forest (Maf) problem asks for a largest common subforest of these two trees. This problem is known to be NP-complete and MAX SNP-hard, and the previously best approximation algorithm for this problem has a ratio 3. In this paper, we present an improved 2.5-approximation algorithm for the Maf problem on two rooted binary phylogenetic trees. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Shi, F., You, J., & Feng, Q. (2014). Improved approximation algorithm for maximum agreement forest of two trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8497 LNCS, pp. 205–215). Springer Verlag. https://doi.org/10.1007/978-3-319-08016-1_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
