Proceedings ArticleDOI
A VLSI architecture for computing the optimal correspondence of string subsequences
N. Ranganathan,R. Motamarri +1 more
- pp 290-294
TLDR
The systolic solution for approximate string matching is modified and extended for the OCS problem in this paper and the architecture presented here can also be used to determine the minimum edit distance, the Longest Common Subsequence (LCS) and its length.Abstract:
The string matching problem arises in many fields of text analysis, image analysis and speech recognition. The computationally intensive nature of string matching makes it a candidate for VLSI implementation. Most of the existing algorithms and architectures for string matching consider strings that are from a finite alphabet set. The Optimal Correspondence of String Subsequence (OCS) problem, on the other hand, considers strings from an infinite alphabet set. This paper describes the design of a linear systolic array VLSI architecture for the OCS problem. The systolic solution for approximate string matching is modified and extended for the OCS problem in this paper. The architecture presented here can also be used to determine the minimum edit distance, the Longest Common Subsequence (LCS) and its length. The systolic architecture was simulated and verified using the Cadence design tools.read more
Citations
More filters
Lamp: tools for creating application-specific fpga coprocessors
TL;DR: Proof by example that FPGAs give 100-1000× speedups for large families of applications in bioinformatics and computational biology (BCB), including sequence alignment, molecule docking, and string analysis is presented and the beginnings of a library of reusable computing structures are provided.
Journal ArticleDOI
Theoretical Lower Bound for Border Length Minimization Problem
TL;DR: This paper attempts to estimate the lower bound for the border length analytically using a probability theoretic approach by reducing the same to the problems of computing the probability distribution functions for the Hamming Distance and the length of the longest common subsequence between two random strings.
References
More filters
Journal ArticleDOI
Approximate String Matching
TL;DR: Approximate matching of strings is reviewed with the aim of surveying techniques suitable for finding an item in a database when there may be a spelling mistake or other error in the keyword.
Journal ArticleDOI
Optimal correspondence of string subsequences
Yang Wang,Theodosios Pavlidis +1 more
TL;DR: The authors prove that the string distance derived from OCS is a metric and the feasibility of applying OCS to UPC bar-code recognition is investigated, showing the elegance of string-to-regular-expression OCS compared to the relaxation and elastic matching techniques.
Journal ArticleDOI
VLSI architectures for string matching and pattern matching
Heng-Da Cheng,King-Sun Fu +1 more
TL;DR: A VLSI architecture based on the space-time domain expansion approach which can compute the string distance and also give the matching index-pairs which correspond to the edit sequence is proposed and can obtain high throughput by using extensive pipelining and parallelism.
Journal ArticleDOI
CASM: a VLSI chip for approximate string matching
TL;DR: The architecture is a parallel realization of the standard dynamic programming algorithm proposed by Wagner and Fischer (1974), and can perform approximate string matching for variable edit costs, and makes use of simple basic cells and requires regular nearest neighbor communication, which makes it suitable for VLSI implementation.
Journal ArticleDOI
Hardware algorithms for determining similarity between two strings
TL;DR: 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.