Fast, practical algorithms for computing all the repeats in a string (Q626893)

From MaRDI portal
Revision as of 10:44, 3 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
Fast, practical algorithms for computing all the repeats in a string
scientific article

    Statements

    Fast, practical algorithms for computing all the repeats in a string (English)
    0 references
    0 references
    0 references
    0 references
    19 February 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    repeat
    0 references
    repetition
    0 references
    suffix array
    0 references
    suffix tree
    0 references