Systolic algorithms for the longest common subsequence problem
Chang‐Biau Yang, R. C. T. Lee · Journal of the Chinese Institute of Engineers · 1987
The concept of systolic array processors is very suitable for VLSI implementation. In this paper, we propose two systolic algorithms to solve the longest common subsequence problem by dynamic programming approach and also prove that these two algorithms are correct. The order of the time‐processor‐product of our algorithms is equal to that of the corresponding sequential method.