Pancake flipping and sorting permutations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1263193 (Why is no real title available?)
- scientific article; zbMATH DE number 1947393 (Why is no real title available?)
- scientific article; zbMATH DE number 1405677 (Why is no real title available?)
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions
- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
- A simpler 1.5-approximation algorithm for sorting by transpositions
- Algorithms – ESA 2005
- An approximation algorithm for sorting by reversals and transpositions
- Bounds for sorting by prefix reversal
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Genome Rearrangements and Sorting by Reversals
- On the Diameter of the Pancake Network
- Pancake problems with restricted prefix reversals and some corresponding Cayley networks.
- Sorting by Transpositions
- (1+)-approximation of sorting by reversals and transpositions.
Cited in
(2)
This page was built for publication: Pancake flipping and sorting permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491630)