A Central Limit Theorem for the Optimal Alignments Score in Multiple Random Words
arXiv:1512.05699
Abstract
Let , where , , be independent sequences of independent and identically distributed random variables taking their values in a finite alphabet . Let the score function , defined on , be non-negative, bounded, permutation-invariant, and satisfy a bounded differences condition. Under a variance lower-bound assumption, a central limit theorem is proved for the optimal alignments score of the random words.
arXiv comment30 pages
References in corpus (5)
- A new method of normal approximation
- A Central Limit Theorem for the Length of the Longest Common Subsequences in Random Words
- Sparse long blocks and the variance of the longest common subsequences in random words
- New Kolmogorov bounds for functionals of binomial point processes
- Closeness to the Diagonal for Longest Common Subsequences in Random Words