Chapter

Frontiers in Algorithmics

Volume 8497 of the series Lecture Notes in Computer Science pp 205-215

Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees

  • Feng ShiAffiliated withSchool of Information Science and Engineering, Central South University
  • , Jie YouAffiliated withSchool of Information Science and Engineering, Central South University
  • , Qilong FengAffiliated withSchool of Information Science and Engineering, Central South University

* Final gross prices may vary according to local VAT.

Get Access

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.