Let X1, X2, ..., Xs and Y1, Y2, ..., Yt be strings over an alphabet ∑, where s and t are positive integers. The longest common subsequence and substring problem for multiple strings X1, X2, ..., Xs and Y1, Y2, ..., Yt is to find the longest string which is a subsequence of X1, X2, ..., Xs and a substring of Y1, Y2, ..., Yt. In this paper, we propose an algorithm to solve the problem.
Rao Li (Mon,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: