In-place algorithms for exact and approximate shortest unique substring problems (Q2399613)

From MaRDI portal
Revision as of 02:44, 4 August 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
In-place algorithms for exact and approximate shortest unique substring problems
scientific article

    Statements

    In-place algorithms for exact and approximate shortest unique substring problems (English)
    0 references
    0 references
    0 references
    0 references
    24 August 2017
    0 references
    0 references
    string pattern matching
    0 references
    shortest unique substring
    0 references
    in-place algorithms
    0 references