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

From MaRDI portal
Revision as of 15:31, 2 May 2024 by EloiFerrer (talk | contribs) (‎Changed label, description and/or aliases in en, and other parts)
No description defined
Language Label Description Also known as
English
In-place algorithms for exact and approximate shortest unique substring problems
No description defined

    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
    0 references
    0 references