The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems
碩士 === 國立中山大學 === 資訊工程學系研究所 === 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 studied. However, for...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/61009108933762382523 |