On the complexity of finding common approximate substrings. (Q1426464)

From MaRDI portal
Revision as of 08:21, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of finding common approximate substrings.
scientific article

    Statements

    title
    On the complexity of finding common approximate substrings. (English)
    0 references
    author
    Patricia A. Evans
    0 references
    Andrew D. Smith
    0 references
    H. Todd Wareham
    0 references
    publication date
    14 March 2004
    0 references
    zbMATH Keywords
    Parameterized complexity
    0 references
    Pattern matching
    0 references
    Common approximate substring
    0 references

    Identifiers

    zbMATH DE Number
    2056808
    0 references
    Wikidata QID
    Q106509296
    0 references
    OpenAlex ID
    W2062088872
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1426464&oldid=36861931"
    Powered by MediaWiki