Maximal repetitions in strings
From MaRDI portal
Recommendations
Cites work
- A characterization of the squares in a Fibonacci string
- A note on the number of squares in a word
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- An optimal algorithm for computing the repetitions in a word
- Detecting leftmost maximal periodicities
- How many runs can a string contain?
- How many squares can a string contain?
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- scientific article; zbMATH DE number 1390079 (Why is no real title available?)
- Optimal off-line detection of repetitions in a string
- Squares, cubes, and time-space efficient string searching
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
Cited in
(56)- Repetitions in strings: algorithms and combinatorics
- Asymptotic behavior of the numbers of runs and microruns
- Weak repetitions in Sturmian strings.
- Repetitions in Sturmian strings
- On maximal repeats in strings
- Computing primitively-rooted squares and runs in partial words
- The maximal number of cubic runs in a word
- Computing regularities in strings: a survey
- On the maximum number of cubic subwords in a word
- Computing the maximum exponent in a stream
- Lower bounds for the number of repetitions in 2D strings
- Optimal bounds for computing \({\alpha}\)-gapped repeats
- Some results on the number of periodic factors in words
- Three overlapping squares: the general case characterized \& applications
- Prefix frequency of lost positions
- Inclusion problems in trace monoids
- On the complexity of computing the order of repetition of a string
- Asymptotic behaviour of the maximal number of squares in standard Sturmian words
- Crochemore's repetitions algorithm revisited: computing runs
- Large-scale detection of repetitions
- On the Maximal Sum of Exponents of Runsin a String
- scientific article; zbMATH DE number 3864532 (Why is no real title available?)
- Fast and Practical Algorithms for Computing All the Runs in a String
- Analysis of Maximal Repetitions in Strings
- Bounds on Powers in Strings
- Not So Many Runs in Strings
- NUMBER OF OCCURRENCES OF POWERS IN STRINGS
- A Series of Run-Rich Strings
- The total run length of a word
- A computational framework for determining run-maximal strings
- On the structure of run-maximal strings
- The three squares lemma revisited
- scientific article; zbMATH DE number 2051171 (Why is no real title available?)
- On the maximal sum of exponents of runs in a string
- Understanding maximal repetitions in strings
- scientific article; zbMATH DE number 1390079 (Why is no real title available?)
- New simple efficient algorithms computing powers and runs in strings
- On the density of Lyndon roots in factors
- Repetition Detection in a Dynamic String
- On maximal repeats in compressed strings
- Almost linear time computation of maximal repetitions in run length encoded strings
- Bannai et al. method proves the \(d\)-step conjecture for strings
- The ``runs theorem
- A new characterization of maximal repetitions by Lyndon trees
- The ``runs conjecture
- The number of repetitions in 2D-strings
- Distinct squares in run-length encoded strings
- Maximal closed substrings
- Optimal bounds for distinct quartics
- Repetition and recurrence times: dual statements and summable mixing rates
- Linear time runs over general ordered alphabets
- On primary and secondary repetitions in words
- Upper bounds on distinct maximal (sub-)repetitions in compressed strings
- Computing maximal-exponent factors in an overlap-free word
- Computing runs on a general alphabet
- How many runs can a string contain?
This page was built for publication: Maximal repetitions in strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q931723)
