On the structure of run-maximal strings
From MaRDI portal
Publication:414413
DOI10.1016/j.jda.2011.08.005zbMath1238.68113OpenAlexW2086340885MaRDI QIDQ414413
Antoine Deza, Frantisek Franek, Andrew Baker
Publication date: 11 May 2012
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2011.08.005
Related Items (4)
A computational substantiation of the \(d\)-step approach to the number of distinct squares problem ⋮ A computational framework for determining run-maximal strings ⋮ A \(d\)-step approach to the maximum number of distinct squares and runs in strings ⋮ A d-Step Approach for Distinct Squares in Strings
Cites Work
- Unnamed Item
- Unnamed Item
- The ``runs conjecture
- Maximal repetitions in strings
- How many runs can a string contain?
- A characterization of the squares in a Fibonacci string
- Repetitive perhaps, but certainly not boring
- Detecting leftmost maximal periodicities
- Towards a Solution to the “Runs” Conjecture
- AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
- Not So Many Runs in Strings
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
This page was built for publication: On the structure of run-maximal strings
