Sorting a permutation by best short swaps
From MaRDI portal
Publication:2037101
Recommendations
Cites work
- scientific article; zbMATH DE number 1947393 (Why is no real title available?)
- scientific article; zbMATH DE number 7286740 (Why is no real title available?)
- A 14/11-approximation algorithm for sorting by short block-moves
- A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
- A (1+)-approximation algorithm for sorting by short block-moves
- A simple algorithm for the constrained sequence problems
- An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Genome Rearrangements and Sorting by Reversals
- Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- Sorting by short block-moves
- The complexity of finding minimum-length generator sequences
- Transforming cabbage into turnip
This page was built for publication: Sorting a permutation by best short swaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037101)