A. Amir, Y. Aumann, G. Benson, A. Levy, O. Lipsky et al., Pattern matching with address errors, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.359-370, 2009.
DOI : 10.1145/1109557.1109692

A. Amir, Y. Aumann, P. Indyk, A. Levy, and E. Porat, Efficient Computations of ???1 and ???????????? Rearrangement Distances, Lecture Notes in Computer Science, vol.4726, pp.39-49, 2007.
DOI : 10.1007/978-3-540-75530-2_4

V. Bafna and P. A. Pevzner, Sorting permutations by transpositions, SODA, pp.614-623, 1995.

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

M. Beno??tbeno??t-gagné and S. Hamel, A New and Faster Method of Sorting by Transpositions, Lecture Notes in Computer Science, vol.4580, pp.131-141, 2007.
DOI : 10.1007/978-3-540-73437-6_15

D. Bongartz, Algorithmic Aspects of Some Combinatorial Problems in Bioinformatics, 2006.

L. Bulteau, G. Fertin, and I. Rusu, Sorting by Transpositions Is Difficult, Lecture Notes in Computer Science, vol.19, issue.4, pp.654-665, 2011.
DOI : 10.1007/3-540-45452-7_9
URL : https://hal.archives-ouvertes.fr/hal-00606223

B. Chitturi and I. H. Sudborough, Bounding Prefix Transposition Distance for Strings and Permutations, Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008), p.468, 2008.
DOI : 10.1109/HICSS.2008.75

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

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

D. A. Christie and R. W. Irving, Sorting Strings by Reversals and by Transpositions, SIAM Journal on Discrete Mathematics, vol.14, issue.2, pp.193-206, 2001.
DOI : 10.1137/S0895480197331995

G. Cormode and S. Muthukrishnan, The string edit distance matching problem with moves, SODA, pp.667-676, 2002.
DOI : 10.1145/1186810.1186812

Z. Dias and J. Meidanis, Sorting by Prefix Transpositions, Lecture Notes in Computer Science, vol.2476, pp.65-76, 2002.
DOI : 10.1007/3-540-45735-6_7

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

H. Eriksson, K. Eriksson, J. Karlander, L. J. 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

J. Feng and D. Zhu, Faster algorithms for sorting by transpositions and sorting by block interchanges, ACM Transactions on Algorithms, vol.3, issue.3, 2007.

G. Fertin, A. Labarre, I. Rusu, ´. E. Tannier, and S. Vialette, Combinatorics of genome rearrangements, 2009.
DOI : 10.7551/mitpress/9780262062824.001.0001
URL : https://hal.archives-ouvertes.fr/hal-00416453

Q. Gu, S. Peng, and Q. M. Chen, Sorting permutations and its applications in genome analysis, Lectures on Mathematics in the Life Science, vol.26, pp.191-201, 1999.

S. A. Guyer, L. S. Heath, and J. P. Vergara, Subsequence and run heuristics for sorting by transpositions, 1997.

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

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

A. Labarre, Edit Distances and Factorisations of Even Permutations, ESA, pp.635-646, 2008.
DOI : 10.1007/978-3-540-87744-8_53
URL : https://hal.archives-ouvertes.fr/hal-00728921

P. A. Pevzner and M. S. Waterman, Open combinatorial problems in computational molecular biology, Proceedings Third Israel Symposium on the Theory of Computing and Systems, pp.158-173, 1995.
DOI : 10.1109/ISTCS.1995.377035

X. Qi, Combinatorial Algorithms of Genome Rearrangements in Bioinformatics, 2006.

A. J. Radcliffe, A. D. Scott, and A. L. Wilmer, Reversals and Transpositions Over Finite Alphabets, SIAM Journal on Discrete Mathematics, vol.19, issue.1, pp.224-244, 2005.
DOI : 10.1137/S0895480103433550
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.594

D. Shapira and J. A. Storer, Edit Distance with Move Operations, Lecture Notes in Computer Science, vol.2373, pp.85-98, 2002.
DOI : 10.1007/3-540-45452-7_9