The consensus string problem for a metric is NP-complete (Q876700)

From MaRDI portal
Revision as of 16:35, 6 July 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
The consensus string problem for a metric is NP-complete
scientific article

    Statements

    The consensus string problem for a metric is NP-complete (English)
    0 references
    0 references
    0 references
    26 April 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    consensus string
    0 references
    multiple sequence alignment
    0 references
    NP-complete
    0 references