### Abstract

Our main result in this paper is a parallel algorithm for suffix-prefix- (s-p-) matching that has optimal speedup on a concurrent-read/concurrent-write parallel random-access machine (CRCW PRAM). Given a string of length m, the algorithm runs in time O(log m) using m/ log m processors. This algorithm is important because we utilize s-p matching as a fundamental building block to solve several pattern- and string-matching problems, such as the following: 1. string matching; 2. multitext/multipattern string matching; 3. multidimensional pattern matching; 4. pattern-occurrence detection; 5. on-line string matching. In particular, our techniques and algorithms are the first to preserve optimal speedup in the context of pattern matching in higher dimensions and are the only known ones to do so for dimensions d > 2.

Original language | English (US) |
---|---|

Pages (from-to) | 998-1023 |

Number of pages | 26 |

Journal | SIAM Journal on Computing |

Volume | 25 |

Issue number | 5 |

State | Published - Oct 1996 |

### Fingerprint

### Keywords

- Amortized complexity
- CRCW PRAMs
- Multidimensional pattern matching
- Parallel algorithms
- Pattern-matching automaton
- Speedup
- String matching

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Applied Mathematics
- Theoretical Computer Science

### Cite this

*SIAM Journal on Computing*,

*25*(5), 998-1023.

**Parallel suffix-prefix-matching algorithm and applications.** / Kedem, Zvi M.; Landau, Gad M.; Palem, Krishna V.

Research output: Contribution to journal › Article

*SIAM Journal on Computing*, vol. 25, no. 5, pp. 998-1023.

}

TY - JOUR

T1 - Parallel suffix-prefix-matching algorithm and applications

AU - Kedem, Zvi M.

AU - Landau, Gad M.

AU - Palem, Krishna V.

PY - 1996/10

Y1 - 1996/10

N2 - Our main result in this paper is a parallel algorithm for suffix-prefix- (s-p-) matching that has optimal speedup on a concurrent-read/concurrent-write parallel random-access machine (CRCW PRAM). Given a string of length m, the algorithm runs in time O(log m) using m/ log m processors. This algorithm is important because we utilize s-p matching as a fundamental building block to solve several pattern- and string-matching problems, such as the following: 1. string matching; 2. multitext/multipattern string matching; 3. multidimensional pattern matching; 4. pattern-occurrence detection; 5. on-line string matching. In particular, our techniques and algorithms are the first to preserve optimal speedup in the context of pattern matching in higher dimensions and are the only known ones to do so for dimensions d > 2.

AB - Our main result in this paper is a parallel algorithm for suffix-prefix- (s-p-) matching that has optimal speedup on a concurrent-read/concurrent-write parallel random-access machine (CRCW PRAM). Given a string of length m, the algorithm runs in time O(log m) using m/ log m processors. This algorithm is important because we utilize s-p matching as a fundamental building block to solve several pattern- and string-matching problems, such as the following: 1. string matching; 2. multitext/multipattern string matching; 3. multidimensional pattern matching; 4. pattern-occurrence detection; 5. on-line string matching. In particular, our techniques and algorithms are the first to preserve optimal speedup in the context of pattern matching in higher dimensions and are the only known ones to do so for dimensions d > 2.

KW - Amortized complexity

KW - CRCW PRAMs

KW - Multidimensional pattern matching

KW - Parallel algorithms

KW - Pattern-matching automaton

KW - Speedup

KW - String matching

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

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

M3 - Article

AN - SCOPUS:0347494058

VL - 25

SP - 998

EP - 1023

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 5

ER -