Further improvement in approximating the maximum duo-preservation string mapping problem (Q1708415)
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: Further improvement in approximating the maximum duo-preservation string mapping problem |
scientific article; zbMATH DE number 6852346
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Further improvement in approximating the maximum duo-preservation string mapping problem |
scientific article; zbMATH DE number 6852346 |
Statements
Further improvement in approximating the maximum duo-preservation string mapping problem (English)
0 references
23 March 2018
0 references
string algorithms
0 references
polynomial-time approximation
0 references
max duo-preservation string mapping problem
0 references
min common string partition problem
0 references
0.9328545928001404
0 references
0.9191542863845824
0 references
0.8910359144210815
0 references
0.8864578604698181
0 references
0.8843481540679932
0 references
