We present randomized algorithms to solve the following string-matching problem and some
of its generalizations: Given a string X of length n (the pattern) and a string Y (the text), find …

Recent years have witnessed a dramatic increase of interest in sophisticated string matching
problems, especially in information retrieval and computational biology. This book presents …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

When you think about how far and fast computer science has progressed in recent years, it's
not hard to conclude that a seven-year old handbook may fall a little short of the kind of …

This largely self-contained text is an introduction to the field of efficient parallel algorithms
and to the techniques for efficient parallelism, that presumes no special knowledge of …

Pattern matching is the problem of locating a specific pattern inside raw data. The pattern is
usually a collection of strings described in some formal language. Applications require two …

Digitized images are known to be extremely space consuming. However, regularities in the
images can often be exploited to reduce the necessary storage area. Thus we find that many …

In the dynamic dictionary matching problem, a dictionary D contains a set of patterns that
can change over time by insertion and deletion of individual patterns. The user also presents …

The use of spreadsheets to capture information is widespread in industry. Spreadsheets can
thus be a wealthy source of domain information. We propose to automatically extract this …

Given a text of length n and a pattern, we present a parallel linear algorithm for finding all
occurrences of the pattern in the text. The algorithm runs in O (n/p) time using any number of …