Inapproximability results for the lateral gene transfer problem
- 41 Downloads
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.
We provide an upper bound on the cost of any 1-active scenario and prove the tightness of this bound.
KeywordsLateral gene transfer Phylogeny Inapproximability
Unable to display preview. Download preview PDF.
- 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..
- 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
- Hallett M, Lagergren J (2004) Identifying lateral gene transfer events, submitted to journal (available online from http://www.mcb.mcgill.ca/~hallett/Lateral.pdf)