Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees

  • Feng Shi
  • Jie You
  • Qilong Feng
Conference paper

DOI: 10.1007/978-3-319-08016-1_19

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8497)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Feng Shi
    • 1
  • Jie You
    • 1
  • Qilong Feng
    • 1
  1. 1.School of Information Science and EngineeringCentral South UniversityChina

Personalised recommendations