The expected number of runs in a word

被引：0
|
作者：
Puglisi, Simon J. [1 ]
Simpson, Jamie [2 ]
机构：
[1] RMIT Univ, Sch Comp Sci & Informat Technol, GPO Box 2476, Melbourne, Vic 3001, Australia
[2] Curtin Univ Technol, Dept Math & Stat, Perth, WA 6845, Australia
来源：
AUSTRALASIAN JOURNAL OF COMBINATORICS | 2008年 / 42卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A word is a sequence of symbols taken from a (usually finite) alphabet. A run of period p in a word x is a factor x[m..n] such that n - m >= p and x[i] = x[i + p] for all i satisfying m <= i < i + p = n, and such that this does not hold if m is replaced by a smaller integer or n by a larger one. The number of runs in words has been a subject of interest in recent years, particularly because of connections with data compression. In this paper we investigate the expected number of runs per unit length in words of given alphabet size, and compare our results with DNA, amino acid and other sequences.
引用
收藏
页码：45 / 54
页数：10
相关论文
共 50 条
  • [31] The maximal number of runs in standard Sturmian words
    Baturo, Pawel
    Piatkowski, Marcin
    Rytter, Wojciech
    ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (01):
  • [32] Approximating the expected number of inversions given the number of breakpoints
    Eriksen, N
    ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2002, 2452 : 316 - 330
  • [33] AN SPC MODEL FOR SHORT PRODUCTION-RUNS - MINIMIZING EXPECTED COST
    CROWDER, SV
    TECHNOMETRICS, 1992, 34 (01) : 64 - 73
  • [34] ADVERTISING IN A WORD, OR A NUMBER
    COOK, WA
    JOURNAL OF ADVERTISING RESEARCH, 1989, 29 (03) : 7 - 8
  • [35] NUMBER OF WORD REPRESENTATIONS
    GERL, P
    MONATSHEFTE FUR MATHEMATIK, 1971, 75 (03): : 205 - &
  • [36] Word deafness with preserved number word perception
    Fischer-Baum, Simon
    Mis, Rachel
    Dial, Heather
    COGNITIVE NEUROPSYCHOLOGY, 2018, 35 (08) : 415 - 429
  • [37] MACLEAN,NORMAN A 'RIVER RUNS THROUGH IT', WORD, WATER, AND TEXT
    BUTLER, DR
    CRITIQUE-STUDIES IN CONTEMPORARY FICTION, 1992, 33 (04) : 263 - 273
  • [38] EXPECTED NUMBER OF PARTS IN A PARTITION OF N
    KESSLER, I
    LIVINGSTON, M
    MONATSHEFTE FUR MATHEMATIK, 1976, 81 (03): : 203 - 212
  • [39] Extracting powers and periods in a word from its runs structure
    Crochemore, M.
    Iliopoulos, C. S.
    Kubica, M.
    Radoszewski, J.
    Rytter, W.
    Walen, T.
    THEORETICAL COMPUTER SCIENCE, 2014, 521 : 29 - 41
  • [40] On the Expected Number of Zeros of Nonlinear Equations
    Gregorio Malajovich
    Foundations of Computational Mathematics, 2013, 13 : 867 - 884
12345