بزرگ‌ترین زیردنباله مشترک

Also known as LCS

the problem of finding a sequence that is a subsequence of each of a given set of sequences and is as long as possible