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; zbMATH DE number 6067718
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations |
scientific article; zbMATH DE number 6067718 |
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
0.98168814
0 references
0.89872336
0 references
0.8981168
0 references
0.89782774
0 references
0.8773807
0 references
0.8694048
0 references
0.8628064
0 references
0.8627922
0 references
0.85886204
0 references
0.85861135
0 references
