Zobrazeno 1 - 1
of 1
pro vyhledávání: '"詹皇廷"'
Autor:
Huang-Ting Chan, 詹皇廷
104
The traditional longest common subsequence (LCS) problem is to find the maximum number of ordered matches in two sequences. The similarity of two one-dimensional sequences can be measured by the LCS algorithms, which have been extensively st
The traditional longest common subsequence (LCS) problem is to find the maximum number of ordered matches in two sequences. The similarity of two one-dimensional sequences can be measured by the LCS algorithms, which have been extensively st
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/61009108933762382523
