论文信息 - Space efficient search for maximal repetitions

Space efficient search for maximal repetitions

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.

Igor Potapov | Leszek Gasieniec | Roman Kolpakov

[1] Michael G. Main,et al. An O(n log n) Algorithm for Finding All Repetitions in a String , 1984, J. Algorithms.

[2] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[3] Wojciech Plandowski,et al. The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching , 1995, Theor. Comput. Sci..

[4] Gregory Kucherov,et al. Finding maximal repetitions in a word in linear time , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[5] Wojciech Rytter,et al. Squares, cubes, and time-space efficient string searching , 1995, Algorithmica.

[6] Gregory Kucherov,et al. On Maximal Repetitions in Words , 1999, FCT.

[7] Zvi Galil,et al. Time-space-optimal string matching (Preliminary Report) , 1981, STOC '81.

[8] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[9] Wojciech Rytter,et al. Text Algorithms , 1994 .

[10] Dany Breslauer,et al. Efficient String Matching on Coded Texts , 1994, CPM.

[11] James A. Storer,et al. Data Compression: Methods and Theory , 1987 .