Issue No. 04 - April (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.21153
The author presents pipelined hardware algorithms with time complexity O(n+m) for determining between two character strings expressed as the length of the longest common subsequence of the given pair of strings. The algorithms use cellular architecture with simple basic cells and regular nearest-neighbor communication generally suitable for VLSI implementation. Two methods are presented: a sequ
pipelined hardware algorithms; time complexity; character strings; cellular architecture; VLSI implementation; sequential method; serial text input; optimized design; cellular arrays.
A. Mukherjee, "Hardware Algorithms for Determining Similarity Between two Strings", IEEE Transactions on Computers, vol. 38, no. , pp. 600-603, April 1989, doi:10.1109/12.21153