Z. Li, L. Wang, and K. Zhang, Algorithmic approaches for genome rearrangement: a review, IEEE Transactions on Systems, Man and Cybernetics, Part C, vol.36, issue.5, pp.636-648, 2006.

J. Kececioglu and D. Sankoff, Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement, Algorithmica, vol.84, issue.4, pp.180-210, 1995.
DOI : 10.1007/BF01188586

D. A. Christie, Sorting permutations by block-interchanges, Information Processing Letters, vol.60, issue.4, pp.165-169, 1996.
DOI : 10.1016/S0020-0190(96)00155-X

V. Bafna and P. A. Pevzner, Sorting by Transpositions, SIAM Journal on Discrete Mathematics, vol.11, issue.2, pp.224-240, 1998.
DOI : 10.1137/S089548019528280X

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.1168

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

I. Elias and T. Hartman, A 1.375-Approximation Algorithm for Sorting by Transpositions, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.3, issue.4, pp.369-379, 2006.
DOI : 10.1109/TCBB.2006.44

URL : https://hal.archives-ouvertes.fr/hal-00662947

S. Lakshmivarahan, J. S. Jwo, and S. K. Dhall, 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

S. B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Transactions on Computers, vol.38, issue.4, pp.555-566, 1989.
DOI : 10.1109/12.21148

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

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, pp.393-400, 1987.

Z. Dias and J. Meidanis, Sorting by Prefix Transpositions, SPIRE 2002, pp.65-76, 2002.
DOI : 10.1007/3-540-45735-6_7

J. P. Doignon and A. Labarre, On Hultman numbers, Journal of Integer Sequences, vol.10, issue.6, p.13, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00728923

B. Chitturi and I. H. Sudborough, Bounding prefix transposition distance for strings and permutations, Proceedings of the Forty-First Annual Hawaii International Conference on System Sciences, p.468, 2008.

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

A. Labarre, New Bounds and Tractable Instances for the Transposition Distance, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.3, issue.4, pp.380-394, 2006.
DOI : 10.1109/TCBB.2006.56

URL : https://hal.archives-ouvertes.fr/hal-00728947

M. R. Jerrum, The complexity of finding minimum-length generator sequences, Theoretical Computer Science, vol.36, issue.2-3, pp.265-289, 1985.
DOI : 10.1016/0304-3975(85)90047-7

V. J. Fortuna, Distâncias de transposição entre genomas, 2005.