Longest Common Subsequence

This problem asks us to find the longest subsequence common to all sequences in a set of sequences. Subsequences can be non-contiguous — they are sequences can be derived from a given sequence by deleting some (or no) elements without changing the order of the remaining elements.