On the rate of convergence for the length of the longest common subsequences in hidden Markov models

DOI10.1017/jpr.2019.26zbMath1415.60013arXiv1712.09881OpenAlexW2965668501MaRDI QIDQ5226258

George Kerchev, Christian Houdré

Publication date: 31 July 2019

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.09881

zbMATH Keywords

rate of convergencehidden Markov modelmixing conditionlongest common subsequenceHoeffding inequality

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05) Large deviations (60F10)

Related Items

Normal Approximation for Functions of Hidden Markov Models ⋮ A central limit theorem for the length of the longest common subsequences in random words ⋮ On the limiting law of the length of the longest common and increasing subsequences in random words with arbitrary distribution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The rate of the convergence of the mean score in random sequence comparison
• Approximation theorems for strongly mixing random variables
• General state space Markov chains and MCMC algorithms
• Basic properties of strong mixing conditions. A survey and some open questions
• Mixing: Properties and examples
• The rate of convergence of the mean length of the longest common subsequence
• On rates of convergence for common subsequences and first passage time
• Concentration inequalities for Markov chains by Marton couplings and spectral methods
• Asymptotic Theory of Weakly Dependent Random Processes
• Long Common Subsequences and the Proximity of Two Random Strings
• Longest common subsequences of two random sequences
• Maximal coupling
• Biological Sequence Analysis