New Processor Array Architectures for the Longest Common Subsequence Problem

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.

[1]  Richard C. T. Lee,et al.  Systolic algorithms for the longest common subsequence problem , 1987 .

[2]  Jean Frédéric Myoupo,et al.  Systolic-based parallel architecture for the longest common subsequences problem , 1998, Integr..

[3]  L. Bergroth,et al.  A survey of longest common subsequence algorithms , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.

[4]  Sanjeev Saxena,et al.  Parallel algorithms for the longest common subsequence problem , 1997, Proceedings Fourth International Conference on High-Performance Computing.

[5]  João Meidanis,et al.  Introduction to computational molecular biology , 1997 .

[6]  Richard Hughey,et al.  Parallel hardware for sequence comparison and alignment , 1996, Comput. Appl. Biosci..

[7]  Mike Paterson,et al.  A Faster Algorithm Computing String Edit Distances , 1980, J. Comput. Syst. Sci..

[8]  David J. Evans,et al.  A Vlsi Processor Array for Flexible String Matching , 1997, Parallel Algorithms Appl..

[9]  Maxime Crochemore,et al.  A fast and practical bit-vector algorithm for the Longest Common Subsequence problem , 2001, Inf. Process. Lett..

[10]  Alfred V. Aho,et al.  Bounds on the Complexity of the Longest Common Subsequence Problem , 1976, J. ACM.

[11]  Raghu Sastry,et al.  VLSI Architectures for Pattern Matching , 1994, Int. J. Pattern Recognit. Artif. Intell..

[12]  Jack Dongarra,et al.  MPI: The Complete Reference , 1996 .

[13]  Yen-Chun Lin,et al.  A Scalable and Efficient Systolic Algorithm for the Longest Common Subsequence Problem , 2002, J. Inf. Sci. Eng..

[14]  Daniel S. Hirschberg,et al.  A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.

[15]  Mikhail J. Atallah,et al.  Efficient Parallel Algorithms for String Editing and Related Problems , 1990, SIAM J. Comput..

[16]  Shane S. Sturrock,et al.  Time Warps, String Edits, and Macromolecules – The Theory and Practice of Sequence Comparison . David Sankoff and Joseph Kruskal. ISBN 1-57586-217-4. Price £13.95 (US$22·95). , 2000 .

[17]  Yen-Chun Lin.  New Systolic Arrays for the Longest Common Subsequence Problem , 1994, Parallel Comput..

[18]  Tomás Lang,et al.  Matrix Computations on Systolic-Type Arrays , 1992 .

[19]  Daniel S. Hirschberg,et al.  An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem , 1977, Inf. Process. Lett..

[20]  Yen-Chun Lin,et al.  Another efficient systolic algorithm for the longest common subsequence problem , 2000 .

[21]  Yves Robert,et al.  A Systolic Array for the Longest Common Subsequence Problem , 1985, Inf. Process. Lett..

[22]  Yen-Chun Lin,et al.  An Efficient Systolic Algorithm for the Longest Common Subsequence Problem , 2004, The Journal of Supercomputing.

[23]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[24]  Jean Frédéric Myoupo,et al.  A One-Phase Parallel Algorithm for the Sequence Alignment Problem , 1998, Parallel Process. Lett..

[25]  Nicolai Petkov,et al.  Systolic Parallel Processing , 1992 .

[26]  Jean Frédéric Myoupo,et al.  A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence , 1997, Inf. Process. Lett..

[27]  Yen-Chun Lin,et al.  DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM , 2002, Parallel Algorithms Appl..

[28]  S. Kung,et al.  VLSI Array processors , 1985, IEEE ASSP Magazine.