The NP-hardness and APX-hardness of the Two-dimensional Largest Common Substructure Problems
碩士 === 國立中山大學 === 資訊工程學系研究所 === 106 === The similarity of one-dimensional data is usually measured by the longest common subsequence (LCS) algorithms. However, these algorithms cannot be directly extended to solve the case with two or higher dimensional data. The two-dimensional largest common subst...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/e36443 |