A note on the fixed parameter tractability of the gene-duplication problem

Mukul S. Bansal, Ron Shamir

Research output: Contribution to journalArticlepeer-review

Abstract

The NP-hard gene-duplication problem takes as input a collection of gene trees and seeks a species tree that requires the fewest number of gene duplications to reconcile the input gene trees. An oft-cited, decade-old result by Stege states that the gene-duplication problem is fixed parameter tractable when parameterized by the number of gene duplications necessary for the reconciliation. Here, we uncover an error in this fixed parameter algorithm and show that this error cannot be corrected without sacrificing the fixed parameter tractability of the algorithm. Furthermore, we show a link between the gene-duplication problem and the minimum rooted triplets inconsistency problem which implies that the gene-duplication problem is 1) W[2]-hard when parameterized by the number of gene duplications necessary for the reconciliation and 2) hard to approximate to better than a logarithmic factor.

Original languageEnglish
Article number5557848
Pages (from-to)848-850
Number of pages3
JournalIEEE/ACM Transactions on Computational Biology and Bioinformatics
Volume8
Issue number3
DOIs
StatePublished - 2011

Keywords

  • Phylogenetics
  • algorithms
  • approximability
  • fixed parameter tractability
  • gene duplication

Fingerprint

Dive into the research topics of 'A note on the fixed parameter tractability of the gene-duplication problem'. Together they form a unique fingerprint.

Cite this