S. Angibaud, G. Fertin, I. Rusu, A. Thévenin, and S. , 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, pp.1093-1115, 2008.
DOI : 10.1089/cmb.2008.0061
URL : https://hal.archives-ouvertes.fr/hal-00416446

S. Angibaud, G. Fertin, I. Rusu, A. Thévenin, and S. , On the Approximability of Comparing Genomes with Duplicates, Journal of Graph Algorithms and Applications, vol.13, issue.1, pp.19-53, 2009.
DOI : 10.7155/jgaa.00175
URL : https://hal.archives-ouvertes.fr/hal-00159893

A. Bergeron, C. Chauve, F. De-montgolfier, and M. , Permutations, with Applications to Modular Decomposition of Graphs, SIAM Journal on Discrete Mathematics, vol.22, issue.3, pp.1022-1039, 2008.
DOI : 10.1137/060651331
URL : https://hal.archives-ouvertes.fr/hal-00159580

A. Bergeron and J. , On the Similarity of Sets of Permutations and Its Applications to Genome Comparison, Journal of Computational Biology, vol.13, issue.7, pp.1340-1354, 2006.
DOI : 10.1089/cmb.2006.13.1340

X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong et al., Assignment of Orthologous Genes via Genome Rearrangement, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.2, issue.4, pp.302-315, 2005.
DOI : 10.1109/TCBB.2005.48

G. Fertin, A. Labarre, I. Rusu, E. Tannier, and S. , Vialette -Combinatorics of Genome Rearrangements, 2009.

H. N. Gabow and R. E. , A linear-time algorithm for a special case of disjoint set union, Journal of Computer and System Sciences, vol.30, issue.2, pp.209-221, 1985.
DOI : 10.1016/0022-0000(85)90014-5

A. Goldstein, P. Kolman, and J. , Zheng -Minimum Common String Partition Problem: Hardness and Approximations, The Electronic Journal of Combinatorics, vol.12, issue.1, p.50, 2005.

P. Kolman and T. , Wale´nWale´n -Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set, The Electronic Journal of Combinatorics, vol.14, issue.1, p.50, 2007.

R. Raz and S. , Safra -A sub-constant error-probability low-degree test, and subconstant error-probability PCP characterization of NP, Proceedings of STOC 97, pp.475-484, 1997.

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

T. Schmidt and J. , Stoye -Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences, Proceedings of CPM 2004, pp.347-358, 2004.