Data compression: methods and theory
Data compression: methods and theory
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Space efficient search for maximal repetitions
Theoretical Computer Science - Combinatorics on words
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
The number of runs in a string
Information and Computation
Maximal repetitions in strings
Journal of Computer and System Sciences
How many runs can a string contain?
Theoretical Computer Science
Towards a Solution to the "Runs" Conjecture
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Extracting powers and periods in a string from its runs structure
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
On the maximal sum of exponents of runs in a string
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
The number of runs in a string: improved analysis of the linear upper bound
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On the maximal number of cubic runs in a string
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Analysis of maximal repetitions in strings
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 5.24 |
Combinatorial properties of maximal repetitions (runs) in formal words are studied. We classify all maximal repetitions in a word as primary and secondary where the set of all primary repetitions determines all the other repetitions in the word. Essential combinatorial properties of primary repetitions are established.