Sorting by insertion of leading elements
Journal of Combinatorial Theory Series A
On the diameter of the pancake network
Journal of Algorithms
Sorting by reversals is difficult
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
SIAM Journal on Discrete Mathematics
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Journal of the ACM (JACM)
A 3/2-approximation algorithm for sorting by reversals
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
SIAM Journal on Computing
Genome Rearrangements and Sorting by Reversals
SIAM Journal on Computing
An Easy Case of Sorting by Reversals
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Edit Distances and Factorisations of Even Permutations
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Working on the problem of sorting by transpositions on genome rearrangements
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Computing rearrangement distance of every permutation in the symmetric group
Proceedings of the 2011 ACM Symposium on Applied Computing
Sorting by transpositions is difficult
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
A 2-approximation algorithm for sorting by prefix reversals
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 0.00 |
A transposition is an operation that exchanges two consecutive, adjacent blocks in a permutation. A prefix transposition is a transposition that moves the first element in the permutation. In this work we present the first results on the problem of sorting permutations with the minimum number of prefix transpositions. This problem is a variation of the transposition distance problem, related to genome rearrangements. We present approximation algorithms with performance ratios of 2 and 3. We conjecture that the maximum prefix transposition distance is D(n) = n-驴n/4驴 and present the results of several computational tests that support this. Finally, we propose an algorithm that decides whether a given permutation can be sorted using just the number of transpositions indicated by the breakpoint lower-bound.