Approximating reversal distance for strings with bounded number of duplicates (Q868388)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5130472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating reversal distance for strings with bounded number of duplicates |
scientific article; zbMATH DE number 5130472 |
Statements
Approximating reversal distance for strings with bounded number of duplicates (English)
0 references
2 March 2007
0 references
approximation algorithms
0 references
string comparison
0 references
edit distance
0 references
sorting by reversals
0 references
minimum common string partition
0 references
0.9858710169792176
0 references
0.9135369658470154
0 references
0.9070438146591188
0 references
0.842995285987854
0 references
0.8361505270004272
0 references
