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 permutations by transpositions, Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.614-623, 1995.

D. A. Christie, Genome rearrangement problems, 1998.

T. Hartman and R. Shamir, A simpler and faster 1.5-approximation algorithm for sorting by transpositions, Information and Computation, vol.204, issue.2, pp.275-290, 2006.
DOI : 10.1016/j.ic.2005.09.002

I. Elias and T. Hartman, A 1.375-approximation algorithm for sorting by transpositions, Proceedings of the Fifth Workshop on Algorithms in Bioinformatics, pp.204-214, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00662947

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, Proceedings of the Fourteenth Annual Symposium on Combinatorial Pattern Matching
DOI : 10.1007/3-540-44888-8_27

Z. Dias and J. Meidanis, An alternative algebraic formalism for genome rearrangements Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and the Evolution of, Gene Families, vol.1, pp.213-223, 2000.

A. Labarre, A New Tight Upper Bound on the Transposition Distance, Proceedings of the Fifth Workshop on Algorithms in Bioinformatics, pp.216-227, 2005.
DOI : 10.1007/11557067_18
URL : https://hal.archives-ouvertes.fr/hal-00728796

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.

Z. Dias, J. Meidanis, and M. E. Walter, A new approach for approximating the transposition distance, Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, pp.199-208, 2000.

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

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