The asymptotics of string matching probabilities for Gaussian random sequences
Shunsuke Ihara, Masashi Kubo · 2002
Wyner and Ziv (1989) studied the asymptotic properties of recurrence times of stationary processes, and applied the results to obtain optimal data compression schemes in information transmission. Since then many data compression algorithms based upon string matching have been proposed and studied. We consider Gaussian stationary sources and study the problem of string matching with distortion. We prove theorems concerning the asymptotic behavior of the probability of string matching with distortion and the waiting time for the string matching.