An efficient algorithm for the all pairs suffix-prefix problem (Q1190509)

From MaRDI portal
Revision as of 14:28, 1 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126551376, #quickstatements; #temporary_batch_1722518891357)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient algorithm for the all pairs suffix-prefix problem
scientific article

    Statements

    title
    An efficient algorithm for the all pairs suffix-prefix problem (English)
    0 references
    author
    Dan Gusfield
    0 references
    Gad M. Landau
    0 references
    Baruch Schieber
    0 references
    publication date
    26 September 1992
    0 references
    zbMATH Keywords
    string matching
    0 references
    suffix-prefix match
    0 references

    Identifiers

    zbMATH DE Number
    55560
    0 references
    OpenAlex ID
    W2063556310
    0 references
    Wikidata QID
    Q126551376
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1190509&oldid=37533430"
    Powered by MediaWiki