A. Bender, D. Ge, S. He, H. Hu, R. Y. Pinter et al., Improved bounds on sorting by length-weighted reversals, Journal of Computer and System Sciences, vol.74, issue.5, pp.744-774, 2008.
DOI : 10.1016/j.jcss.2007.08.008
URL : https://doi.org/10.1016/j.jcss.2007.08.008

A. Bergeron, J. Mixtacki, and J. Stoye, A Unifying View of Genome Rearrangements, pp.163-173, 2006.
DOI : 10.1007/11851561_16
URL : http://www2.lifl.fr/SEQUOIA/MRI/20092010/articles/DCJBergeron.pdf

T. Blanchette, D. Kunisawa, and . Sanko, Parametric genome rearrangement, Gene, vol.172, issue.1, pp.11-17, 1996.
DOI : 10.1016/0378-1119(95)00878-0
URL : http://www.cs.washington.edu/homes/blanchem/papers/GeneCombis/parametric.pdf

A. Caprara, Sorting by reversals is dicult, Proceedings of the First Annual International Conference on Computational Molecular Biology, RECOMB '97, pp.75-83, 1997.
DOI : 10.1145/267521.267531

A. Caprara, A. Panconesi, and R. Rizzi, Packing cycles in undirected graphs, Journal of Algorithms, vol.48, issue.1, pp.239-256, 2003.
DOI : 10.1016/S0196-6774(03)00052-X
URL : http://www.dimi.uniud.it/~rrizzi/papers/ps/cyc_rev.ps

R. Galvão and Z. Dias, Approximation algorithms for sorting by signed short reversals, Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics, BCB '14
DOI : 10.1145/2649387.2649413

. Holyer, The NP-Completeness of Some Edge-Partition Problems, SIAM Journal on Computing, vol.10, issue.4, pp.713-717, 1981.
DOI : 10.1137/0210054
URL : http://www.cs.bris.ac.uk/~ian/graphs/part.pdf

-. Lefebvre, N. El-mabrouk, E. R. Tillier, and D. Sanko, Detection and validation of single gene inversions, Proc. 11th Int'l Conf. on Intelligent Systems for Mol. Biol. (ISMB'03), pp.190-196, 2003.
DOI : 10.1093/bioinformatics/btg1025
URL : https://academic.oup.com/bioinformatics/article-pdf/19/suppl_1/i190/614912/btg1025.pdf

F. Local-genome-rearrangements-john-stamatoyannopoulos, L. A. Mirny, E. S. Lander, and J. Dekker, Comprehensive mapping of long-range interactions reveals folding principles of the human genome, Science, issue.5950, pp.326289-293, 2009.

H. Park and C. Jun, A simple and fast algorithm for K-medoids clustering, Expert Systems with Applications, vol.36, issue.2, pp.3336-3341, 2009.
DOI : 10.1016/j.eswa.2008.01.039

Y. Pinter and S. Skiena, Genomic sorting with length-weighted reversals, Genome Informatics, vol.13, pp.103-111, 2002.

S. Pulicani, P. Simonaitis, and K. M. Swenson, Rearrangement scenarios guided by chromatin structure, 2017.
DOI : 10.1101/137323
URL : https://hal.archives-ouvertes.fr/hal-01791974

T. Sexton, E. Yae, E. Kenigsberg, F. Bantignies, B. Leblanc et al., Three-Dimensional Folding and Functional Organization Principles of the Drosophila Genome, Cell, vol.148, issue.3, pp.458-472, 2012.
DOI : 10.1016/j.cell.2012.01.010
URL : https://doi.org/10.1016/j.cell.2012.01.010

M. Krister, P. Swenson, M. Simonaitis, and . Blanchette, Models and algorithms for genome rearrangement with positional constraints, Algorithms for Molecular Biology, vol.11, issue.1, p.13, 2016.

O. Yancopoulos, R. Attie, and . Friedberg, Efficient sorting of genomic permutations by translocation, inversion and block interchange, Bioinformatics, vol.99, issue.7, pp.3340-3346, 2005.
DOI : 10.1016/0022-5193(82)90384-8
URL : https://academic.oup.com/bioinformatics/article-pdf/21/16/3340/571439/bti535.pdf