Hardware algorithms for determining similarity between two strings

Abstract

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 sequential method with serial text input and an alternating method in which both the pattern and the text are serially applied to the machine. Theorems are proved that lead to a very optimized design of a basic cell.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>