An improved lower bound on approximation algorithms for the closest substring problem (Q963389)
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 5694948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved lower bound on approximation algorithms for the closest substring problem |
scientific article; zbMATH DE number 5694948 |
Statements
An improved lower bound on approximation algorithms for the closest substring problem (English)
0 references
19 April 2010
0 references
analysis of algorithms
0 references
approximation algorithms
0 references
closest substring problem
0 references
lower bound
0 references
computational biology
0 references
0.9675639271736144
0 references
0.8558874130249023
0 references
0.8499917387962341
0 references
0.8442267775535583
0 references
