Inapproximability results for the lateral gene transfer problem

No abstract is available for this paper.

• Publication year

  2005

• Venue

  Journal of combinatorial optimization

• Publication date

  2005-10-12

• Fields of study

  Biology, Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10878-006-8212-8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Ancient horizontal gene transfer

  2003cited by this paper
• Efficient algorithms for lateral gene transfer problems

  2001influential reference
• Complexity and Approximation

  1999cited by this paper
• On Some Tighter Inapproximability Results

  1998cited by this paper
• From gene to organismal phylogeny: reconciled trees and the gene tree/species tree problem.

  1997cited by this paper
• Proof verification and hardness of approximation problems

  1992cited by this paper
• Optimization, approximation, and complexity classes

  1991influential reference
• On the Complexity of Approximating the Independent Set Problem

  1989cited by this paper
• Approximation algorithms for combinatorial problems

  1973cited by this paper

• Gene tree species tree reconciliation with gene conversion

  2017cites this paper
• Gene tree reconciliation including transfers with replacement is NP-hard and FPT

  2017cites this paper
• Correcting Gene Trees by Leaf Insertions: Complexity and Approximation

  2016cites this paper
• Cophylogenetic analysis of dated trees

  2016cites this paper
• Beyond evolutionary trees

  2010influential citation
• Models and Methods in Comparative Genomics

  2006cites this paper