Pages that link to "Item:Q2679696"
From MaRDI portal
The following pages link to A central limit theorem for the length of the longest common subsequences in random words (Q2679696):
Displaying 9 items.
- On the variance of the optimal alignments score for binary random words and an asymmetric scoring function (Q330635) (← links)
- On the asymptotic average length of a maximum common subsequence for words over a finite alphabet (Q671435) (← links)
- Large deviation principles for words drawn from correlated letter sequences (Q743088) (← links)
- Limit theorems for longest monotone subsequences in random Mallows permutations (Q1700399) (← links)
- Longest common substring for random subshifts of finite type (Q2077341) (← links)
- A general method for lower bounds on fluctuations of random variables (Q2327942) (← links)
- On the rate of convergence for the length of the longest common subsequences in hidden Markov models (Q5226258) (← links)
- LATIN 2004: Theoretical Informatics (Q5901650) (← links)
- A Central Limit Theorem for the Length of the Longest Common Subsequences in Random Words (Q6253759) (← links)
