A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047): 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.1080/10556788.2013.833616 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067948622 / rank | |||
Normal rank | |||
Revision as of 03:16, 20 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
