Given two random k-ary sequences of length n, what is f(n,k), the expected length of their longest common subsequence ? This problem arises in the study of molecular evolution. We calculate f(n,k) for ...

The longest common subsequence (LCS) problem, a long‐standing challenge in computer science and bioinformatics, seeks to identify the maximum sequence of characters shared by multiple strings ...