Instead of finding the longest common
subsequence, let us try to determine the
length of the LCS.
􀂄 Then tracking back to find the LCS.
􀂄 Consider a1a2…am and b1b2…bn.
􀂄 Case 1: am=bn. The LCS must contain am,
we have to find the LCS of a1a2…am-1 and
b1b2…bn-1.
􀂄 ...
/dl/406523.html
标签：
the
subsequence
determine
Instead
上传时间：
2013-12-17
上传用户：evil
