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
The star graph: An attractive alternative to the n-cube, Proceedings of the Fourth International Conference on Parallel Processing, pp.393-400, 1987. ,
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
Sorting by Transpositions Is Difficult, Proceedings of the Thirty-Eighth International Colloquium on Automata, Languages and Programming (ICALP), L. Aceto, M. Henzinger, pp.654-665, 2011. ,
DOI : 10.1007/3-540-45452-7_9
URL : https://hal.archives-ouvertes.fr/hal-00606223
Pancake Flipping is Hard, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-01053461
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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.7886
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
Sorting permutations by block-interchanges, Information Processing Letters, vol.60, issue.4, pp.165-169, 1996. ,
DOI : 10.1016/S0020-0190(96)00155-X
Sorting by Prefix Transpositions, Proceedings of the Ninth International Symposium on String Processing and Information, pp.65-76, 2002. ,
DOI : 10.1007/3-540-45735-6_7
On Hultman numbers, Journal of Integer Sequences, vol.10, pp.13-20, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00728923
Sorting a bridge hand, Discrete Mathematics, vol.241, issue.1-3, pp.289-300, 2001. ,
DOI : 10.1016/S0012-365X(01)00150-9
Distâncias de transposição entre genomas, Master's thesis, 2005. ,
Rearrangement distance database, 2011. ,
Bounds for sorting by prefix reversal, Discrete Mathematics, vol.27, issue.1, pp.47-57, 1979. ,
DOI : 10.1016/0012-365X(79)90068-2
Stack of pancakes, Studia Scientiarum Mathematicarum Hungarica, vol.13, pp.133-137, 1978. ,
Toric permutations, Master's thesis, 1999. ,
The complexity of finding minimum-length generator sequences, Theoretical Computer Science, vol.36, pp.265-289, 1985. ,
DOI : 10.1016/0304-3975(85)90047-7
Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement , Algorithmica, pp.180-210, 1995. ,
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
Combinatorial aspects of genome rearrangements and haplotype networks, 2008. ,
URL : https://hal.archives-ouvertes.fr/tel-00482196
Edit Distances and Factorisations of Even Permutations, Proceedings of the Sixteenth Annual European Symposium on Algorithms (ESA), pp.635-646, 2008. ,
DOI : 10.1007/978-3-540-87744-8_53
URL : https://hal.archives-ouvertes.fr/hal-00728921
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
Sorting by Reversals in Subquadratic Time, Proceedings of the Fifteenth Annual Symposium on Combinatorial Pattern Matching, pp.1-13, 2004. ,
DOI : 10.1007/978-3-540-27801-6_1
URL : https://hal.archives-ouvertes.fr/hal-00427659
Finite permutation groups, Translated from German by R. Bercov, 1964. ,