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.
@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/}
}
TY  - JOUR
AU  - A. Yu. Zubov
TI  - Circular inversions of permutations and their use in sorting problems
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2016
SP  - 13
EP  - 31
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2016_1_a1/
LA  - ru
ID  - PDM_2016_1_a1
ER  - 
%0 Journal Article
%A A. Yu. Zubov
%T Circular inversions of permutations and their use in sorting problems
%J Prikladnaâ diskretnaâ matematika
%D 2016
%P 13-31
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2016_1_a1/
%G ru
%F 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/