On primary and secondary repetitions in words
From MaRDI portal
(Redirected from Publication:764340)
Recommendations
Cites work
- scientific article; zbMATH DE number 5717191 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
- Algorithms on Strings, Trees and Sequences
- An optimal algorithm for computing the repetitions in a word
- Analysis of Maximal Repetitions in Strings
- How many runs can a string contain?
- Maximal repetitions in strings
- New simple efficient algorithms computing powers and runs in strings
- Not So Many Runs in Strings
- On the Maximal Sum of Exponents of Runsin a String
- On the maximal number of cubic runs in a string
- Space efficient search for maximal repetitions
- Squares, cubes, and time-space efficient string searching
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
- The number of runs in a string
- Time-space-optimal string matching
- Towards a Solution to the “Runs” Conjecture
- Uniqueness Theorems for Periodic Functions
Cited in
(10)- Parikh motivated study on repetitions in words
- WORD COMPLEXITY AND REPETITIONS IN WORDS
- Pinned repetitions in symbolic flows: preliminary results
- Optimal bounds for computing \({\alpha}\)-gapped repeats
- Hunting redundancies in strings
- Computing primitively-rooted squares and runs in partial words
- Searching of gapped repeats and subrepetitions in a word
- scientific article; zbMATH DE number 1390079 (Why is no real title available?)
- Some results on the number of periodic factors in words
- On the number of gapped repeats with arbitrary gap
This page was built for publication: On primary and secondary repetitions in words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764340)