The exemplar breakpoint distance for non-trivial genomes cannot be approximated

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

Volumn 5431 LNCS, Issue , 2009, Pages 357-368

  Blin, Guillaume ^a   Fertin, Guillaume ^b   Sikora, Florian ^a   Vialette, Stéphane ^a  

^a UNIVERSITÉ PARIS EST   (France)

^b UNIVERSITÉ DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE FIELD; APPROXIMATION FACTOR; BREAK-POINTS; BREAKPOINT DISTANCE; COMPARATIVE GENOMICS; DUPLICATED GENES; NON-TRIVIAL; NP COMPLETE;

GENES;

COMPUTATION THEORY;

EID: 67650501286     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00202-1_31     Document Type: Conference Paper

References (9)

1. Alon, N., Yuster, R., Zwick, U.: Color coding. Journal of the ACM 42(4), 844-856 (1995)
2. Angibaud, S., Fertin, G., Rusu, I.: On the approximability of comparing genomes with duplicates. In: Nakano, S.-i., Rahman, M. S. (eds.) WALCOM 2008. LNCS, vol. 4921, pp. 34-45. Springer, Heidelberg (2008)
3. Angibaud, S., Fertin, G., Rusu, I., Thévenin, A., Vialette, S.: A pseudo-boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes. In: Tesler, G., Durand, D. (eds.) RECMOB-CG 2007. LNCS (LNBI), vol. 4751, pp. 16-29. Springer, Heidelberg (2007)
4. Angibaud, S., Fertin, G., Rusu, I., Thévenin, A., Vialette, S.: On the approximability of comparing genomes with duplicates. Journal of Graph Algorithms and Applications, Extended version of [2] (2008), http://www.arxiv.org/abs/0806.1103
5. Blin, G., Chauve, C., Fertin, G., Rizzi, R., Vialette, S.: Comparing genomes with duplications: a computational complexity point of view. ACM/IEEE Trans. Computational Biology and Bioinformatics 14(4), 523-534 (2007)
6. Bryant, D.: The complexity of calculating exemplar distances. In: Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, pp. 207-212. Kluwer Academic Publisher, Dordrecht (2000)
7. Chen, Z., Fu, B., Zhu, B.: The approximability of the exemplar breakpoint distance problem. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 291-302. Springer, Heidelberg (2006)
8. Thach Nguyen, C., Tay, Y.C.: Louxin Zhang. Divide-and-conquer approach for the exemplar breakpoint distance. Bioinformatics 21, 2171-2176 (2005)
9. Sankoff, D.: Genome rearrangement with gene families. Bioinformatics 15(11), 909-917 (1999)