The expected number of runs in a word

@article{Puglisi2008TheEN,
  title={The expected number of runs in a word},
  author={Simon J. Puglisi and Jamie Simpson},
  journal={Australasian J. Combinatorics},
  year={2008},
  volume={42},
  pages={45-54}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Genbank

  • D. A. Benson, I. Karsch-Mizrachi, D. J. Lipman, J. Ostell, D. L. Wheeler
  • Nucleic Acids Research 33
  • 2005
1 Excerpt

Computing Patterns in Strings

  • B. Smyth
  • Pearson Addison-Wesley
  • 2003
1 Excerpt

The maximum number of runs in a string

  • Frantisek Franek, Jamie Simpson, W. F. Smyth
  • In Proc. 14th Australas. Workshop Combin…
  • 2003
4 Excerpts

Algebraic Combinatorics on words

  • M. Lothaire
  • Encyclopedia of Mathematics and its Applications…
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…