A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005)
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 6435149
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem |
scientific article; zbMATH DE number 6435149 |
Statements
A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (English)
0 references
11 May 2015
0 references
combinatorial optimization
0 references
DNA sequencing
0 references
data compression
0 references
heuristics
0 references
GRASP
0 references
path relinking
0 references
0.8557859659194946
0 references
0.8421726226806641
0 references
0.8402296900749207
0 references
0.8369277119636536
0 references
0.8278241753578186
0 references
