A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem |
scientific article; zbMATH DE number 6362432
| 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; zbMATH DE number 6362432 |
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
