✦ LIBER ✦

On the maximal sum of exponents of runs in a string

✍ Scribed by Maxime Crochemore; Marcin Kubica; Jakub Radoszewski; Wojciech Rytter; Tomasz Waleń

Book ID: 113699085
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 244 KB
Volume: 14
Category: Article
ISSN: 1570-8667
DOI: 10.1016/j.jda.2011.12.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the structure of run-maximal strings

✍ Andrew Baker; Antoine Deza; Frantisek Franek 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 156 KB

The number of runs in a string

✍ Wojciech Rytter 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 159 KB

The maximal number of cubic runs in a wo

The maximal number of cubic runs in a word

✍ M. Crochemore; C.S. Iliopoulos; M. Kubica; J. Radoszewski; W. Rytter; T. Waleń 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 242 KB

On weak convergence of a maximal stochas

On weak convergence of a maximal stochastic sum

✍ E. V. Rybko 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 231 KB

On the maximality of the sum of two maxi

On the maximality of the sum of two maximal monotone operators

✍ Hedy Attouch 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 299 KB

On the distribution of runs of ones in b

On the distribution of runs of ones in binary strings

✍ Koushik Sinha; Bhabani P. Sinha 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 834 KB

statistics a b s t r a c t In this paper, we derive the number of binary strings which contain, for a given i k , exactly i k runs of 1's of length k in all possible binary strings of length n, 1 ≤ k ≤ n. Such a knowledge about the distribution pattern of runs of 1's in binary strings is useful in