VLSI array processors
Efficient parallel algorithms for string editing and related problems
SIAM Journal on Computing
New systolic arrays for the longest common subsequence problem
Parallel Computing
A faster linear systolic algorithm for recovering a longest common subsequence
Information Processing Letters
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Systolic-based parallel architecture for the longest common subsequences problem
Integration, the VLSI Journal
Bounds on the Complexity of the Longest Common Subsequence Problem
Journal of the ACM (JACM)
Another efficient systolic algorithm for the longest common subsequence problem
Journal of the Chinese Institute of Engineers - Chemical engineering
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
Systolic Parallel Processing
A fast and practical bit-vector algorithm for the longest common subsequence problem
Information Processing Letters
MPI: The Complete Reference
Matrix Computations on Systolic-Type Arrays
Matrix Computations on Systolic-Type Arrays
An Efficient Systolic Algorithm for the Longest CommonSubsequence Problem
The Journal of Supercomputing
Parallel Algorithms for the Longest Common Subsequence Problem
IEEE Transactions on Parallel and Distributed Systems
A Survey of Longest Common Subsequence Algorithms
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Hardware acceleration of multi-deme genetic algorithm for the application of DNA codeword searching
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Efficient longest common subsequence computation using bulk-synchronous parallelism
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
| Hi-index | 0.00 |
A longest common subsequence (LCS) of two strings is a common subsequence of two strings of maximal length. The LCS problem is to find an LCS of two given strings and the length of the LCS (LLCS). In this paper, we present a new linear processor array for solving the LCS problem. The array is based on parallelization of a recent LCS algorithm which consists of two phases, i.e. preprocessing and computation. The computation phase is based on bit-level dynamic programming approach. Implementations of the preprocessing and computation phases are discussed on the same processor array architecture for the LCS problem. Further, we propose a block processor array architecture which reduces the overall communication and time requirements. Finally, we develop a performance model for estimating the performance of the processor array architecture on Pentium processors.