This article is cited 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.

UDC: 51.76+577.21+512.542.7

DOI: 10.17223/20710410/31/2

Bibliographic databases:

•