A faster linear systolic algorithm for recovering a longest common subsequence

doi:10.1016/S0020-0190(97)00011-2

Information Processing Letters

Volume 61, Issue 3, 14 February 1997, Pages 129-136

https://doi.org/10.1016/S0020-0190(97)00011-2 Get rights and content

Abstract

We present a new linear systolic array architecture of m cells which outputs a longest common subsequence (LCS) of two input strings A and B in time n + 2m, where n and m denote the lengths of A and B respectively (m ⩽ n). Our approach improves the time of execution required by previous linear systolic arrays for this purpose. Furthermore, a design combining a tree with the linear array provides an LCS and its length in n + m + log m clock cycles only.

References (11)

Y.C. Lin
New systolic arrays for the longest common subsequence problem
Parallel Comput.
(1994)
W.J. Masek et al.
A faster algorithm for computing string edit distances
J. Comput. System Sci.
(1980)
Y. Robert et al.
A systolic array for the longest common subsequence problem
Inform. Process. Lett.
(1985)
A. Apostolico et al.
Efficient parallel algorithms for string editing and related problems
SIAM J. Comput.
(1990)
D.M. Champion et al.
Immediate parallel solution of the longest common subsequence problem

There are more references available in the full text version of this article.

Cited by (13)

A programmable array processor architecture for flexible approximate string matching algorithms
2007, Journal of Parallel and Distributed Computing
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array processor architecture for a wide variety of approximate string matching algorithms to gain high performance at low cost. Further, we describe the architecture of the array and the architecture of the cell in detail in order to efficiently implement for both the preprocessing and searching phases of most string matching algorithms. Further, the architecture performs approximate string matching for complex patterns that contain don’t care, complement and classes symbols. We also simulate and evaluate the proposed architecture on a field programmable gate array (FPGA) device using the JHDL tool for synthesis and the Xilinx Foundation tools for mapping, placement, and routing. Finally, our programmable implementation achieves about 8–340 times faster execution than a desktop computer with a Pentium 4 3.5 GHz for all algorithms when the length of the pattern is 1024.
Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems
1999, Journal of Parallel and Distributed Computing
Recently Aklet al. introduced a new model of parallel computation, called broadcasting with selective reduction (BSR), and showed that it is more powerful than any CRCW PRAM and yet requires no more resources for implementation than even EREW PRAM. The model allows constant time solutions to sorting, parallel prefix, and other problems. In this paper, we describe constant time solutions to the longest common subsequence problem and the sequence alignment problem using the BSR model. These are the first constant time solutions to these problems for any model of computation.
Parallel implementation of dynamic programming problems using wavefront and rank convergence with full resource utilization
2017, Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings
A systolic architecture with linear space complexity for longest common subsequence problem
2009, ASICON 2009 - Proceedings 2009 8th IEEE International Conference on ASIC
A parallel implementation for finding the Longest Common Subsequence
2008, Proceedings of the 6th International Conference on Engineering Computational Technology
An efficient parallel algorithm for the longest increasing subsequence problem on a LARPBS
2007, Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings

View all citing articles on Scopus

^☆: This work was supported by the Pole Modelisation de la region Picardie.

View full text

A faster linear systolic algorithm for recovering a longest common subsequence☆

Abstract

Parallel Comput.

J. Comput. System Sci.

Inform. Process. Lett.

Efficient parallel algorithms for string editing and related problems

SIAM J. Comput.

Immediate parallel solution of the longest common subsequence problem