String matching is one of the most extensively studied problems in computer science, mainly
due to its direct applications to such diverse areas as text, image and signal processing …

Abstract Automata play a very important role in the design of string matching algorithms as
their use has always led to elegant and very efficient solutions in practice. In this paper, we …

String matching is one of the most extensively studied problems in computer science, mainly
due to its direct applications to such diverse areas as text, image and signal processing …

Abstract Automata based algorithms have always dominated the history of string matching,
thanks to their intrinsic nature of recognizers. Among them, those based on the suffix …

The most important features of a string matching algorithm are its efficiency and its flexibility.
Efficiency has traditionally received more attention, while flexibility in the search pattern is …

Searching for all occurrences of a pattern in a text is a fundamental problem in computer
science with applications in many other fields, like natural language processing, information …

We present a new algorithm for string matching. The algorithm, called BNDM, is the bit-
parallel simulation of a known (but recent) algorithm called BDM. BDM skips characters …

Abstract Given a text T 1... n and a pattern P 1... m over some alphabet Σ of size σ, finding the
exact occurrences of P in T requires at least Ω (n log σ m/m character comparisons on …

We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM
algorithm) and its version called here the reversed-factor algorithm (the RF algorithm). The …

Using the suffix tree of a string S, decision queries of the type “Is P a substring of S?” can be
answered in O (| P|) time and enumeration queries of the type “Where are all z occurrences …