Space efficient search for maximal repetitions
From MaRDI portal
Publication:557913
DOI10.1016/j.tcs.2005.01.006zbMath1076.68054OpenAlexW1984098563MaRDI QIDQ557913
Igor Potapov, Leszek Gąsieniec, Roman M. Kolpakov
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.01.006
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Number-theoretic algorithms; complexity (11Y16) Descriptive complexity and finite models (68Q19)
Related Items (4)
Time-Space Trade-Offs for Longest Common Extensions ⋮ Time-space trade-offs for longest common extensions ⋮ Some results on the number of periodic factors in words ⋮ On primary and secondary repetitions in words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The zooming method: A recursive approach to time-space efficient string-matching
- Time-space-optimal string matching
- Squares, cubes, and time-space efficient string searching
- An O(n log n) algorithm for finding all repetitions in a string
- Algorithms on Strings, Trees and Sequences
This page was built for publication: Space efficient search for maximal repetitions
