CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS

被引:1
|
作者
Zubov, A. Yu. [1 ]
机构
[1] Lomonosov Moscow State Univ, Moscow, Russia
来源
PRIKLADNAYA DISKRETNAYA MATEMATIKA | 2016年 / 31卷 / 01期
关键词
inversions; circular inversions of permutations; sorting linear and circular permutations; diameter of the permutation group;
D O I
10.17223/20710410/31/2
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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.
引用
收藏
页码:13 / 31
页数:19
相关论文
共 50 条
  • [41] Sorting Permutations with Fixed Pinnacle Set
    Rusu, Irena
    ELECTRONIC JOURNAL OF COMBINATORICS, 2020, 27 (03): : 1 - 22
  • [42] Approximation Algorithms for Sorting λ-Permutations by λ-Operations
    Miranda, Guilherme Henrique Santos
    Alexandrino, Alexsandro Oliveira
    Lintzmayer, Carla Negri
    Dias, Zanoni
    ALGORITHMS, 2021, 14 (06)
  • [43] Compression, enumeration and indexing of permutations and sorting
    Kawahara, Jun
    Minato, Shin-Ichi
    Journal of the Institute of Electronics, Information and Communication Engineers, 2014, 97 (12): : 1086 - 1090
  • [44] Sorting signed permutations by short operations
    Gustavo Rodrigues Galvão
    Orlando Lee
    Zanoni Dias
    Algorithms for Molecular Biology, 10
  • [45] Sorting signed permutations by reversals, revisited
    Kaplan, H
    Verbin, E
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2005, 70 (03) : 321 - 341
  • [46] Sorting permutations by block-interchanges
    Christie, DA
    INFORMATION PROCESSING LETTERS, 1996, 60 (04) : 165 - 169
  • [47] Sorting signed permutations by short operations
    Galvao, Gustavo Rodrigues
    Lee, Orlando
    Dias, Zanoni
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2015, 10
  • [48] Sorting permutations by prefix and suffix rearrangements
    Lintzmayer, Carla Negri
    Fertin, Guillaume
    Dias, Zanoni
    JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 2017, 15 (01)
  • [49] Sorting permutations by block-interchanges
    Univ of Glasgow, Glasgow, United Kingdom
    Inf Process Lett, 4 (165-169):
  • [50] Sorting by weighted inversions considering length and symmetry
    Christian Baudet
    Ulisses Dias
    Zanoni Dias
    BMC Bioinformatics, 16