Journal of Combinatorial Optimization

, Volume 11, Issue 4, pp 387–405 | Cite as

Inapproximability results for the lateral gene transfer problem

  • Bhaskar Dasgupta
  • Sergio Ferrarini
  • Uthra Gopalakrishnan
  • Nisha Raj Paryani
Article

Abstract

This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallett and Lagergren (2001), 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:
  1. (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.

     
  2. (b)

    We provide an upper bound on the cost of any 1-active scenario and prove the tightness of this bound.

     

Keywords

Lateral gene transfer Phylogeny Inapproximability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arora S, Lund C, Motwani R, Sudan M, Szegedy M (1998) Proof verification and hardness of approximation problems. Journal of the ACM 45(3):501–555MathSciNetCrossRefMATHGoogle Scholar
  2. Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti Spaccamela A, Protasi M (1999) Complexity and approximation. Combinatorial Optimization Problems and their Approximability Properties. Springer-Verlag, BerlinMATHGoogle Scholar
  3. Berman P, Karpinski M (1998) On some tighter inapproximability results, further improvements. Technical report TR98-065, Electronic Colloquium on Computational Complexity (ECCC); available online from http://eccc.uni-trier.de/eccc-reports/1998/TR98-065/index.html..
  4. Berman P, Schnitger G (1992) On the complexity of approximating the independent set problem. Information and Computation 96:77–94MathSciNetCrossRefMATHGoogle Scholar
  5. Brown JR (2003) Ancient horizontal gene transfer. Nature Reviews, Genetics 4:121–132CrossRefGoogle Scholar
  6. Hallett M, Lagergren J (2001) Efficient algorithms for lateral gene transfer problems. In Proc. 5th Annual International Conference on Computational Molecular Biology (RECOMB), Montreal, Canada, pp. 141–148Google Scholar
  7. Hallett M, Lagergren J (2004) Identifying lateral gene transfer events, submitted to journal (available online from http://www.mcb.mcgill.ca/~hallett/Lateral.pdf)
  8. Johnson DS (1974) Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9:256–278MATHMathSciNetCrossRefGoogle Scholar
  9. Page RDM, Charleston MA (1997) From gene to organismal phylogeny: Reconciled tree and the gene tree/species tree problem. Molecular Phylogentics and Evolution 7:231–240CrossRefGoogle Scholar
  10. Papadimitriou CH, Yannakakis M (1991) Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43(3):425–440MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  • Bhaskar Dasgupta
    • 1
  • Sergio Ferrarini
    • 2
  • Uthra Gopalakrishnan
    • 1
  • Nisha Raj Paryani
    • 1
  1. 1.Department of Computer ScienceUniversity of Illinois at ChicagoChicago
  2. 2.Dipartimento di Elettronica e InformazionePolitecnico di MilanoMilanoItaly

Personalised recommendations