Large deviation based upper bounds for the LCS-problem
We analyse and apply a large deviation and Montecarlo simulation based method for the computation of improved upper bounds on the Chvatal-Sankoff constant for i.i.d. random sequences over a finite alphabet. Our theoretical results show that this method converges to the exact value of when a control...
Những tác giả chính: | Hauser, R, Martinez, S, Matzinger, H |
---|---|
Định dạng: | Report |
Được phát hành: |
Unspecified
2003
|
Những quyển sách tương tự
-
Upper bounds on the mean curve in the LCS problem
Bằng: Durringer, C, et al.
Được phát hành: (2008) -
Large deviations-based upper bounds on the expected relative length of longest common subsequences
Bằng: Hauser, R, et al.
Được phát hành: (2006) -
Approximation to the mean curve in the LCS problem
Bằng: Durringer, C, et al.
Được phát hành: (2006) -
Approximation to the mean curve in the LCS problem
Bằng: Durringer, C, et al.
Được phát hành: (2008) -
An upper bound on the convergence rate of a second functional in optimal sequence alignment
Bằng: Hauser, R, et al.
Được phát hành: (2017)