G. Fertin, A. Labarre, I. Rusu, E. Tannier, and S. Vialette, Combinatorics of genome rearrangements. Computational molecular biology, p.312, 2009.
DOI : 10.7551/mitpress/9780262062824.001.0001
URL : https://hal.archives-ouvertes.fr/hal-00416453

M. Lynch, The Origin of Genome Architecture, 2007.

P. Biller, L. Guéguen, C. Knibbe, and E. Tannier, Breaking good: accounting for the diversity of fragile regions for estimating rearrangement distances

P. Biller, C. Knibbe, G. Beslon, E. Tannier, A. Beckmann et al., Comparative Genomics on Artificial Life, Proceedings of Pursuit of the Universal-12th conference on computability in Europe, CiE 2016, Lecture notes in computer science, pp.35-44, 2016.
DOI : 10.1007/978-3-319-40189-8_4
URL : https://hal.archives-ouvertes.fr/hal-01334930

S. Yancopoulos, O. Attie, and R. Friedberg, Efficient sorting of genomic permutations by translocation, inversion and block interchange, Bioinformatics, vol.21, issue.16, pp.3340-3346, 2005.
DOI : 10.1093/bioinformatics/bti535

C. Baudet, U. Dias, and Z. Dias, Length and symmetry on the sorting by weighted inversions problem Advances in bioinformatics and computational biology -9th Brazilian symposium on bioinformatics, Proceedings Lecture notes in computer scienceBerlin, pp.99-106, 2014.

K. Swenson and M. Blanchette, Models and algorithms for genome rearrangement with positional constraints, Algorithms in bioinformatics-15th international workshop, WABI 2015 Proceedings Lecture notes in computer scienceBerlin, pp.243-56, 2015.
DOI : 10.1186/s13015-016-0065-9
URL : https://hal.archives-ouvertes.fr/lirmm-01348502

N. Alexeev and M. Alekseyev, Estimation of the true evolutionary distance under the fragile breakage model, IEEE 5th international conference on computational advances in Bio and medical sciences, 2015.

L. Bulteau, G. Fertin, and E. Tannier, Genome rearrangements with indels in intergenes restrict the scenario space, BMC Bioinformatics, vol.12, issue.9, pp.225-256, 2016.
DOI : 10.1186/s12859-016-1264-6
URL : https://hal.archives-ouvertes.fr/hal-01396842

G. Fertin, G. Jean, and E. Tannier, Genome Rearrangements on Both Gene Order and Intergenic Regions, Proceedings lecture notes in computer science algorithms in bioinformatics-16th international workshop, WABI 2016, pp.162-173, 2016.
DOI : 10.1007/978-3-319-43681-4_13
URL : https://hal.archives-ouvertes.fr/hal-01334942

M. Garey and D. Johnson, Computers and intractability; a guide to the theory of NP-completeness, 1990.

M. Held and R. Karp, A Dynamic Programming Approach to Sequencing Problems, Journal of the Society for Industrial and Applied Mathematics, vol.10, issue.1, pp.196-210, 1962.
DOI : 10.1137/0110015