A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2012.01.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047975566 / rank | |||
Normal rank | |||
Revision as of 02:43, 20 March 2024
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
