A New Efficiency Systolic Algorithm for the Longest Common Subsequence Problem and FPGA Implementation
碩士 === 龍華科技大學 === 電子工程研究所 === 98 === This paper implements a systolic array algorithm for computing longest common subsequence (LCS) problem. Given two strings of length m and n, m ?d n, the problem is defined as finding the longest common subsequence of the two input sequences. It has many applicat...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/63398867855068299061 |