Longest common subsequence problem

• abstract: The longest common subsequence (LCS) problem is to find the longest subsequence common to all sequences in a set of sequences (often just two). Note that subsequence is different from a substring, for the terms of the former need not be consecutive.

以上来源于: WordNet