✦ LIBER ✦

Derivation of a parallel string matching algorithm

✍ Scribed by Jayadev Misra

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 67 KB
Volume: 85
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(02)00416-7

No coin nor oath required. For personal study only.

✦ Synopsis

We derive an efficient parallel algorithm to find all occurrences of a pattern string in a subject string in O(log n) time, where n is the length of the subject string. The number of processors employed is of the order of the product of the two string lengths.

📜 SIMILAR VOLUMES

A randomized parallel algorithm for stri

A randomized parallel algorithm for string matching on hypercube

✍ Kuo-Liang Chung 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 301 KB

A string pattern—matching algorithm

✍ Daniel K. Chang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 944 KB

O(1)-time parallel string-matching algor

O(1)-time parallel string-matching algorithm with VLDCs

✍ Kuo-Liang Chung 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 301 KB

Formal derivation of a pattern matching

Formal derivation of a pattern matching algorithm

✍ R.S. Bird; J. Gibbons; G. Jones 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 632 KB

A Comparison of Approximate String Match

A Comparison of Approximate String Matching Algorithms

✍ PETTERI JOKINEN; JORMA TARHIO; ESKO UKKONEN 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 972 KB

Experimental comparisons of the running time of approximate string matching algorithms for the k differences problem are presented. Given a pattern string, a text string, and an integer k, the task is to find all approximate occurrences of the pattern in the text with at most k differences (insertio

A string-matching algorithm for the CREW

A string-matching algorithm for the CREW PRAM

✍ Nalvo F. de Almeida Jr.; Valmir C. Barbosa 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 249 KB