A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:08, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem |
scientific article |
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
