String matching bounds via coding

Annals of Probability

Volumn 25, Issue 1, 1997, Pages 329-336

  Shields, Paul C ^a  

^a UNIVERSITY OF TOLEDO   (United States)

Author keywords

Prefix codes; String matching

Indexed keywords

EID: 0031489221     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/aop/1024404290     Document Type: Article

References (11)

1. AHRATIA, R. and WATERMAN, M. (1989). The Erdos-Rényi strong law for pattern matching with a given proportion of mismatches. Ann. Probab. 17 1152-1169.
2. BARRON, A. (1985). Logically smooth density estimation. Ph.D. dissertation, Dept. Electrical Engineering, Stanford Univ.
3. GRASSBERGER, P. (1989). Estimating the information content of symbol sequences and efficient codes. IEEE Trans. Inform. Theory 35 669-675.
4. KONTOYIANNIS, I. and SUHOV, Y. M. (1993). Prefixes and the entropy rate for long-range sources. In Probability, Statistics, and Optimization (F. P. Kelly, ed.). Wiley, New York.
5. ORNSTEIN, D. and WEISS, B. (1990). How sampling reveals a process. Ann. Probab. 18 905-930.
6. ORNSTEIN, D. and WEISS, B. (1993). Entropy and data compression. IEEE Trans. Inform. Theory IT-39 78-83.
7. QUAS, A. (1995). An entropy estimator for a class of infinite alphabet processes. Preprint.
8. SHIELDS, P. (1990). Universal almost sure data compression using Markov types. Problems Control Inform. Theory 19 269-277.
9. SHIELDS, P. (1992). Entropy and prefixes. Ann. Probab. 20 403-409.
10. SHIELDS, P. (1992). String matching - the general ergodic case. Ann. Probab. 20 1199-1203.
11. SHIELDS, P. (1996). The Ergodic Theory of Discrete Sample Paths. AMS Graduate Studies in Mathematics 13. Amer. Math. Soc., Providence, RI.