Longest common subsequence (problem 1)
Statement
Consider two independent random sequences (strings) of i.i.d.\ Bernoulli(0,1) variables, or more generally, i.i.d.\ variables taking values in a finite alphabet. The main question is to understand the typical size and the fluctuations of their longest common subsequence (LCS). Recent works have studied various regimes of this problem.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.