Space efficient search for maximal repetitions (Q557913)

From MaRDI portal
Revision as of 12:09, 10 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Space efficient search for maximal repetitions
scientific article

    Statements

    Space efficient search for maximal repetitions (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2005
    0 references
    For the task to find maximal repetitions in a word of length \(n\) there exist exhaustive algorithms. It is, however, interesting with which time and space limitations this can be achieved. The effort of previously known algorithms is decreased, introducing only minor restrictions.
    0 references
    space efficiency
    0 references
    repetitions
    0 references
    algorithms on words
    0 references
    complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references