Space efficient search for maximal repetitions (Q557913): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q828196
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Roman M. Kolpakov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.01.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984098563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Squares, cubes, and time-space efficient string searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space-optimal string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zooming method: A recursive approach to time-space efficient string-matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for finding all repetitions in a string / rank
 
Normal rank

Latest revision as of 12:09, 10 June 2024

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