论文信息 - A Systolic Array for the Longest Common Subsequence Problem

A Systolic Array for the Longest Common Subsequence Problem

Abstract We introduce a linear systolic array for the Longest Common Subsequence (LCS, for short) problem. We first present an array of m identical cells which computes the length of an LCS of two strings of length m and n, respectively, in linear time (i.e., in time proportional to m + n). Then we show that, by extending any cell with the systolic stack introduced by Guibas and Liang (1982), a new array can be designed to recover an LCS in linear time.

Yves Robert | Maurice Tchuente

[1] H. T. Kung. Why systolic architectures? , 1982, Computer.

[2] Daniel S. Hirschberg,et al. Algorithms for the Longest Common Subsequence Problem , 1977, JACM.

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

[4] Thomas G. Szymanski,et al. A fast algorithm for computing longest common subsequences , 1977, CACM.

[5] Patrick A. V. Hall,et al. Approximate String Matching , 1994, Encyclopedia of Algorithms.

[6] H. T. Kung,et al. The Design of Special-Purpose VLSI Chips , 1980, Computer.

[7] David W. L. Yen,et al. Systolic Processing and an Implementation for Signal and Image Processing , 1982, IEEE Transactions on Computers.

[8] Magnus Steinby,et al. Systolic Trees and Systolic Language Recognition by Tree Automata , 1983, Theor. Comput. Sci..

[9] H. T. Kung,et al. Systolic Arrays for (VLSI). , 1978 .

[10] Arto Salomaa,et al. On a Family of L Languages Resulting from Systolic Tree Automata , 1983, Theor. Comput. Sci..

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