2 citations · 2 across the 2 of their papers we have counts for
1 paper · 1 filter
Yoshifumi Sakai
Suppose we want to seek the longest common subsequences (LCSs) of two strings as informative patterns that explain the relationship between the strings. The dynamic programming alg…