Hostname: page-component-7f64f4797f-l842n Total loading time: 0 Render date: 2025-11-06T09:16:58.503Z Has data issue: false hasContentIssue false
  • English
  • Français

Common Subsequences and Supersequences and their Expected Length

Published online by Cambridge University Press:  01 December 1998

VLADO DANČÍK
VLADO DANČÍK
Affiliation:
Current address: Millennium Pharmaceuticals, 40 Erie Street, Cambridge, MA 02139–4254, USA (e-mail: dancik@mpi.com)
Get access Rights & Permissions [Opens in a new window]

Abstract

Let f(n, k, l) be the expected length of a longest common subsequence of l sequences of length n over an alphabet of size k. It is known that there are constants γ(l)k such that f(n, k, l)→γ(l)kn as n→∞, and we show that γ(l)k=Θ(k1/l−1) as k→∞. Bounds for the corresponding constants for the expected length of a shortest common supersequence are also presented.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 7 , Issue 4 , December 1998 , pp. 365 - 373
Copyright
1998 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable