Analysis of Maximal Repetitions in Strings
From MaRDI portal
Recommendations
Cited in
(22)- Repetitions in strings: algorithms and combinatorics
- On maximal repeats in strings
- The maximal number of cubic runs in a word
- Some results on the number of periodic factors in words
- Large-scale detection of repetitions
- On the Maximal Sum of Exponents of Runsin a String
- Fast and Practical Algorithms for Computing All the Runs in a String
- Towards a Solution to the “Runs” Conjecture
- Bounds on Powers in Strings
- On the maximal sum of exponents of runs in a string
- Understanding maximal repetitions in strings
- Average number of occurrences of repetitions in a necklace
- Computing the number of cubic runs in standard Sturmian words
- Repetition Detection in a Dynamic String
- On maximal repeats in compressed strings
- Almost linear time computation of maximal repetitions in run length encoded strings
- A new characterization of maximal repetitions by Lyndon trees
- The number of repetitions in 2D-strings
- Maximal and minimal representations of gapped and non-gapped motifs of a string
- On primary and secondary repetitions in words
- Computing runs on a general alphabet
- Maximal repetitions in strings
This page was built for publication: Analysis of Maximal Repetitions in Strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525593)