Complexity of approximating closest substring problems. (Q5900798)
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 5695548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of approximating closest substring problems. |
scientific article; zbMATH DE number 5695548 |
Statements
Fundamentals of Computation Theory (English)
0 references
20 April 2010
0 references
approximation algorithms
0 references
hardness of approximation
0 references
closest substring
0 references
0.8867577910423279
0 references
0.8714302182197571
0 references
0.8696936368942261
0 references
0.8558874130249023
0 references
