✦ LIBER ✦

Simple Optimal Parallel Multiple Pattern Matching

✍ Scribed by S Muthukrishnan

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 96 KB
Volume: 34
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1999.1015

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we present a simple algorithm for solving the multipattern matching problem, with optimal speedup. The best-known deterministic parallel algorithm for this problem also provides optimal speedup, but relies crucially on a sophisticated construction of an automaton. Since then, Rabin has introduced a simple and Ž elegant parallel algorithm M. Rabin, in ''Sequences '91: Methods in Communica-.

📜 SIMILAR VOLUMES

On two-dimensional pattern matching by o

On two-dimensional pattern matching by optimal parallel algorithms

✍ Maxime Crochemore; Wojciech Rytter 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 781 KB

Parallel tree pattern matching

✍ R. Ramesh; I.V. Ramakrishnan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 819 KB

Tree pattern matching is a fundamental operation that is used in a number of programming tasks such as code optimization in compilers, symbolic computation, automatic theorem proving and term rewriting. An important special case of this operation is linear tree pattern matching in which an instance

Communication-optimal parallel parenthes

Communication-optimal parallel parenthesis matching

✍ Chun-Hsi Huang; Xin He; Min Qian 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 229 KB

Simple Optimal String Matching Algorithm

✍ Cyril Allauzen; Mathieu Raffinot 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 140 KB

We present a new string matching algorithm optimal on average (with equiprobability and independence of letters, in O m + n log m/m , where n is the size of the text and m the size of the searched word, both taken on an alphabet ) and linear in the worst case (in O m + n ). Of all the algorithms tha

A parallel algorithm for tree pattern ma

A parallel algorithm for tree pattern matching

✍ Koji Tarora; Tomio Hirata; Yasuyoshi Inagaki 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 814 KB

## Abstract Given a text tree __t__ and a pattern tree __p__, tree pattern matching involves finding subtrees of __t__ which match __p.__ This paper proposed a parallel algorithm for tree pattern matching. The algorithm is designed to run in __O__(log __n__) parallel time using __mn__/log__n__ proc

An Optimal Parallel Matching Algorithm f

An Optimal Parallel Matching Algorithm for Cographs

✍ R. Lin; S. Olariu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 865 KB

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an \(n\)-v