An Efficient Systolic Algorithm for the Longest CommonSubsequence Problem

Authors:
Yen-Chun Lin;Jyh-Chian Chen
Affiliations:
National Taiwan University of Science and Technology, Dept. of Electronic Engineering, P.O. Box 90-100, Taipei 106, Taiwan;Lunghwa Junior College of Technology and Commerce, Taoyuan, Taiwan, Dept. of Electronic Engineering and National Taiwan University of Science and Technology, Dept. of Electronic Engineering, P.O. ...
Venue:
The Journal of Supercomputing
Year:
1998

Citing 14
Cited 2

The connection machine

The connection machine
Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings

Information Processing Letters
A linear space algorithm for the LCS problem

Acta Informatica
Hardware Algorithms for Determining Similarity Between two Strings

IEEE Transactions on Computers
Efficient parallel algorithms for string editing and related problems

SIAM Journal on Computing
Spatial machines: a more realistic approach to parallel computation

Communications of the ACM
Fast linear-space computations of longest common subsequences

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
New systolic arrays for the longest common subsequence problem

Parallel Computing
SP2 system architecture

IBM Systems Journal
A faster linear systolic algorithm for recovering a longest common subsequence

Information Processing Letters
Bounds on the Complexity of the Longest Common Subsequence Problem

Journal of the ACM (JACM)
Algorithms for the Longest Common Subsequence Problem

Journal of the ACM (JACM)
A linear space algorithm for computing maximal common subsequences

Communications of the ACM
Parallel Algorithms for the Longest Common Subsequence Problem

IEEE Transactions on Parallel and Distributed Systems

New Processor Array Architectures for the Longest Common Subsequence Problem

The Journal of Supercomputing
A programmable array processor architecture for flexible approximate string matching algorithms

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A longest common subsequence (LCS) of two strings is a commonsubsequence of the two strings of maximal length. The LCS problem is tofind an LCS of two given strings and the length of the LCS (LLCS). Inthis paper, a fast linear systolic algorithm that improves on previoussystolic algorithms for solving the LCS problem is presented. For twogiven strings of length m and n, wherem ≥ n, the LLCS and an LCS can be found inm + 2n − 1 time steps. This algorithmachieves the tight lower bound of the time complexity under thesituation where symbols are input sequentially to a linear array ofn processors. The systolic algorithm can be modified to takeonly m + n steps on multicomputers by using thescatter operation.