H. Dweighter, Elementary problems and solutions, American Mathematical Monthly, vol.82, issue.296, p.2569, 1975.

W. H. Gates and C. H. Papadimitriou, Bounds for sorting by prefix reversal, Discrete Mathematics, vol.27, issue.1, pp.47-57, 1979.
DOI : 10.1016/0012-365X(79)90068-2
URL : http://doi.org/10.1016/0012-365x(79)90068-2

E. Györi and G. Turán, Stack of Pancakes, Studia Scientiarum Mathematicarum Hungarica, vol.13, pp.133-137, 1978.

J. Fischer and S. W. Ginzinger, A 2-Approximation Algorithm for Sorting by Prefix Reversals, Proceedings of the Thirteenth Annual European Symposium on Algorithms (ESA), pp.415-425, 2005.
DOI : 10.1007/11561071_38

D. S. Cohen and M. Blum, On the problem of sorting burnt pancakes, Discrete Applied Mathematics, vol.61, issue.2, pp.105-120, 1995.
DOI : 10.1016/0166-218X(94)00009-3

K. Haynes, M. Broderick, A. Brown, T. Butner, J. Dickson et al., Engineering bacteria to solve the Burnt Pancake Problem, Journal of Biological Engineering, vol.2, issue.1, 2008.
DOI : 10.1186/1754-1611-2-8

S. Lakshmivarahan, J. Jwo, and S. K. , Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey, Parallel Computing, vol.19, issue.4, pp.361-407, 1993.
DOI : 10.1016/0167-8191(93)90054-O

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

S. Hannenhalli and P. A. 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. Labarre, Edit Distances and Factorisations of Even Permutations, Proceedings of the Sixteenth Annual European Symposium on Algorithms (ESA), pp.635-646, 2008.
DOI : 10.1007/978-3-540-87744-8_53
URL : https://hal.archives-ouvertes.fr/hal-00728921

A. Björner and F. Brenti, Combinatorics of Coxeter Groups, of Graduate Texts in Mathematics, chap. 8: Combinatorial Descriptions, 2005.

H. Wielandt, Finite permutation groups, Translated from German by R. Bercov, 1964.

V. Bafna and P. A. Pevzner, Genome rearrangements and sorting by reversals, Proceedings of the Thirty-Fourth Annual Symposium on Foundations of Computer Science (FOCS), pp.148-157, 1993.
DOI : 10.1137/s0097539793250627
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.1352

A. Bergeron, A very elementary presentation of the Hannenhalli???Pevzner theory, Discrete Applied Mathematics, vol.146, issue.2, pp.134-145, 2005.
DOI : 10.1016/j.dam.2004.04.010

S. B. Akers, B. Krishnamurthy, and D. Harel, The Star Graph: An Attractive Alternative to the n-Cube, Proceedings of the Fourth International Conference on Parallel Processing (ICPP), pp.393-400, 1987.

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

E. Tannier and M. Sagot, Sorting by Reversals in Subquadratic Time, Proceedings of the Fifteenth Annual Symposium on Combinatorial Pattern Matching (CPM), pp.1-13, 2004.
DOI : 10.1007/978-3-540-27801-6_1
URL : https://hal.archives-ouvertes.fr/hal-00427659

A. Bergeron, S. Heber, and J. Stoye, Common intervals and sorting by reversals: a marriage of necessity, Bioinformatics, vol.18, issue.Suppl 2, pp.54-63, 2002.
DOI : 10.1093/bioinformatics/18.suppl_2.S54

Y. Han, Improving the Efficiency of Sorting by Reversals, in: Proceedings of The, Bioinformatics and Computational Biology, 2006.

D. A. Bader, B. M. 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

S. Gog and M. Bader, Fast Algorithms for Transforming Back and Forth between a Signed Permutation and Its Equivalent Simple Permutation, Journal of Computational Biology, vol.15, issue.8, pp.1-13, 2008.
DOI : 10.1089/cmb.2008.0040

S. Hannenhalli, P. A. Pevzner, and T. Cut, or Not to Cut (Applications of Comparative Physical Maps in Molecular Evolution, Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

D. E. Knuth, of The art of Computer Programming, Sorting and Searching, vol.3, 1995.

P. Berman, S. Hannenhalli, and M. Karpinski, 375-approximation algorithm for sorting by reversals, Proceedings of the Tenth Annual European Symposium on Algorithms (ESA), pp.200-210, 2002.