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

From MaRDI portal
Revision as of 22:52, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references