On primary and secondary repetitions in words
From MaRDI portal
Publication:764340
DOI10.1016/j.tcs.2011.10.024zbMath1248.68395OpenAlexW2048789315MaRDI QIDQ764340
Publication date: 13 March 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.10.024
Related Items (5)
Computing primitively-rooted squares and runs in partial words ⋮ Searching of gapped repeats and subrepetitions in a word ⋮ On the number of gapped repeats with arbitrary gap ⋮ Optimal bounds for computing \({\alpha}\)-gapped repeats ⋮ Some results on the number of periodic factors in words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New simple efficient algorithms computing powers and runs in strings
- Space efficient search for maximal repetitions
- Maximal repetitions in strings
- How many runs can a string contain?
- An optimal algorithm for computing the repetitions in a word
- Time-space-optimal string matching
- Squares, cubes, and time-space efficient string searching
- The number of runs in a string
- On the Maximal Sum of Exponents of Runsin a String
- Towards a Solution to the “Runs” Conjecture
- Analysis of Maximal Repetitions in Strings
- AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
- Not So Many Runs in Strings
- On the Maximal Number of Cubic Runs in a String
- Algorithms on Strings, Trees and Sequences
- Uniqueness Theorems for Periodic Functions
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
This page was built for publication: On primary and secondary repetitions in words