Further improvement in approximating the maximum duo-preservation string mapping problem (Q1708415): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-43681-4_5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2506649003 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:57, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Further improvement in approximating the maximum duo-preservation string mapping problem |
scientific article |
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
