Space efficient search for maximal repetitions (Q557913)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Space efficient search for maximal repetitions |
scientific article; zbMATH DE number 2184109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Space efficient search for maximal repetitions |
scientific article; zbMATH DE number 2184109 |
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
0.86605364
0 references
0.86494654
0 references
0.8610373
0 references
0.85891217
0 references
0.8542249
0 references
