On the rate of convergence for the length of the longest common subsequences in hidden Markov models
暂无分享,去创建一个
[1] J. Steele. Probability theory and combinatorial optimization , 1987 .
[2] Kenneth S. Alexander,et al. The Rate of Convergence of the Mean Length of the Longest Common Subsequence , 1994 .
[3] Richard C. Bradley,et al. Introduction to strong mixing conditions , 2007 .
[4] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[5] J. Rosenthal,et al. General state space Markov chains and MCMC algorithms , 2004, math/0404033.
[6] David Sankoff,et al. Longest common subsequences of two random sequences , 1975, Advances in Applied Probability.
[7] R. C. Bradley. Approximation theorems for strongly mixing random variables. , 1983 .
[8] R. C. Bradley. Basic properties of strong mixing conditions. A survey and some open questions , 2005, math/0511078.
[9] Elizabeth L. Wilmer,et al. Markov Chains and Mixing Times , 2008 .
[10] D. Paulin. Concentration inequalities for Markov chains by Marton couplings and spectral methods , 2012, 1212.2015.
[11] Wansoo T. Rhee. On Rates of Convergence for Common Subsequences and First Passage Time , 1995 .
[12] Michael J. Steele,et al. Long Common Subsequences and the Proximity of two Random Strings. , 1982 .
[13] J. Kingman,et al. Random walks with stationary increments and renewal theory , 1979 .
[14] J. Lember,et al. The rate of the convergence of the mean score in random sequence comparison , 2010, 1011.2688.