Circular inversions of permutations and their use in sorting problems
Prikladnaâ diskretnaâ matematika, no. 1 (2016), pp. 13-31
Voir la notice de l'article provenant de la source Math-Net.Ru
For a permutation sorting, an algorithm based on the circular inversions of the permutation is proposed. Some its applications in molecular biology and in the theory of permutation groups are pointed.
Mots-clés :
inversions, circular inversions of permutations
Keywords: sorting linear and circular permutations, diameter of the permutation group.
Keywords: sorting linear and circular permutations, diameter of the permutation group.
@article{PDM_2016_1_a1,
author = {A. Yu. Zubov},
title = {Circular inversions of permutations and their use in sorting problems},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {13--31},
publisher = {mathdoc},
number = {1},
year = {2016},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2016_1_a1/}
}
A. Yu. Zubov. Circular inversions of permutations and their use in sorting problems. Prikladnaâ diskretnaâ matematika, no. 1 (2016), pp. 13-31. http://geodesic.mathdoc.fr/item/PDM_2016_1_a1/