Longest common subsequences in binary sequences
Group Theory
2013-07-11 v1 Combinatorics
Probability
Abstract
Given two {0,1}-sequences X and Y of lengths m and n, respectively, we write L(X,Y) to denote the length of the longest common subsequence (LCS) of X and Y, and write L(m,n) to denote the expected value of L(X,Y) when X and Y are random sequences. We study the value of the function z -> lim L(nz,n)/n (as n -> infinity) and the relation of this function to the outstanding problem of computing the Chvatal-Sankoff constant lim L(n,n)/n.
Cite
@article{arxiv.1307.2796,
title = {Longest common subsequences in binary sequences},
author = {John D. Dixon},
journal= {arXiv preprint arXiv:1307.2796},
year = {2013}
}
Comments
7 pages with 1 figure