A 2-approximation algorithm for sorting by prefix reversals

Authors:
Johannes Fischer;Simon W. Ginzinger
Affiliations:
LFE Bioinformatik und Praktische Informatik, Ludwig-Maximilians-Universität München, München;LFE Bioinformatik und Praktische Informatik, Ludwig-Maximilians-Universität München, München
Venue:
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Year:
2005

Citing 12
Cited 4

The pancake problem

The pancake problem
On the problem of sorting burnt pancakes

Discrete Applied Mathematics
On the diameter of the pancake network

Journal of Algorithms
Sorting by Transpositions

SIAM Journal on Discrete Mathematics
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

Journal of the ACM (JACM)
Sorting Permutations by Reversals and Eulerian Cycle Decompositions

SIAM Journal on Discrete Mathematics
To cut…or not to cut (applications of comparative physical maps in molecular evolution)

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Genome Rearrangements and Sorting by Reversals

SIAM Journal on Computing
Sorting by Prefix Transpositions

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Efficient Bounds for Oriented Chromosome Inversion Distance

CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
1.375-Approximation Algorithm for Sorting by Reversals

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A simpler 1.5-approximation algorithm for sorting by transpositions

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching

Prefix reversals on binary and ternary strings

AB'07 Proceedings of the 2nd international conference on Algebraic biology
Polynomial-time sortable stacks of burnt pancakes

Theoretical Computer Science
Pancake flipping is hard

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Greedy Randomized Search Procedure to Sort Genomes using Symmetric, Almost-Symmetric and Unitary Inversions

Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sorting by Prefix Reversals, also known as Pancake Flipping, is the problem of transforming a given permutation into the identity permutation, where the only allowed operations are reversals of a prefix of the permutation. The problem complexity is still unknown, and no algorithm with an approximation ratio better than 3 is known. We present the first polynomial-time 2-approximation algorithm to solve this problem. Empirical tests suggest that the average performance is in fact better than 2.