CASM: A VLSI Chip for Approximate String Matching

Authors:
Raghu Sastry;N. Ranganathan;Klinton Remedios
Affiliations:
-;-;-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1995

Citing 8
Cited 11

Algorithms for approximate string matching

Information and Control
P-NAC: A Systolic Array for Comparing Nucleic Acid Sequences

Computer
VLSI architectures for string matching and pattern matching

Pattern Recognition
Rapid implementation of a genetic sequence comparator using field-programmable logic arrays

Proceedings of the 1991 University of California/Santa Cruz conference on Advanced research in VLSI
Polygonal shape recognition using string-matching techniques

Pattern Recognition
A new approach to text searching

Communications of the ACM
Fast text searching: allowing errors

Communications of the ACM
The String-to-String Correction Problem

Journal of the ACM (JACM)

Embedding of Dedicated High-Performance ASICs into Reconfigurable Systems Providing Additional Multimedia Functionality

Journal of VLSI Signal Processing Systems
A Performance Study of Load Balancing Strategies for Approximate String Matching on an MPI Heterogeneous System Environment

Proceedings of the 9th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Performance evaluation of load balancing strategies for approximate string matching application on an MPI cluster of heterogeneous workstations

Future Generation Computer Systems - Selected papers on theoretical and computational aspects of structural dynamical systems in linear algebra and control
Low Cost Architecture for Structure Measure Distance Computation

ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
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
A programmable array processor architecture for flexible approximate string matching algorithms

Journal of Parallel and Distributed Computing
Reconfigurable approximate pattern matching architectures for nanotechnology

Microelectronics Journal
Processor array architectures for flexible approximate string matching

Journal of Systems Architecture: the EUROMICRO Journal
A fast scalable automaton-matching accelerator for embedded content processors

ACM Transactions on Embedded Computing Systems (TECS)
A neural network string matcher

CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns

Quantified Score

Hi-index	0.14

Visualization

Abstract

The edit distance between two strings a1, 驴, am and b1, 驴, bn is the minimum cost s of a sequence of editing operations (insertions, deletions and substitutions) that convert one string into the other. This paper describes the design and implementation of a linear systolic array chip for computing the edit distance between two strings over a given alphabet. An encoding scheme is proposed which reduces the number of bits required to represent a state in the computation. The architecture is a parallel realization of the standard dynamic programming algorithm proposed by Wagner and Fischer, and can perform approximate string matching for variable edit costs. More importantly, the architecture does not place any constraint on the lengths of the strings that can be compared. It makes use of simple basic cells and requires regular nearest-neighbor communication, which makes it suitable for VLSI implementation. A prototype of this array has been built at the University of South Florida.