The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
From MaRDI portal
Publication:5449797
DOI10.1007/11672142_14zbMath1136.68621MaRDI QIDQ5449797
Publication date: 19 March 2008
Published in: STACS 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11672142_14
Related Items
The “Runs” Theorem, Unnamed Item, Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings, The total run length of a word, On the structure of run-maximal strings, The three squares lemma revisited, On the maximal sum of exponents of runs in a string, On the density of Lyndon roots in factors, Bannai et al. method proves the \(d\)-step conjecture for strings, The ``runs conjecture, On primary and secondary repetitions in words, Upper bounds on distinct maximal (sub-)repetitions in compressed strings, The structure of subword graphs and suffix trees of Fibonacci words, Maximal repetitions in strings, How many runs can a string contain?, Repetitions in strings: algorithms and combinatorics, 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, 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, The number of runs in a string, On the average number of regularities in a word, ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS, On the Maximal Sum of Exponents of Runsin a String, Towards a Solution to the “Runs” Conjecture, Bounds on Powers in Strings, A Series of Run-Rich Strings
