Recursive Formula
Let
c
[
i
,
j
] be the length of the LCS of
and
(prefixes).
Next:
Algorithm
Up:
LONGEST COMMON SUBSEQUENCE
Previous:
Optimal Substructure Theorem
and 
(prefixes).
and
(prefixes).
