Keyword

sorting permutations

Description: The algorithmic problem of arranging a permutation into a specified order using permitted operations, studied in combinatorics and computer science.

Primary topic: Genome Rearrangement Algorithms (56%)

OpenAlex ID: keywords/sorting-permutations

An (18/11)n upper bound for sorting by prefix reversals

2008 · B. Chitturi, W. Fahle, et al. · Theoretical Computer Science · 55

Sorting by Prefix Transpositions

2002 · Zanoni Dias, João Meidanis · Lecture notes in computer science · 46

A new image encryption algorithm based on cubic fractal matrix and L-LCCML system

2024 · Hongyu Zhao, Shengsheng Wang, et al. · Chaos Solitons & Fractals · 36

Pancake Flipping Is Hard

2012 · Laurent Bulteau, Guillaume Fertin, et al. · Lecture notes in computer science · 34

PDF

The average number of block interchanges needed to sort a permutation and a recent result of Stanley

2009 · Miklós Bóna, Ryan Flynn · Information Processing Letters · 34

PDF

Polynomial-time sortable stacks of burnt pancakes

2010 · Anthony Labarre, Josef Cibulka · Theoretical Computer Science · 19

PDF

On Sorting Permutations by Double-Cut-and-Joins

2010 · Xin Chen · Lecture notes in computer science · 19

Sorting permutations with transpositions in O(n3) amortized time

2018 · Bhadrachalam Chitturi, Priyanshu Das · Theoretical Computer Science · 13

PDF

An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves

2014 · Haitao Jiang, Haodi Feng, et al. · Lecture notes in computer science · 13

Edit Distances and Factorisations of Even Permutations

2008 · Anthony Labarre · Lecture notes in computer science · 13

Sorting permutations with a transposition tree

2019 · Bhadrachalam Chitturi, TS Indulekha · International Conference on Modeling, Simulation, and Applied Optimization · 12

PDF

Rangierkomplexit�t von permutationen

1973 · Hanns -J�rg Sto� · Acta Informatica · 11

Optimal Algorithms for Sorting Permutations with Brooms

2022 · Indulekha Sadanandan, Bhadrachalam Chitturi · Algorithms · 9

PDF

A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions

2020 · Andre Rodrigues Oliveira, Géraldine Jean, et al. · Lecture notes in computer science · 9

Application of permutation to lossless compression of multispectral thematic mapper images

1996 · Ziya Arnavut, Sunil Narumalani · Optical Engineering · 9

Approximation algorithms for sorting permutations by extreme block-interchanges

2021 · Jayakumar Pai, Bhadrachalam Chitturi · Theoretical Computer Science · 8

Permutations and prediction for lossless compression of multispectral TM images

1998 · Z. Arnavut · IEEE Transactions on Geoscience and Remote Sensing · 8

Sorting permutations by prefix and suffix rearrangements

2017 · Carla Negri Lintzmayer, Guillaume Fertin, et al. · Journal of Bioinformatics and Computational Biology · 7

Fast Sorting and Pattern-Avoiding Permutations

2007 · David Arthur · Workshop on Analytic Algorithmics and Combinatorics (ANALCO) · 7

Comparing Algorithms for Sorting with t Stacks in Series

2004 · Rebecca Smith · Annals of Combinatorics · 7

PDF

A new upper bound for sorting permutations with prefix transpositions

2020 · Pramod P. Nair, Rajan Sundaravaradhan, et al. · Discrete Mathematics Algorithms and Applications · 6

An Upper Bound For Sorting Permutations With A Transposition Tree

2020 · Devika K Das, Bhadrachalam Chitturi, et al. · Procedia Computer Science · 6

PDF

Sorting Permutations by Limited-Size Operations

2018 · Guilherme Henrique Santos Miranda, Carla Negri Lintzmayer, et al. · Lecture notes in computer science · 6

Sorting by weighted inversions considering length and symmetry

2015 · Christian Baudet, Ulisses Dias, et al. · BMC Bioinformatics · 6

PDF

Pancake flipping and sorting permutations

2015 · Masud Hasan, Atif Rahman, et al. · Journal of Discrete Algorithms · 6

PDF

Works count: 94

Citation count: 445