Advertisement

Inapproximability Results for the Lateral Gene Transfer Problem

  • Bhaskar DasGupta
  • Sergio Ferrarini
  • Uthra Gopalakrishnan
  • Nisha Raj Paryani
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3701)

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.

Keywords

Species Tree Gene Tree Internal Node Approximation Ratio Lateral Gene Transfer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

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 ChicagoChicagoUSA
  2. 2.Dipartimento di Elettronica e InformazionePolitecnico di MilanoMilanoItaly

Personalised recommendations