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, pp.1093-1115, 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

A. Bergeron and J. Stoye, On the similarity of sets of permutations and its applications to genome comparison, Proc. 9th International Computing and Combinatorics Conference (COCOON '03), volume 2697 of LNCS, pp.68-79, 2003.

N. Eén and N. Sörensson, Translating pseudo-boolean constraints into SAT, Journal on Satisfiability Boolean Modeling and Computation, vol.2, pp.1-26, 2006.

Z. Fu and T. Jiang, COMPUTING THE BREAKPOINT DISTANCE BETWEEN PARTIALLY ORDERED GENOMES, Journal of Bioinformatics and Computational Biology, vol.05, issue.05, pp.1087-1101, 2007.
DOI : 10.1142/S0219720007003107

A. Schrijver, Theory of Linear and Integer Programming, J. Wiley & Sons, 1998.

T. Uno and M. Yagiura, Fast Algorithms to Enumerate All Common Intervals of Two Permutations, Algorithmica, vol.26, issue.2, pp.290-309, 2000.
DOI : 10.1007/s004539910014

G. A. Watterson, W. J. Ewens, T. E. Hall, and A. Morgan, The chromosome inversion problem, Journal of Theoretical Biology, vol.99, issue.1, pp.1-7, 1982.
DOI : 10.1016/0022-5193(82)90384-8

C. Zheng, A. Lenert, and D. Sankoff, Reversal distance for partially ordered genomes, Bioinformatics, vol.21, issue.Suppl 1, pp.502-508, 2005.
DOI : 10.1093/bioinformatics/bti1037