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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have