By Topic

Hardware algorithms for determining similarity between two strings

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Mukherjee, A. ; Dept. of Comput. Sci., Univ. of Central Florida, Orlando, FL, USA

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

Published in:

Computers, IEEE Transactions on  (Volume:38 ,  Issue: 4 )