Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees
- Cite this paper as:
- Shi F., You J., Feng Q. (2014) Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees. In: Chen J., Hopcroft J.E., Wang J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham
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.
Unable to display preview. Download preview PDF.