The number of runs in a string: Improved analysis of the linear upper bound
Document Type
Conference Proceeding
Publication Date
7-10-2006
Abstract
A run (or a maximal repetition) in a string is an inclusion-maximal periodic segment in a string. Let p(n) be the maximal number of runs in a string of length n. It has been shown in [8] that p(n) = O(n), the proof was very complicated and the constant coefficient in O(n) has not been given explicitly. We propose a new approach to the analysis of runs based on the properties of subperiods: the periods of periodic parts of the runs. We show that p(n) ≤ 5 n. Our proof is inspired by the results of [4], where the role of new periodicity lemmas has been emphasized. © Springer-Verlag Berlin Heidelberg 2006.
Identifier
33745594562 (Scopus)
ISBN
[3540323015, 9783540323013]
Publication Title
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics
External Full Text Location
https://doi.org/10.1007/11672142_14
e-ISSN
16113349
ISSN
03029743
First Page
184
Last Page
195
Volume
3884 LNCS
Recommended Citation
Rytter, Wojciech, "The number of runs in a string: Improved analysis of the linear upper bound" (2006). Faculty Publications. 18887.
https://digitalcommons.njit.edu/fac_pubs/18887
