The generalized definitions of the two-dimensional largest common substructure problems (Q2182100)

From MaRDI portal
Revision as of 18:29, 22 July 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
The generalized definitions of the two-dimensional largest common substructure problems
scientific article

    Statements

    title
    The generalized definitions of the two-dimensional largest common substructure problems (English)
    0 references
    author
    Huang-Ting Chan
    0 references
    Hsuan-Tsung Chiu
    0 references
    Chang-Biau Yang
    0 references
    Yung-Hsing Peng
    0 references
    published in
    Algorithmica
    0 references
    publication date
    21 May 2020
    0 references
    Mathematics Subject Classification ID
    68R05
    0 references
    68Q17
    0 references
    68R07
    0 references
    68W32
    0 references
    zbMATH DE Number
    7202655
    0 references
    zbMATH Keywords
    longest common subsequence
    0 references
    2D string
    0 references
    NP-hardness
    0 references
    APX-hardness
    0 references
    satisfiability
    0 references
    3-dimensional matching
    0 references
    describes a project that uses
    RTED
    0 references
    TED
    0 references
    OpenAlex ID
    W3006330111
    0 references
    cites work
    Generalized LCS
    0 references
    Q4258216
    0 references
    Q4218435
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2182100&oldid=36587043"
    Powered by MediaWiki