A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 10:03, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem |
scientific article |
Statements
A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (English)
0 references
29 October 2014
0 references
closest string problem
0 references
heuristics
0 references
simulated-annealing
0 references
NP-hard problems
0 references
computational biology
0 references
bioinformatics
0 references
