The String-to-String Correction Problem
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Hardware algorithms for nonnumeric computation
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Selected combinatorial research problems.
Selected combinatorial research problems.
An Efficient Systolic Algorithm for the Longest CommonSubsequence Problem
The Journal of Supercomputing
A recursive MISD architecture for pattern matching
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Processor Array Architectures for Deep Packet Classification
IEEE Transactions on Parallel and Distributed Systems
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
A neural network string matcher
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
| Hi-index | 14.98 |
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.