Abstract
We present an efficient algorithm for finding the longest common subsequence of two sequences in cases where the starting points of the sequences are ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
