A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047)

From MaRDI portal
Revision as of 14:49, 23 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    29 October 2014
    0 references
    0 references
    0 references
    0 references
    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