The simplified partial digest problem: approximation and a graph-theoretic model (Q621677)
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 5842688
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The simplified partial digest problem: approximation and a graph-theoretic model |
scientific article; zbMATH DE number 5842688 |
Statements
The simplified partial digest problem: approximation and a graph-theoretic model (English)
0 references
28 January 2011
0 references
integer programming
0 references
genome mapping
0 references
combinatorial optimization
0 references
heuristics
0 references
approximation algorithms
0 references
0 references
0.8779702186584473
0 references
0.8712664246559143
0 references
0.8188115954399109
0 references
0.8079257607460022
0 references
0.7935003638267517
0 references
