Finding the longest common nonsuperstring in linear time (Q989576)

From MaRDI portal
Revision as of 11:39, 10 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
Finding the longest common nonsuperstring in linear time
scientific article

    Statements

    Finding the longest common nonsuperstring in linear time (English)
    0 references
    0 references
    0 references
    0 references
    20 August 2010
    0 references
    design of algorithms
    0 references
    string non-inclusion problem
    0 references
    longest common nonsuperstring
    0 references
    generalized suffix tree
    0 references

    Identifiers