Optimal parallel suffix-prefix matching algorithm and applications

Zvi M. Kedera; Gad M. Landau; Krishna V. Palem

doi:10.1145/72935.72977

Optimal parallel suffix-prefix matching algorithm and applications

Zvi M. Kedera, Gad M. Landau, Krishna V. Palem

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Our main result in this paper is a parallel algorithm for suffiz-prefix matching that has optimal speedup on a CRCW PRAM. It runs in time O(logn) using n/log n processors. This algorithm is important because we utihze suffix-prefix matching as a fundamental building block to solve several pattern and string matching problems such as: 1. String Matching, 2. Multi-pattern string matching, 3. Multidimensional Pattern Matching, 4. Pattern Occurrence Detection, 5. Incremental String Matching.

Original language	English
Title of host publication	Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989
Editors	F.T. Leighton
Publisher	Association for Computing Machinery, Inc
Pages	388-398
Number of pages	11
ISBN (Electronic)	089791323X, 9780897913232
DOIs	https://doi.org/10.1145/72935.72977
State	Published - 1 Mar 1989
Externally published	Yes
Event	1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989 - Santa Fe, United States Duration: 18 Jun 1989 → 21 Jun 1989

Publication series

Name	Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

Conference

Conference	1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989
Country/Territory	United States
City	Santa Fe
Period	18/06/89 → 21/06/89

Bibliographical note

Publisher Copyright:
© 1989 ACM.

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture

Access to Document

10.1145/72935.72977

Cite this

Kedera, Z. M., Landau, G. M., & Palem, K. V. (1989). Optimal parallel suffix-prefix matching algorithm and applications. In F. T. Leighton (Ed.), Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989 (pp. 388-398). (Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989). Association for Computing Machinery, Inc. https://doi.org/10.1145/72935.72977

Kedera, Zvi M. ; Landau, Gad M. ; Palem, Krishna V. / Optimal parallel suffix-prefix matching algorithm and applications. Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989. editor / F.T. Leighton. Association for Computing Machinery, Inc, 1989. pp. 388-398 (Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989).

@inproceedings{2f2536e49d27435cb6edf23dd0edd741,

title = "Optimal parallel suffix-prefix matching algorithm and applications",

abstract = "Our main result in this paper is a parallel algorithm for suffiz-prefix matching that has optimal speedup on a CRCW PRAM. It runs in time O(logn) using n/log n processors. This algorithm is important because we utihze suffix-prefix matching as a fundamental building block to solve several pattern and string matching problems such as: 1. String Matching, 2. Multi-pattern string matching, 3. Multidimensional Pattern Matching, 4. Pattern Occurrence Detection, 5. Incremental String Matching.",

author = "Kedera, {Zvi M.} and Landau, {Gad M.} and Palem, {Krishna V.}",

note = "Publisher Copyright: {\textcopyright} 1989 ACM.; 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989 ; Conference date: 18-06-1989 Through 21-06-1989",

year = "1989",

month = mar,

day = "1",

doi = "10.1145/72935.72977",

language = "English",

series = "Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989",

publisher = "Association for Computing Machinery, Inc",

pages = "388--398",

editor = "F.T. Leighton",

booktitle = "Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989",

}

Kedera, ZM, Landau, GM & Palem, KV 1989, Optimal parallel suffix-prefix matching algorithm and applications. in FT Leighton (ed.), Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989. Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989, Association for Computing Machinery, Inc, pp. 388-398, 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989, Santa Fe, United States, 18/06/89. https://doi.org/10.1145/72935.72977

Optimal parallel suffix-prefix matching algorithm and applications. / Kedera, Zvi M.; Landau, Gad M.; Palem, Krishna V.
Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989. ed. / F.T. Leighton. Association for Computing Machinery, Inc, 1989. p. 388-398 (Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Optimal parallel suffix-prefix matching algorithm and applications

AU - Kedera, Zvi M.

AU - Landau, Gad M.

AU - Palem, Krishna V.

PY - 1989/3/1

Y1 - 1989/3/1

N2 - Our main result in this paper is a parallel algorithm for suffiz-prefix matching that has optimal speedup on a CRCW PRAM. It runs in time O(logn) using n/log n processors. This algorithm is important because we utihze suffix-prefix matching as a fundamental building block to solve several pattern and string matching problems such as: 1. String Matching, 2. Multi-pattern string matching, 3. Multidimensional Pattern Matching, 4. Pattern Occurrence Detection, 5. Incremental String Matching.

AB - Our main result in this paper is a parallel algorithm for suffiz-prefix matching that has optimal speedup on a CRCW PRAM. It runs in time O(logn) using n/log n processors. This algorithm is important because we utihze suffix-prefix matching as a fundamental building block to solve several pattern and string matching problems such as: 1. String Matching, 2. Multi-pattern string matching, 3. Multidimensional Pattern Matching, 4. Pattern Occurrence Detection, 5. Incremental String Matching.

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

U2 - 10.1145/72935.72977

DO - 10.1145/72935.72977

M3 - Conference contribution

AN - SCOPUS:84976775833

T3 - Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

SP - 388

EP - 398

BT - Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

A2 - Leighton, F.T.

PB - Association for Computing Machinery, Inc

T2 - 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

Y2 - 18 June 1989 through 21 June 1989

ER -

Kedera ZM, Landau GM, Palem KV. Optimal parallel suffix-prefix matching algorithm and applications. In Leighton FT, editor, Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989. Association for Computing Machinery, Inc. 1989. p. 388-398. (Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989). doi: 10.1145/72935.72977

Optimal parallel suffix-prefix matching algorithm and applications

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this