String matching: The ergodic case

DOI10.1214/aop/1176989686zbMath0753.92021OpenAlexW2035893571MaRDI QIDQ1201167

Paul C. Shields

Publication date: 17 January 1993

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1176989686

zbMATH Keywords

string matchingergodic processesasymptotic growth ratealphabetentropy boundshift-invariant measureDNA modelingdoubly infinite sequencesstationary finite-alphabet ergodic process

Mathematics Subject Classification ID

Strong limit theorems (60F15) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)

Related Items (4)

String matching bounds via coding ⋮ Waiting times: Positive and negative results on the Wyner-Ziv problem ⋮ Two divergence-rate counterexamples ⋮ Longest common substring for random subshifts of finite type

This page was built for publication: String matching: The ergodic case