An upper bound on the convergence rate of a second functional in optimal sequence alignment
Consider finite sequences X[1,n] = X1,...,Xn and Y[1,n] = Y1,...,Yn of length n, consisting of i.i.d. samples of random letters from a finite alphabet, and let S and T be chosen i.i.d. randomly from the unit ball in the space of symmetric scoring functions over this alphabet augmented by a gap symbo...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Bernoulli Society for Mathematical Statistics
2017
|