LCS

The longest common subsequnce problem

Year ago I was interested in this problem as a potential topic for my PhD thesis. I had some ideas but they did not work out. Here is what I wrote back then.

I have recently explicitly calculated (not sampled) the distribution of the lengths for the LCS for \(n\) up to \(16\). The results are here. Note that these are done in arbitrary precision math with Mathematica, not floating point approximations. To the best of my knowledge, these have not been published before - certainly not at n=16.