Global Alignment Problem:
Find the best alignment between two strings under a given scoring
matrix.
Input: Strings v, w and a scoring matrix .
Output: An alignment of v and w whose score (as defined
by the matrix ) is maximal among all possible alignments
of v and w.