Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2008 | AUSTRALASIAN JOURNAL OF COMBINATORICS | amino acid,data compression,satisfiability |
Field | DocType | Volume |
Integer,Combinatorics,Expected value,Data compression,Mathematics,Alphabet | Journal | 42 |
ISSN | Citations | PageRank |
2202-3518 | 12 | 0.76 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Simon J. Puglisi | 1 | 1132 | 75.14 |
| Jamie Simpson | 2 | 164 | 21.41 |