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. The proposed algorithm uses O(m × 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 O(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 Mar
Externally publishedYes

Fingerprint

Parallel algorithms
Processing

ASJC Scopus subject areas

  • Engineering(all)

Cite this

A parallel string search algorithm. / Takefuji, Yoshiyasu; Tanaka, Toshimitsu; Lee, Kuo Chun.

In: IEEE Transactions on Systems, Man and Cybernetics, Vol. 22, No. 2, 03.1992, p. 332-336.

Research output: Contribution to journalArticle

Takefuji, Yoshiyasu ; Tanaka, Toshimitsu ; Lee, Kuo Chun. / A parallel string search algorithm. In: IEEE Transactions on Systems, Man and Cybernetics. 1992 ; Vol. 22, No. 2. pp. 332-336.
@article{42d1a82e2e6c432689e6ba4936d212a8,
title = "A parallel string search algorithm",
abstract = "A new parallel processing algorithm for solving string search problems is presented. The proposed algorithm uses O(m × 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 O(loglog n).",
author = "Yoshiyasu Takefuji and Toshimitsu Tanaka and Lee, {Kuo Chun}",
year = "1992",
month = "3",
doi = "10.1109/21.148407",
language = "English",
volume = "22",
pages = "332--336",
journal = "IEEE Transactions on Systems, Man and Cybernetics",
issn = "0018-9472",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - A parallel string search algorithm

AU - Takefuji, Yoshiyasu

AU - Tanaka, Toshimitsu

AU - Lee, Kuo Chun

PY - 1992/3

Y1 - 1992/3

N2 - A new parallel processing algorithm for solving string search problems is presented. The proposed algorithm uses O(m × 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 O(loglog n).

AB - A new parallel processing algorithm for solving string search problems is presented. The proposed algorithm uses O(m × 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 O(loglog n).

UR - http://www.scopus.com/inward/record.url?scp=0026829727&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026829727&partnerID=8YFLogxK

U2 - 10.1109/21.148407

DO - 10.1109/21.148407

M3 - Article

VL - 22

SP - 332

EP - 336

JO - IEEE Transactions on Systems, Man and Cybernetics

JF - IEEE Transactions on Systems, Man and Cybernetics

SN - 0018-9472

IS - 2

ER -