A. Amir and A. Levy, String rearrangement metrics: A survey, Algorithms and Applications, pp.1-33, 2010.

Y. Anselmetti, W. Duchemin, E. Tannier, C. Chauve, and S. Bérard, Phylogenetic signal from rearrangements in 18 Anopheles species by joint scaffolding extant and ancestral genomes, BMC genomics, vol.19, issue.2, p.96, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01791884

Y. Anselmetti, N. Luhmann, S. Bérard, E. Tannier, and C. Chauve, Comparative Methods for Reconstructing Ancient Genome Organization, Comparative Genomics, pp.343-362, 2018.

P. Avdeyev, N. Alexeev, Y. Rong, and M. A. , A unified ILP framework for genome median, halving, and aliquoting problems under DCJ, RECOMB International Workshop on Comparative Genomics, pp.156-178, 2017.

V. Bafna and P. A. Pevzner, Genome rearrangements and sorting by reversals, SIAM Journal on Computing, vol.25, issue.2, pp.272-289, 1996.

Y. Baryshnikov, On Stokes sets, New developments in singularity theory, pp.65-86, 2001.

C. Baudet, U. Dias, and Z. Dias, Sorting by weighted inversions considering length and symmetry, BMC bioinformatics, vol.16, issue.19, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01316998

S. Bérard, A. Chateau, C. Chauve, C. Paul, and E. Tannier, Computation of perfect DCJ rearrangement scenarios with linear and circular chromosomes, Journal of Computational Biology, vol.16, issue.10, pp.1287-1309, 2009.

A. Bergeron, J. Mixtacki, and J. Stoye, A unifying view of genome rearrangements, International Workshop on Algorithms in Bioinformatics, pp.163-173, 2006.

C. Berthelot, M. Muffato, J. Abecassis, and H. R. Crollius, The 3D organization of chromatin explains evolutionary fragile genomic regions, Cell reports, vol.10, issue.11, pp.1913-1924, 2015.

D. Bienstock and O. Günlük, A degree sequence problem related to network design, Networks, vol.24, issue.4, pp.195-205, 1994.

P. Biller, C. Knibbe, L. Guéguen, and E. Tannier, Breaking good: accounting for the diversity of fragile regions for estimating rearrangement distances, Genome Biol Evol, vol.8, pp.1427-1466, 2016.

M. Blanchette, T. Kunisawa, and D. Sankoff, Parametric genome rearrangement, Gene, vol.172, issue.1, pp.11-17, 1996.

L. Bulteau, G. Fertin, and E. Tannier, Genome rearrangements with indels in intergenes restrict the scenario space, BMC bioinformatics, vol.17, issue.14, p.426, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01396842

A. Caprara, Sorting permutations by reversals and Eulerian cycle decompositions, SIAM journal on discrete mathematics, vol.12, issue.1, pp.91-110, 1999.

M. J. Chaisson, A. D. Sanders, X. Zhao, A. Malhotra, D. Porubsky et al., Multi-platform discovery of haplotype-resolved structural variation in human genomes, Nature communications, vol.10, 2019.

P. E. Compeau, A generalized cost model for DCJ-indel sorting, International Workshop on Algorithms in Bioinformatics, pp.38-51, 2014.

F. Farnoud and O. Milenkovic, Sorting of permutations by cost-constrained transpositions, IEEE Transactions on Information Theory, vol.58, issue.1, pp.3-23, 2012.

T. Feder, A. Guetz, M. Mihail, and A. Saberi, A local switch Markov chain on given degree graphs with application in connectivity of peer-to-peer networks, Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium on, pp.69-76, 2006.

G. Fertin, G. Jean, and E. Tannier, Algorithms for computing the double cut and join distance on both gene order and intergenic sizes, Algorithms for Molecular Biology, vol.12, issue.1, p.16, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01533200

B. K. Fosdick, D. B. Larremore, J. Nishimura, and J. Ugander, Configuring random graph models with fixed degree sequences, SIAM Review, vol.60, issue.2, pp.315-355, 2018.

G. Fudenberg and K. S. Pollard, Chromatin features constrain structural variation across evolutionary timescales, Proceedings of the National Academy of Sciences, vol.116, 2019.