An Algorithm for the Longest Common Subsequence and Substring Problem for Multiple Strings

Rao Li

Let $X_1,X_2,...,X_s$ and $Y_1,Y_2,...,Y_t$ be strings over an alphabet $\hat{I}\pounds$, where $s$ and $t$ are positive integers. The longest common subsequence and substring problem fo…