A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations |
scientific article |
Statements
A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (English)
0 references
17 August 2012
0 references
permutation
0 references
cut-and-paste
0 references
reversal
0 references
transposition
0 references
transreversal
0 references
approximation algorithm
0 references
0 references
0 references
