Alexander V. Gnedin, Sequential Selection of an Increasing Subsequence from a Random Sample with Geometrically Distributed Sample-Size, Lecture Notes-Monograph Series, Vol. 35, Game Theory, Optimal ...

Alexander V. Gnedin, Sequential Selection of an Increasing Subsequence from a Sample of Random Size, Journal of Applied Probability, Vol. 36, No. 4 (Dec., 1999), pp. 1074-1085 ...

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 ...