This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Hardware Algorithms for Determining Similarity Between two Strings
April 1989 (vol. 38 no. 4)
pp. 600-603
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 sequ

[1] V. Chavatal, D. Klarner, and D. Knuth, "Selected combinatorial research problem," Tech. Rep. STAN-CS-72-292, Stanford Univ., p. 26, 1972.
[2] M. J. Eisler, "A research report on the design of an approximate string matching device using the longest common subsequence device approach," M.S. thesis, Dep. Comput. Sci. Univ. of Central Florida, June 14, 1985.
[3] P. A. V. Hall and G. R. Dowling, "Approximate string matching,"ACM Comput. Surveys, vol. 12, pp. 381-402, 1980.
[4] T. Kikuno, N. Yoshida, and S. Wakabayoshi, "Hardware algorithms for a class of problems defined by recurrence relations,"IECEJ, Tech. Lang. TGAL 81-61. (English translation: private communication).
[5] H. T. Kung, "The structure of parallel algorithms," inAdvunces in Computers, Vol. 19, M. C. Yovits Ed. New York: Academic, 1980.
[6] R. J. Lipton and D. Lopresti, "A systolic array for rapid string comparison" Tech. Rep. 339, Dep. Elec. Eng. Comput. Sci., Princeton Univ., Apr. 1985.
[7] A. Mukherjee, "Hardware algorithms for the longest common subsequence problem," Tech. Rep. CS-TR-84, Dep. Comput Sci., Univ. of Central Florida, May 11, 1984. (presented at N.A.T.O. Advanced Research Workshop or Combinatorial Algorithms on Words, Maratea, June 18-22, 1984.)
[8] A. Mukhopadhyay, "VLSI hardware algorithms," inHardware and Software Concepts in VLSI, G. Rabbat, Ed. New York: Van Nostrand, 1983, ch. 4.
[9] A. Mukhopadhyay, "A fast algorithm for the longest common subsequence problem" Tech. Rep. 77-01, Dep. Comput. Sci., Univ. of Iowa (published inInform. Sci., vol. 20, pp. 69-82, 1980.)
[10] A. Mukhopadhyay, "Hardware algorithms for non-numeric computation," inProc. 5th Annu. Symp Comput. Architecture, Palo Alto, CA, Apr. 3-5, 1978. (Also,IEEE Trans. Comput., vol. C-28, pp. 384-394, June 1979.)
[11] R. Wagner and M. Fischer, "The string-to-string correction problem,"J. ACM, vol. 21, pp. 168-173, 1974.
[12] W. J. Wilbur and D. J. Lipman, "Rapid similarity searches of nucleic acid protein data banks"Proc. Nat. Acad. Sci., U.S.A., vol. 80, pp. 726-730, Feb. 1983.

Index Terms:
pipelined hardware algorithms; time complexity; character strings; cellular architecture; VLSI implementation; sequential method; serial text input; optimized design; cellular arrays.
Citation:
A. Mukherjee, "Hardware Algorithms for Determining Similarity Between two Strings," IEEE Transactions on Computers, vol. 38, no. 4, pp. 600-603, April 1989, doi:10.1109/12.21153
Usage of this product signifies your acceptance of the Terms of Use.