Space efficient search for maximal repetitions (Q557913): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:58, 30 January 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
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
