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
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
Sorting permutations by transpositions, SODA, pp.614-623, 1995. ,
Sorting by Transpositions, SIAM Journal on Discrete Mathematics, vol.11, issue.2, pp.224-240, 1998. ,
DOI : 10.1137/S089548019528280X
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
Algorithmic Aspects of Some Combinatorial Problems in Bioinformatics, 2006. ,
Bounding prefix transposition distance for strings and permutations, HICSS, p.468, 2008. ,
Sorting permutations by block-interchanges, Information Processing Letters, vol.60, issue.4, pp.165-169, 1996. ,
DOI : 10.1016/S0020-0190(96)00155-X
Genome Rearrangement Problems, 1998. ,
Sorting Strings by Reversals and by Transpositions, SIAM Journal on Discrete Mathematics, vol.14, issue.2, pp.193-206, 2001. ,
DOI : 10.1137/S0895480197331995
The string edit distance matching problem with moves, SODA, pp.667-676, 2002. ,
DOI : 10.1145/1186810.1186812
Sorting by Prefix Transpositions, Lecture Notes in Computer Science, vol.2476, pp.65-76, 2002. ,
DOI : 10.1007/3-540-45735-6_7
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
Sorting a bridge hand, Discrete Mathematics, vol.241, issue.1-3, pp.289-300, 2001. ,
DOI : 10.1016/S0012-365X(01)00150-9
Faster algorithms for sorting by transpositions and sorting by block interchanges, ACM Transactions on Algorithms, vol.3, issue.3, 2007. ,
Combinatorics of genome rearrangements, 2009. ,
DOI : 10.7551/mitpress/9780262062824.001.0001
URL : https://hal.archives-ouvertes.fr/hal-00416453
Sorting permutations and its applications in genome analysis, Lectures on Mathematics in the Life Science, vol.26, pp.191-201, 1999. ,
Subsequence and run heuristics for sorting by transpositions, 1997. ,
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
Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set, Lecture Notes in Computer Science, vol.4368, pp.279-289, 2006. ,
DOI : 10.1007/11970125_22
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
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
Combinatorial Algorithms of Genome Rearrangements in Bioinformatics, 2006. ,
Reversals and Transpositions Over Finite Alphabets, SIAM Journal on Discrete Mathematics, vol.19, issue.1, pp.224-244, 2005. ,
DOI : 10.1137/S0895480103433550
Edit Distance with Move Operations, Lecture Notes in Computer Science, vol.2373, pp.85-98, 2002. ,
DOI : 10.1007/3-540-45452-7_9