Inapproximability results for the lateral gene transfer problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3701 LNCS, Issue , 2005, Pages 182-195

  DasGupta, Bhaskar ^a   Ferrarini, Sergio ^b   Gopalakrishnan, Uthra ^a   Paryani, Nisha Raj ^a  

^a University of Illinois   (United States)

^b POLITECNICO DI MILANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIO; LATERAL GENE TRANSFER PROBLEM; POLYNOMIAL TIME; SPECIES TREES;

APPROXIMATION THEORY; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

GENE TRANSFER;

EID: 33646180376     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560586_15     Document Type: Conference Paper

References (10)

1. Arora, S., Lund, C., Motwani, R. Sudan, M. and Szegedy M. (1998), Proof verification and hardness of approximation problems. Journal of the ACM, 45(3): 501-555.
2. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti Spaccamela, A., and Protasi, M. (1999), Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties, Springer-Verlag, Berlin.
3. Berman, P., and 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. and Schnitger, G. (1992), On the complexity of approximating the independent set problem, Information and Computation, 96, 77-94.
5. Brown, J. R. (2003), Ancient horizontal gene transfer, Nature Reviews, Genetics, 4, 121-132.
6. th Annual International Conference on Computational Molecular Biology (RECOMB), Montreal, Canada, 141-148.
7. Hallett, M. and Lagergren, J. (2004), Identifying lateral gene transfer events, submitted to SIAM Journal of Computing (available online from http://www.mcb.mcgill.ca/~hallett/Lateral.pdf)
8. Johnson, D.S. (1974), Approximation algorithms for combinatorial problems, Journal of Computer and System Sciences, 9, 256-278.
9. Page, R. D. M. and Charleston, M. A. (1997), From gene to organismal phytogeny: Reconciled tree and the gene tree/ species tree problem, Molecular Phylogentics and Evolution, 7, 231-240.
10. Papadimitriou, C. H. and Yannakakis, M. (1991), Optimization, approximation, and complexity classes, Journal of Computer and System Sciences, 43(3): 425-440.