Upper bounds for the expected length of a longest common subsequence of two binary sequences
| Main Authors: | Dancik, V. (Author), Paterson, M. (Author) |
|---|---|
| Format: | Book |
| Language: | English |
| Series: | Research Report
250 |
| Subjects: |
Similar Items
-
Lower bounds for Union-Split-FIND related problems on rendom access machines
by: Miltersen Bro, Peter -
PI mass production and an optimal circuit for the nechiporuk slice
by: Hiltgen, Alain P., et al. -
Consistency of natural relations on sets
by: Koizumi, H., et al. -
Surface reconstruction between simple polygons via angle criteria B 94-11, April 1994
by: Welzl, Emo, et al. -
Fast greedy triangulation algorithms B 94-09 April 1994
by: Dickerson, Matthew T., et al.