The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet * (Q6133865)
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: The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet * |
scientific article; zbMATH DE number 7716291
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet * |
scientific article; zbMATH DE number 7716291 |
Statements
24 July 2023
0 references
maximum-duo preservation string mapping
0 references
bounded alphabet
0 references
polynomial time approximation scheme
0 references
The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet * (English)
0 references
0.8930677175521851
0 references
0.8864578604698181
0 references
0.8842474222183228
0 references
0.8838833570480347
0 references
