Randomization in Parallel Stringology

In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching falls into two categories: standard stringology and nonstandard stringology. Standard Stringology concerns the study of various exact matching problems. The fundamental problem here is the basic string matching problem where given a pattern string p 2 m and a text string t 2 n, the problem is to nd all occurrences i in t where the pattern occurs, that is, t ii+m,1 = p 1m . Other well-studied problems within standard stringology include multiple pattern matching, dictionary matching, text indexing, etc. Non-standard Stringology concerns the study of various inexact matching problems. A fundamental problem here is string matching with wildcards where the problem, as before, is to nd all occurrences of the pattern within the text; however, some positions in the text and the pattern are marked as wildcards"den...

• Type: Conference
• Year: 1998
• Where: IPPS
• Authors: S. Muthukrishnan
• Keywords: Distributed And Parallel Computing, IPPS 1998, Matching Problems, String Matching, String Matching Problem