P. Alimonti and V. Kann, Some APX-completeness results for cubic graphs, Theoretical Computer Science, vol.237, issue.1-2, pp.123-134, 2000.
DOI : 10.1016/S0304-3975(98)00158-3

S. Angibaud, G. Fertin, I. Rusu, A. Thévenin, and S. Vialette, Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes, Journal of Computational Biology, vol.15, issue.8, 2008.
DOI : 10.1089/cmb.2008.0061
URL : https://hal.archives-ouvertes.fr/hal-00416446

S. Angibaud, G. Fertin, I. Rusu, and S. Vialette, A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates, Journal of Computational Biology, vol.14, issue.4, pp.379-393, 2007.
DOI : 10.1089/cmb.2007.A001

V. Bafna and P. Pevzner, Sorting by reversals: genome rearrangements in plant organelles and evolutionary history of X chromosome, Molecular Biology and Evolution, pp.239-246, 1995.

P. Berman and T. Fujito, Approximating independent sets in degree 3 graphs, Proc. 4th Workshop on Algorithms and Data Structures, pp.449-460, 1995.

G. Blin and R. Rizzi, Conserved Interval Distance Computation Between Non-trivial Genomes, Proc. COCOON 2005, pp.22-31, 2005.
DOI : 10.1007/11533719_5
URL : https://hal.archives-ouvertes.fr/hal-00620353

D. Bryant, The Complexity of Calculating Exemplar Distances, Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignement, and the Evolution of Gene Families, pp.207-212, 2000.
DOI : 10.1007/978-94-011-4309-7_19

M. Chang and F. Wang, Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs, Information Processing Letters, vol.43, issue.6, pp.293-295, 1992.
DOI : 10.1016/0020-0190(92)90114-B

M. Charikar, K. Makarychev, and Y. Makarychev, Near-optimal algorithms for maximum constraint satisfaction problems, SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp.62-68, 2007.
DOI : 10.1145/1541885.1541893

C. Chauve, G. Fertin, R. Rizzi, and S. Vialette, Genomes Containing Duplicates Are Hard to Compare, Proc. IWBRA 2006, pp.783-790, 2006.
DOI : 10.1007/11758525_105
URL : https://hal.archives-ouvertes.fr/hal-00418260

Z. Chen, R. Fowler, B. Fu, and B. Zhu, Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes, Proc COCOON 2006, pp.245-254, 2006.
DOI : 10.1007/11809678_27

Z. Chen, B. Fu, J. Xu, B. Yang, Z. Zhao et al., Non-breaking Similarity of Genomes with Gene Repetitions, Proc. CPM, pp.119-130, 2007.
DOI : 10.1007/978-3-540-73437-6_14

Z. Chen, B. Fu, and B. Zhu, The Approximability of the Exemplar Breakpoint Distance Problem, Proc. AAIM 2006, pp.291-302, 2006.
DOI : 10.1007/11775096_27

M. Crochemore, D. Hermelin, G. M. Landau, and S. Vialette, Approximating the 2-interval pattern problem, Proc. ESA 2005, pp.426-437, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00619979

H. Fernau, Parameterized algorithms: A graph-theoretic approach, 2005.

M. R. Garey and D. S. Johnson, Computers and Intractability: a guide to the theory of NP-completeness, 1979.

A. Goldstein, P. Kolman, and Z. Zheng, Minimum Common String Partition Problem: Hardness and Approximations, Proc. ISAAC 2004, pp.473-484, 2004.
DOI : 10.1007/978-3-540-30551-4_43

M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, 1980.

P. Kolman and T. Wale´nwale´n, Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set, Proc. WAOA 2006, pp.279-289, 2006.
DOI : 10.1007/11970125_22

W. Li, Z. Gu, H. Wang, and A. Nekrutenko, Evolutionary analyses of the human genome, Nature, vol.12, issue.6822, pp.847-849, 2001.
DOI : 10.1038/35057039

M. Marron, K. M. Swenson, and B. M. Moret, Genomic Distances under Deletions and Insertions, Theoretical Computer Science, vol.325, issue.3, pp.347-360, 2004.
DOI : 10.1016/j.tcs.2004.02.039

C. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, Journal of Computer and System Sciences, vol.43, issue.3, pp.425-440, 1991.
DOI : 10.1016/0022-0000(91)90023-X

D. Sankoff, Genome rearrangement with gene families, Bioinformatics, vol.15, issue.11, pp.909-917, 1999.
DOI : 10.1093/bioinformatics/15.11.909

D. Sankoff and L. Haque, Power Boosts for Cluster Tests, Proc. RECOMB-CG 2005, pp.121-130, 2005.
DOI : 10.1007/11554714_11

J. Tang and B. M. Moret, Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content, Proc. WADS 2003, pp.37-46, 2003.
DOI : 10.1007/978-3-540-45078-8_4