|
|||||
|
|
Upper bounds for the expected length of a longest common subsequence of two binary sequences |
|
| Authors: | Vlado Dan ík Mike Paterson |
| Institution: | Vlado Dančík,Mike Paterson |
| Abstract: | Let f(n) be the expected length of a longest common subsequence of two random binary sequences of length n. It is known that the limit γ = limn→ ∞ n?1 f(n) exists. Improved upper bounds for γ are given using a new method. |
| Keywords: | |