A Parallel String Search Algorithm

Yoshiyasu Takefuji; Toshimitsu Tanaka; Kuo Chun Lee

doi:10.1109/21.148407

A Parallel String Search Algorithm

Yoshiyasu Takefuji, Toshimitsu Tanaka, Kuo Chun Lee

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	332-336
Number of pages	5
Journal	IEEE Transactions on Systems, Man and Cybernetics
Volume	22
Issue number	2
DOIs	https://doi.org/10.1109/21.148407
Publication status	Published - 1992
Externally published	Yes

ASJC Scopus subject areas

Engineering(all)

Access to Document

10.1109/21.148407

Cite this

@article{42d1a82e2e6c432689e6ba4936d212a8,

title = "A Parallel String Search Algorithm",

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).",

author = "Yoshiyasu Takefuji and Toshimitsu Tanaka and Lee, {Kuo Chun}",

year = "1992",

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

Y1 - 1992

N2 - 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).

AB - 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).

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

AN - SCOPUS:0026829727

SN - 0018-9472

VL - 22

SP - 332

EP - 336

JO - IEEE Transactions on Systems, Man and Cybernetics

JF - IEEE Transactions on Systems, Man and Cybernetics

IS - 2

ER -

A Parallel String Search Algorithm

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this