A parallel multistart algorithm for the closest string problem (Q2483510)

From MaRDI portal
Revision as of 22:26, 27 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A parallel multistart algorithm for the closest string problem
scientific article

    Statements

    A parallel multistart algorithm for the closest string problem (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    sequence analysis
    0 references
    parallel algorithms
    0 references
    closest string problem
    0 references
    0 references