Article contents
On the rate of convergence for the length of the longest common subsequences in hidden Markov models
Published online by Cambridge University Press: 30 July 2019
Abstract
Let (X, Y) = (Xn, Yn)n≥1 be the output process generated by a hidden chain Z = (Zn)n≥1, where Z is a finite-state, aperiodic, time homogeneous, and irreducible Markov chain. Let LCn be the length of the longest common subsequences of X1,..., Xn and Y1,..., Yn. Under a mixing hypothesis, a rate of convergence result is obtained for E[LCn]/n.
Keywords
MSC classification
- Type
- Research Papers
- Information
- Copyright
- © Applied Probability Trust 2019
References
- 3
- Cited by