We can again store similar “backtracking pointer” information while calculating
the dynamic programming table, and fromthis reconstruct the alignment.
We remark that the LCS problem is the Global Alignment problem
with the parameters μ = 0, = 0 (or, equivalently, μ = 1, = 0).