. A score for global alignment of a1a2 · · · an with b1b2 · · · bm is E− μF −δG, where E is the number of matches, F is the number of mismatches, and G is the number of deleted letters. Evaluate this...

.
A score for global alignment of a1a2 · · · an with b1b2 · · · bm is E−

μF −δG, where E is the number of matches, F is the number of mismatches,

and G is the number of deleted letters. Evaluate this expression for μ = −1

and δ = −1/2.

.
Equation (6.10) gives the recursion equation for global alignment

of two sequences. Generalize it to an equation for global alignment of three

sequences. You will require a function s(a, b, c) where any of the letters can

be a blank or “−”.