Average value of sum of exponents of runs in strings

Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

A substring w[i.j] in w is called a repetition of period p if s[k] = s[k + p] for any i ≤ k ≤ j - p. Especially, a maximal repetition, which cannot be extended neither to left nor to right, is called a run. The ratio of the length of the run to its period, i.e. j-i+1/p, is called an exponent. The sum of exponents of runs in a string is of interest. The maximal value of the sum is still unknown, and the current upper bound is 2.9n given by Crochemore and Ilie, where n is the length of a string. In this paper we show a closed formula which exactly expresses the average value of it for any n and any alphabet size, and the limit of this value per unit length as n approaches infinity. For binary strings, the limit value is approximately 1.13103.

本文言語English
ホスト出版物のタイトルProceedings of the Prague Stringology Conference 2008
ページ185-192
ページ数8
出版ステータスPublished - 2008 12 1
イベントPrague Stringology Conference 2008, PSC 2008 - Prague, Czech Republic
継続期間: 2008 9 12008 9 3

出版物シリーズ

名前Proceedings of the Prague Stringology Conference 2008

Other

OtherPrague Stringology Conference 2008, PSC 2008
国/地域Czech Republic
CityPrague
Period08/9/108/9/3

ASJC Scopus subject areas

  • 数学 (全般)

フィンガープリント

「Average value of sum of exponents of runs in strings」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル