Abstract
A run (also called maximal repetition) in a word is a non-extendable repetition. Finding the maximum number ρ(n) of runs in a string of length n is a challenging problem. Although it is known that ρ(n) ≤ 1.029n for any n and there exists large n such that ρ(n) ≥ 0.945n, the exact value of ρ(n) is still unknown. Several algorithms have been proposed to count runs in a string efficiently, and ρ(n) can be obtained for small n by these algorithms. In this paper, we focus on computing ρ(n) for given length parameter n, instead of exhaustively counting all runs for every string of length n. We report exact values of ρ(n) for binary strings for n ≤ 66, together with the strings which contain ρ(n) runs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS 1999), pp. 596–604. IEEE Computer Society (1999)
Giraud, M.: Not so many runs in strings. Language and Automata Theory and Applications, 232–239 (2008)
Puglisi, S.J., Simpson, J., Smyth, B.: How many runs can a string contain? Theoretical Computer Science 401(1-3), 165–171 (2008)
Rytter, W.: The number of runs in a string. Information and Computation 205(9), 1459–1469 (2007)
Crochemore, M., Ilie, L., Tinta, L.: The “runs” conjecture. Theoretical Computer Science 412, 2931–2941 (2011)
Matsubara, W., Kusano, K., Bannai, H., Shinohara, A.: A Series of Run-Rich Strings. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 578–587. Springer, Heidelberg (2009)
Simpson, J.: Modified padovan words and the maximum number of runs in a word. Australasian Journal of Combinatorics 46, 129–146 (2010)
Crochemore, M., Kubica, M., Radoszewski, J., Rytter, W., Waleń, T.: On the Maximal Sum of Exponents of Runsin a String. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol. 6460, pp. 10–19. Springer, Heidelberg (2011)
Crochemore, M., Ilie, L.: Analysis of Maximal Repetitions in Strings. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 465–476. Springer, Heidelberg (2007)
Franěk, F., Jiang, M., Weng, C.-C.: An improved version of the runs algorithm based on Crochemore’s partitioning algorithm. In: Proceedings of the Prague Stringology Conference 2011, pp. 98–105 (2011)
Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Information Processing Letters 12, 244–250 (1981)
Hirashima, K., Bannai, H., Matsubara, W., Ishino, A., Shinohara, A.: Bit-parallel algorithms for computing all the runs in a string. In: Proceedings of the Prague Stringology Conference 2009, pp. 203–213 (2009)
Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proceedings of the American Mathematical Society, 109–114 (1965)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kusano, K., Narisawa, K., Shinohara, A. (2012). Computing Maximum Number of Runs in Strings. In: Calderón-Benavides, L., González-Caro, C., Chávez, E., Ziviani, N. (eds) String Processing and Information Retrieval. SPIRE 2012. Lecture Notes in Computer Science, vol 7608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34109-0_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-34109-0_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34108-3
Online ISBN: 978-3-642-34109-0
eBook Packages: Computer ScienceComputer Science (R0)