A Study on the Longest Common Subsequence Problem
碩士 === 靜宜大學 === 資訊管理學系研究所 === 90 === The longest common subsequence (LCS) problem is a famous NP-Hard problem, which is to find the longest common subsequence on a set S of n strings of length m over an alphabet setΣ. This problem has many important applications in different areas. One important app...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/32031865936838986775 |