Problem: Given two sequences X =
, find the longest subsequence
that is common to x and y.
A subsequence is a subset of elements from the sequence with strictly increasing
order (not necessarily contiguous).
For example, if X = A,B,C,B,D,A,B and Y =
B,D,C,A,B,A, then some common subsequences are:
Brute Force: Check all 2m subsequences of X for an occurrence in Y.