On the Maximal Sum of Exponents of Runsin a String

DOI10.1007/978-3-642-19222-7_2zbMath1295.68175OpenAlexW1999019735MaRDI QIDQ3000489

Maxime Crochemore, Wojciech Rytter, Tomasz Walen, Marcin Kubica, Jakub Radoszewski

Publication date: 19 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_2

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

On primary and secondary repetitions in words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal repetitions in strings
• How many runs can a string contain?
• Repetitions in strings: algorithms and combinatorics
• The number of runs in a string
• Towards a Solution to the “Runs” Conjecture
• Analysis of Maximal Repetitions in Strings
• AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
• Not So Many Runs in Strings
• On the Maximal Number of Cubic Runs in a String
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound

This page was built for publication: On the Maximal Sum of Exponents of Runsin a String