Keyword

permutation sorting

Description: The study of transforming permutations into sorted order using operations such as swaps, reversals, or transpositions, including algorithmic and combinatorial analysis.

Primary topic: Genome Rearrangement Algorithms (52%)

OpenAlex ID: keywords/permutation-sorting

Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement

1995 · J. Kececioglu, D. Sankoff · Algorithmica · 308

Bounds for sorting by prefix reversal

1979 · William H. Gates, Christos H. Papadimitriou · Discrete Mathematics · 296

Sorting permutations by block-interchanges

1996 · David A. Christie · Information Processing Letters · 162

1.375-Approximation Algorithm for Sorting by Reversals

2002 · Piotr Berman, Sridhar Hannenhalli, et al. · Lecture notes in computer science · 156

On the Diameter of the Pancake Network

1997 · Mohammad H. Heydari, I.Hal Sudborough · Journal of Algorithms · 115

2N Noncollinear points determine at least 2N directions

1982 · Peter Ungar · Journal of Combinatorial Theory Series A · 110

PDF

Sorting a bridge hand

2001 · Henrik Eriksson, Kimmo Eriksson, et al. · Discrete Mathematics · 93

PDF

The minimum-length generator sequence problem is NP-hard

1981 · S Even, O Goldreich · Journal of Algorithms · 88

Exact and approximation algorithms for the inversion distance between two chromosomes

2005 · John Kececioglu, David Sankoff · Springer eBooks · 82

Not So Perfect Graphs

2004 · Martin Charles Golumbic · Annals of discrete mathematics · 73

A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions

2003 · Tzvika Hartman · Lecture notes in computer science · 71

(1+ε)-Approximation of sorting by reversals and transpositions

2002 · Niklas Eriksen · Theoretical Computer Science · 67

A simpler and faster 1.5-approximation algorithm for sorting by transpositions

2005 · Tzvika Hartman, Ron Shamir · Information and Computation · 63

A Lemma and a Conjecture on the Cost of Rearrangements

2003 · Bressan, Alberto · arXiv (Cornell University) · 59

PDF

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

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

Faster algorithms for sorting by transpositions and sorting by block interchanges

2007 · Jianxing Feng, Daming Zhu · ACM Transactions on Algorithms · 46

Sorting by Short Swaps

2003 · Lenwood S. Heath, John Paul C. Vergara · Journal of Computational Biology · 45

Sorting by bounded block-moves

1998 · Lenwood S. Heath, John Paul C. Vergara · Discrete Applied Mathematics · 39

PDF

A 2-Approximation Algorithm for Sorting by Prefix Reversals

2005 · Johannes Fischer, Simon W. Ginzinger · Lecture notes in computer science · 38

Efficient parallel triconnectivity in logarithmic time

1988 · Vijaya Ramachandran, Uzi Vishkin · Lecture notes in computer science · 38

Hypercubic Sorting Networks

1998 · Tom Leighton, C. Greg Plaxton · SIAM Journal on Computing · 34

On sorting by prefix reversals and the diameter of pancake networks

1993 · Mohammad H. Heydari, I. Hal Sudborough · Lecture notes in computer science · 33

Pancake Flipping is hard

2015 · Laurent Bulteau, Guillaume Fertin, et al. · Journal of Computer and System Sciences · 31

PDF

Sorting by insertion of leading elements

1987 · Martin Aigner, Douglas B West · Journal of Combinatorial Theory Series A · 31

Sorting by Short Block-Moves

2000 · L. S. Heath, J. P. C. Vergara · Algorithmica · 29

Works count: 190

Citation count: 2,645