String matching: The ergodic case
From MaRDI portal
Publication:1201167
DOI10.1214/aop/1176989686zbMath0753.92021MaRDI QIDQ1201167
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
string matching; ergodic processes; asymptotic growth rate; alphabet; entropy bound; shift-invariant measure; DNA modeling; doubly infinite sequences; stationary finite-alphabet ergodic process
60F15: Strong limit theorems
92C40: Biochemistry, molecular biology
92D20: Protein sequences, DNA sequences
Related Items
Waiting times: Positive and negative results on the Wyner-Ziv problem, Two divergence-rate counterexamples, String matching bounds via coding, Longest common substring for random subshifts of finite type