Color-coding, Journal of the ACM, vol.42, issue.4, pp.844-856, 1995. ,
DOI : 10.1145/210332.210337
On the Approximability of Comparing Genomes with Duplicates, Proc. 2nd Workshop on Algorithms and Computation, pp.34-45, 2008. ,
DOI : 10.1007/978-3-540-77891-2_4
URL : https://hal.archives-ouvertes.fr/hal-00159893
A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes, Proc. 5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG), pp.16-29, 2007. ,
DOI : 10.1007/978-3-540-74960-8_2
URL : https://hal.archives-ouvertes.fr/hal-00417902
On the approximability of comparing genomes with duplicates Extended version of, Journal of Graph Algorithms and Applications, issue.2, 2008. ,
Comparing Genomes with Duplications: A Computational Complexity Point of View, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.4, issue.4, pp.523-534, 2007. ,
DOI : 10.1109/TCBB.2007.1069
URL : https://hal.archives-ouvertes.fr/hal-00417720
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, 2000. ,
The Approximability of the Exemplar Breakpoint Distance Problem, 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM), pp.291-302, 2006. ,
DOI : 10.1007/11775096_27
Divide-and-conquer approach for the exemplar breakpoint distance, Bioinformatics, vol.21, issue.10, pp.2171-2176, 2005. ,
DOI : 10.1093/bioinformatics/bti327
Genome rearrangement with gene families, Bioinformatics, vol.15, issue.11, pp.909-917, 1999. ,
DOI : 10.1093/bioinformatics/15.11.909
URL : http://bioinformatics.oxfordjournals.org/cgi/content/short/15/11/909