CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS

DOI10.17223/20710410/31/2OpenAlexW2340249005MaRDI QIDQ5150721

A. Yu. Zubov

Publication date: 15 February 2021

Published in: Prikladnaya diskretnaya matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm540

zbMATH Keywords

inversionscircular inversions of permutationsdiameter of permutation groupsorting linear and circular permutations

Mathematics Subject Classification ID

Biology and other natural sciences (92-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting permutations by block-interchanges
• Sorting by insertion of leading elements
• Sorting by bounded block-moves
• Short proofs for cut-and-paste sorting of permutations
• A simpler and faster 1.5-approximation algorithm for sorting by transpositions
• Lower Bounding Edit Distances between Permutations
• Sorting by Transpositions Is Difficult
• Faster algorithms for sorting by transpositions and sorting by block interchanges
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Sorting by Transpositions
• Genome Rearrangements and Sorting by Reversals
• ABOUT SOME CLASSES OF EXTREMAL ORIENTED GRAPHS
• Sorting a bridge hand

This page was built for publication: CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS