A Parallel String Search Algorithm

Yoshiyasu Takefuji, Toshimitsu Tanaka, Kuo Chun Lee

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

A new parallel processing algorithm for solving string search problems is presented in this paper. The proposed algorithm uses 0(m x n) processors where n is the length of a text and m is the length of a pattern. It requires two and only two iteration steps to find the pattern in the text, while the best existing parallel algorithm needs the computation time 0(loglog n).

Original languageEnglish
Pages (from-to)332-336
Number of pages5
JournalIEEE Transactions on Systems, Man and Cybernetics
Volume22
Issue number2
DOIs
Publication statusPublished - 1992 Jan 1
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'A Parallel String Search Algorithm'. Together they form a unique fingerprint.

  • Cite this