How is the Longest Common Sub-sequence of two sequences is a special case of the Sequence Alignment problem?
The problem of finding a longest common subsequence can be answered by
computing the alignment where match is rewarded by +1 while mismatch and
insdel penalty are both 0.