Tight approximability results for test set problems in bioinformatics (Q2485280)
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: Tight approximability results for test set problems in bioinformatics |
scientific article; zbMATH DE number 2191674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight approximability results for test set problems in bioinformatics |
scientific article; zbMATH DE number 2191674 |
Statements
Tight approximability results for test set problems in bioinformatics (English)
0 references
3 August 2005
0 references
Test set problems
0 references
String Barcoding
0 references
Minimum cost probe set problems
0 references
Approximation algorithms
0 references
Lower Bounds
0 references
0.9784523844718932
0 references
0.8199084997177124
0 references
0.7824329137802124
0 references
