J. Meidanis and J. Setubal, Introduction to Computational Molecular Biology, 1997.

P. A. Pevzner, Computational molecular biology, 2000.

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

I. Elias and T. Hartman, A 1.375?Approximation Algorithm for Sorting by Transpositions, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00662947

D. A. Christie, Genome Rearrangement Problems, 1998.

T. Hartman, A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions, Lecture Notes in Computer Science, vol.2676, pp.156-169, 2003.
DOI : 10.1007/3-540-44888-8_12

S. A. Guyer, L. S. Heath, and J. P. Vergara, Subsequence and run heuristics for sorting by transpositions, Fourth DIMACS Algorithm Implementation Challenge, 1995.

J. P. Vergara, Sorting by Bounded Permutations, 1997.

M. E. Walter, L. R. Curado, and A. G. Oliveira, Working on the Problem of Sorting by Transpositions on Genome Rearrangements, Combinatorial pattern matching, pp.372-383, 2003.
DOI : 10.1007/3-540-44888-8_27

Z. Dias and J. Meidanis, An Alternative Algebraic Formalism for Genome Rearrangements, Comparative Genomics, pp.213-223, 2000.

Z. Dias and J. Meidanis, Genome rearrangements distance by fusion, fission, and transposition is easy, Proceedings Eighth Symposium on String Processing and Information Retrieval, pp.250-253, 2001.
DOI : 10.1109/SPIRE.2001.989776

Z. Dias, J. Meidanis, and M. E. Walter, A New Approach for Approximating The Transposition Distance, Proceedings of SPIRE'2000 -String Processing and Information Retrieval, 2000.

H. Eriksson, K. Eriksson, J. Karlander, L. Svensson, and J. Wästlund, Sorting a bridge hand, Discrete Mathematics, vol.241, issue.1-3, pp.289-300, 2001.
DOI : 10.1016/S0012-365X(01)00150-9

A. Hultman, Toric Permutations Master's thesis, Dept. of Mathematics, KTH, 1999.