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

From MaRDI portal
Revision as of 16:45, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The consensus string problem for a metric is NP-complete
scientific article

    Statements

    title
    The consensus string problem for a metric is NP-complete (English)
    0 references
    author
    Jeong Seop Sim
    0 references
    Kun Soo Park
    0 references
    publication date
    26 April 2007
    0 references
    Mathematics Subject Classification ID
    68P10
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    5147084
    0 references
    zbMATH Keywords
    consensus string
    0 references
    multiple sequence alignment
    0 references
    NP-complete
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q876700&oldid=12828889"
    Powered by MediaWiki