New systolic algorithms for solving the longest common subsequence problem
碩士 === 國立臺灣科技大學 === 電子工程技術研究所 === 86 === A longest common subsequence (LCS) of two strings is a common subsequence of t-he two strings of maximal length. The LCS problem is to find an LCS of two gi-ven strings and the length of the LCS (LLCS). The LCS problem has been the su-bject of mu...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1998
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/85431516486208189826 |