A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-013-9622-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2095463189 / rank | |||
Normal rank | |||
Revision as of 18:33, 19 March 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
