|
This article is cited in 2 scientific papers (total in 2 papers)
Theoretical Foundations of Applied Discrete Mathematics
Circular inversions of permutations and their use in sorting problems
A. Yu. Zubov Lomonosov Moscow State University, Moscow, Russia
Abstract:
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.
Keywords:
inversions, circular inversions of permutations, sorting linear and circular permutations, diameter of the permutation group.
Citation:
A. Yu. Zubov, “Circular inversions of permutations and their use in sorting problems”, Prikl. Diskr. Mat., 2016, no. 1(31), 13–31
Linking options:
https://www.mathnet.ru/eng/pdm540 https://www.mathnet.ru/eng/pdm/y2016/i1/p13
|
Statistics & downloads: |
Abstract page: | 187 | Full-text PDF : | 295 | References: | 52 |
|