S. Hannenhalli and P. Pevzner, Transforming men into mice (polynomial algorithm for genomic distance problem), Proceedings of IEEE 36th Annual Foundations of Computer Science, pp.581-592, 1995.
DOI : 10.1109/SFCS.1995.492588

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

A. Bergeron, A Very Elementary Presentation of the Hannenhalli-Pevzner Theory, Proceedings of the 12th Annual Symposium of the Combinatorial Pattern Matching (CPM'2001), pp.106-117, 2001.
DOI : 10.1007/3-540-48194-X_9

E. Tannier, A. Bergeron, and M. Sagot, Advances on sorting by reversals, Discrete Applied Mathematics, vol.155, issue.6-7, pp.881-888, 2007.
DOI : 10.1016/j.dam.2005.02.033
URL : https://hal.archives-ouvertes.fr/hal-00434657

D. Bader, B. Moret, and M. Yan, A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study, Journal of Computational Biology, vol.8, issue.5, pp.483-491, 2001.
DOI : 10.1089/106652701753216503

K. Swenson, V. Rajan, Y. Lin, and B. Moret, ) Time, Journal of Computational Biology, vol.17, issue.3, pp.489-501, 2010.
DOI : 10.1089/cmb.2009.0184

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

A. Bergeron, J. Mixtacki, and J. Stoye, A new linear time algorithm to compute the genomic distance via the double cut and join distance, Theoretical Computer Science, vol.410, issue.51, pp.5300-5316, 2009.
DOI : 10.1016/j.tcs.2009.09.008

M. Braga and J. Stoye, The Solution Space of Sorting by DCJ Mikí os I, Tannier E: Bayesian sampling of genomic rearrangement scenarios via double cut and join, Journal of Computational Biology Bioinformatics, vol.17, issue.1024, pp.1145-1165, 2010.

A. Siepel, An algorithm to enumerate all sorting reversals, Proceedings of the sixth annual international conference on Computational biology , RECOMB '02, pp.575-597, 2003.
DOI : 10.1145/565196.565233

K. Swenson, G. Badr, and D. Sankoff, Listing all sorting reversals in quadratic time, Algorithms for Molecular Biology, vol.6, issue.1, p.11, 2011.
DOI : 10.1089/cmb.2006.13.1005

T. York, R. Durrett, and R. Nielsen, Bayesian Estimation of the Number of Inversions in the History of Two Chromosomes, Journal of Computational Biology, vol.9, issue.6, pp.805-818, 2002.
DOI : 10.1089/10665270260518281

R. Durrett, R. Nielsen, and T. York, Bayesian Estimation of Genomic Distance Mikí os I: MCMC genome rearrangement, Genetics Bioinformatics, vol.166, issue.19, pp.621-629, 2003.

B. Larget, D. Simon, J. Kadane, and D. Sweet, A Bayesian Analysis of Metazoan Mitochondrial Genome Arrangements, Molecular Biology and Evolution, vol.22, issue.3, pp.486-495, 2005.
DOI : 10.1093/molbev/msi032

B. Larget, J. Kadane, and D. Simon, A Bayesian approach to the estimation of ancestral genome arrangements, Mikí os I, Darling AE: Efficient Sampling of Parsimonious Inversion Histories with Application to Genome Rearrangement in Yersinia, pp.214-223, 2005.
DOI : 10.1016/j.ympev.2005.03.026

A. Bergeron, C. Chauve, T. Hartman, and K. Saint-onge, On the Properties of Sequences of Reversals that Sort a Signed Permutation, Proceedings of the JOBIM 2002, pp.99-108

P. Cartier and D. Foata, Probì emes combinatoires de commutation et réarrangements. No. 85 in Lecture Notes in Mathematics, 1969.

M. Braga, M. Sagot, C. Scornavacca, and E. Tannier, Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.5, issue.3, pp.348-356, 2008.
DOI : 10.1109/TCBB.2008.16
URL : https://hal.archives-ouvertes.fr/hal-00428206

M. Braga, C. Gautier, and M. Sagot, An asymmetric approach to preserve common intervals while sorting by reversals, Algorithms for Molecular Biology, vol.4, issue.1, p.16, 2009.
DOI : 10.1186/1748-7188-4-16
URL : https://hal.archives-ouvertes.fr/hal-00784445

M. Braga, Exploring the Solution Space of Sorting by Reversals When Analyzing Genome Rearrangements, France: Université Lyon, vol.1, 2008.

C. Baudet and Z. Dias, An improved algorithm to enumerate all traces that sort a signed permutation by reversals, Proceedings of the 2010 ACM Symposium on Applied Computing, SAC '10
DOI : 10.1145/1774088.1774416
URL : https://hal.archives-ouvertes.fr/hal-00748579

G. Badr, K. Swenson, and D. Sankoff, Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives, Proceedings of the 8th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG 2010), pp.39-49

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

M. Cáceres, A. Barbadilla, and A. Ruiz, Recombination Rate Predicts Inversion Size in Diptera, Genetics, vol.153, pp.251-259, 1999.

A. Darling, I. Mikí-os, and M. Ragan, Dynamics of Genome Rearrangement in Bacterial Populations, PLoS Genetics, vol.3, issue.6, pp.1-16, 2008.
DOI : 10.1371/journal.pgen.1000128.s009

D. Sankoff, J. Lefebvre, E. Tillier, A. Maler, and N. El-mabrouk, The Distribution of Inversion Lengths in Bacteria, Proceedings of the 2nd Annual RECOMB Satellite Workshop on Comparative Genomics, pp.97-108, 2005.
DOI : 10.1007/978-3-540-32290-0_8

M. Braga, baobabLUNA: the solution space of sorting by reversals, Bioinformatics, vol.25, issue.14, pp.1833-1835, 2009.
DOI : 10.1093/bioinformatics/btp285
URL : https://hal.archives-ouvertes.fr/hal-00539408

K. Swenson, Y. Lin, V. Rajan, and B. Moret, Hurdles Hardly Have to Be Heeded, Proceedings of the International Workshop on Comparative Genomics (RECOMB-CG'08), pp.241-251, 2008.
DOI : 10.1007/978-3-540-87989-3_18