A. Darling, I. Miklós, and M. Ragan, Dynamics of Genome Rearrangement in Bacterial Populations, PLoS Genetics, vol.3, issue.6, p.1000128, 2008.
DOI : 10.1371/journal.pgen.1000128.s009

U. Dias, Z. Dias, and J. Setubal, A Simulation Tool for the Study of Symmetric Inversions in Bacterial Genomes, Comparative Genomics. Lecture Notes in Computer Science Springer, vol.6398, pp.240-251, 2011.
DOI : 10.1007/978-3-642-16181-0_20

S. Hannenhalli and P. Pevzner, Transforming cabbage into turnip, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing , STOC '95, pp.1-27, 1999.
DOI : 10.1145/225058.225112

J. Eisen, J. Heidelberg, O. White, and S. Salzberg, Evidence for symmetric chromosomal inversions around the replication origin in bacteria

J. Lefebvre, N. El-mabrouk, E. Tillier, and D. Sankoff, Detection and validation of single gene inversions, Bioinformatics, vol.19, issue.Suppl 1, pp.190-196, 2003.
DOI : 10.1093/bioinformatics/btg1025

D. Sankoff, J. Lefebvre, E. Tillier, and N. El-mabrouk, The Distribution of Inversion Lengths in Bacteria, Comparative Genomics. Lecture Notes in Computer Science, vol.3388, pp.97-108, 2005.
DOI : 10.1007/978-3-540-32290-0_8

A. Caprara, Sorting Permutations by Reversals and Eulerian Cycle Decompositions, SIAM Journal on Discrete Mathematics, vol.12, issue.1, pp.91-110, 1999.
DOI : 10.1137/S089548019731994X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.7886

F. Swidan, M. Bender, D. Ge, S. He, H. Hu et al., Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity, Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol.3109, pp.32-46, 2004.
DOI : 10.1007/978-3-540-27801-6_3

T. Arruda, U. Dias, and Z. Dias, Heuristics for the Sorting by Length-Weighted Inversions Problem on Signed Permutations, Algorithms for Computational Biology. Lecture Notes in Computer Science, vol.8542, pp.59-70, 2014.
DOI : 10.1007/978-3-319-07953-0_5

R. Pinter and S. Skiena, Genomic sorting with length-weighted reversals

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

T. Arruda, U. Dias, and Z. Dias, Heuristics for the sorting by length-weighted inversion problem, Proceedings of the International Conference on Bioinformatics, pp.498-507

E. Ohlebusch, M. Abouelhoda, K. Hockel, and J. Stallkamp, The Median Problem for the Reversal Distance in Circular Bacterial Genomes, Proceedings of Combinatorial Pattern Matching 2005, pp.116-127
DOI : 10.1007/11496656_11

Z. Dias, U. Dias, J. Setubal, and L. Heath, Sorting genomes using almostsymmetric inversions, Proceedings of the 27th Symposium On Applied Computing (SAC'2012), Riva del Garda, pp.1-7, 2012.
DOI : 10.1145/2245276.2231993

U. Dias, C. Baudet, and Z. Dias, Greedy Randomized Search Procedure to Sort Genomes using Symmetric, Almost-Symmetric and Unitary Inversions, Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics, BCB'13, pp.181-190
DOI : 10.1145/2506583.2506614
URL : https://hal.archives-ouvertes.fr/hal-00922670

J. Kececioglu and R. Ravi, Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation, Proceedings of the 6th Annual Symposium on Discrete Algorithms, pp.604-613, 1995.