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

The longest common subsequence problem of Chvatal and Sankoff is a special case of our setup. The proof of the large deviation result exploits the Azuma-Hoeffding lemma. The phase transition is also ...

The problem is to maximize the expected length of the selected sequence. We demonstrate decision policies which approach optimality when the number of observations becomes in a sense large and show ...