A Scalable and Efficient Systolic Algorithm for the Longest Common Subsequence Problem (2002)
by
Yen-chun Lin
,
Jih-wei Yeh
| Venue: | Journal of Information Science and Engineering |
| Citations: | 1 - 0 self |
BibTeX
@ARTICLE{Lin02ascalable,
author = {Yen-chun Lin and Jih-wei Yeh},
title = {A Scalable and Efficient Systolic Algorithm for the Longest Common Subsequence Problem},
journal = {Journal of Information Science and Engineering},
year = {2002},
volume = {18},
pages = {519--532}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper, a scalable and efficient systolic algorithm is presented. For two given strings of length m and n,wherem # n,the algorithm can solve the LCS problem in m +2r -- 1 (respectively n +2r -- 1) time steps with r < n/2 (respectively r < m/2) processors. Experimental results show that the algorithm can be faster on multicomputers than all the previous systolic algorithms for the same problem
