Text compression
The subtree max gap problem with application to parallel string covering
Information and Computation
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Finding Maximal Quasiperiodicities in Strings
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Finding Maximal Pairs with Bounded Gap
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Algorithms on Strings
The number of runs in a string
Information and Computation
Maximal repetitions in strings
Journal of Computer and System Sciences
On maximal repetitions of arbitrary exponent
Information Processing Letters
Computing Longest Previous non-overlapping Factors
Information Processing Letters
Last cases of Dejean's conjecture
Theoretical Computer Science
Theoretical Computer Science
Efficient seeds computation revisited
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
A universal algorithm for sequential data compression
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The exponent of a string is the quotient of the string's length over the string's smallest period. The exponent and the period of a string can be computed in time proportional to the string's length. We design an algorithm to compute the maximal exponent of factors of an overlap-free string. Our algorithm runs in linear-time on a fixed-size alphabet, while a naive solution of the question would run in cubic time. The solution for non overlap-free strings derives from algorithms to compute all maximal repetitions, also called runs, occurring in the string. We show there is a linear number of maximal-exponent repeats in an overlap-free string. The algorithm can locate all of them in linear time.