Analysis of Maximal Repetitions in Strings

DOI10.1007/978-3-540-74456-6_42zbMath1147.68864OpenAlexW1541612046MaRDI QIDQ3525593

Maxime Crochemore, Lucian Ilie

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_42

zbMATH Keywords

combinatorics on wordsrunsmaximal periodicitiesrepetitions in stringsmaximal repetitionssum of exponents

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Related Items (11)

Towards a Solution to the “Runs” Conjecture ⋮ Unnamed Item ⋮ On the maximal sum of exponents of runs in a string ⋮ Bounds on Powers in Strings ⋮ On the Maximal Sum of Exponents of Runsin a String ⋮ Average number of occurrences of repetitions in a necklace ⋮ Computing the number of cubic runs in standard Sturmian words ⋮ The maximal number of cubic runs in a word ⋮ Some results on the number of periodic factors in words ⋮ On primary and secondary repetitions in words ⋮ Repetitions in strings: algorithms and combinatorics

This page was built for publication: Analysis of Maximal Repetitions in Strings