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

From MaRDI portal
Revision as of 19:39, 14 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
An efficient algorithm for the all pairs suffix-prefix problem
scientific article

    Statements

    An efficient algorithm for the all pairs suffix-prefix problem (English)
    0 references
    0 references
    0 references
    0 references
    26 September 1992
    0 references
    0 references
    string matching
    0 references
    suffix-prefix match
    0 references