Space efficient search for maximal repetitions

Authors:
Leszek Gasieniec;Roman Kolpakov;Igor Potapov
Affiliations:
Department of Computer Science, University of Liverpool, Chadwick Building, Peach St., Liverpool L69 7ZF, UK;Department of Computer Science, University of Liverpool, Chadwick Building, Peach St., Liverpool L69 7ZF, UK;Department of Computer Science, University of Liverpool, Chadwick Building, Peach St., Liverpool L69 7ZF, UK
Venue:
Theoretical Computer Science - Combinatorics on words
Year:
2005

Citing 6
Cited 3

An O(n log n) algorithm for finding all repetitions in a string

Journal of Algorithms
Data compression: methods and theory

Data compression: methods and theory
Text algorithms

Text algorithms
The zooming method: a recursive approach to time-space efficient string-matching

Theoretical Computer Science
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Finding Maximal Repetitions in a Word in Linear Time

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

On primary and secondary repetitions in words

Theoretical Computer Science
Time-Space trade-offs for longest common extensions

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Time-space trade-offs for longest common extensions

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study here a problem of finding all maximal repetitions in a string of length n. We show that the problem can be solved in time O(n log n) in the presence of constant extra space and general (unbounded) alphabets. Subsequently we show that in the model with a constant size alphabet the problem can be solved in time O(n) with a help of o(n) extra space. Previously best known algorithms require linear additional space in both models.