More results on overlapping squares
From MaRDI portal
Publication:2376782
DOI10.1016/j.jda.2012.03.003zbMath1281.68169OpenAlexW1992800733MaRDI QIDQ2376782
W. F. Smyth, Robert C. G. Fuller, Frantisek Franek, R. Jamie Simpson
Publication date: 24 June 2013
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.03.003
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorics on words (68R15) Algorithms on strings (68W32)
Related Items
The new periodicity lemma revisited, Constructing Words with High Distinct Square Densities, Large-scale detection of repetitions, How many double squares can a string contain?, Distinct Squares in Circular Words, Computing regularities in strings: a survey, Three overlapping squares: the general case characterized \& applications
Cites Work
- The three squares lemma revisited
- Intersecting periodic words
- An optimal algorithm for computing the repetitions in a word
- Optimal off-line detection of repetitions in a string
- Detecting leftmost maximal periodicities
- Squares, cubes, and time-space efficient string searching
- An O(n log n) algorithm for finding all repetitions in a string
- Fast and Practical Algorithms for Computing All the Runs in a String
- Uniqueness Theorems for Periodic Functions
- A New Periodicity Lemma
- Unnamed Item
