Inapproximability results for the lateral gene transfer problem

Authors:
Bhaskar DasGupta;Sergio Ferrarini;Uthra Gopalakrishnan;Nisha Raj Paryani
Affiliations:
Department of Computer Science, University of Illinois at Chicago, Chicago, IL;Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano, Italy;Department of Computer Science, University of Illinois at Chicago, Chicago, IL;Department of Computer Science, University of Illinois at Chicago, Chicago, IL
Venue:
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Year:
2005

Citing 6
Cited 0

On the complexity of approximating the independent set problem

Information and Computation
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
Efficient algorithms for lateral gene transfer problems

RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
On Some Tighter Inapproximability Results, Further Improvements

On Some Tighter Inapproximability Results, Further Improvements
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallet and Lagergren [6], is that of finding the most parsimonious lateral gene transfer scenario for a given pair of gene and species trees. Our main results are the following: – (a) We show that it is not possible to approximate the problem in polynomial time within an approximation ratio of 1+ε, for some constant ε 0 unless P=NP. We also provide explicit values of ε for the above claim. – (b) We provide an upper bound on the cost of any 1-active scenario and prove the tightness of this bound.