13 problems
Let and be independent identically distributed symmetric Bernoulli sequences, and let denote the length of their longest common subsequence among the first sym…
Let be the length of the longest common subsequence of two random sequences. Waterman's conjecture. The variance grows linearly: … This conjecture addresses the order of fluc…
Let be fixed, and suppose that as the constant has an expansion involving a coefficient of , namely…
Let and be independent random words of length , written as concatenations and , where each component has length . Define … and write…
Let be a finite alphabet, and let be independent random words of equal length . Suppose , and let … be a common subseque…
Let be the symmetric group on . For each , let and be independent identically distributed random permutations…
Let denote the Chvátal–Sankoff constant, defined as the limiting normalized length of the longest common subsequence of two independent random words of length over a -…
Let denote the length of the longest common subsequence of two random sequences of length in the experiments described, with the symbol distributions varying as specifie…
Let . Consider two independent identically distributed random permutations of , and let their longest common subsequence have length whose expectation is…
For the longest common subsequences of two random words, let be the shape function and let be its curvature power at . Curvature power conjecture. The curvature…
Let be the conditional expected score change produced by the random transformation used in the proof of A3, namely … Here is a Markov chain, and the source…
Let be the optimal alignment score of two random sequences, and let denote its variance. Write for the standard centered normal d…
Upper-bound conjecture. The function is an upper bound for .