Information retrieval (IR) has changed considerably in recent years with the expansion of the
World Wide Web and the advent of modern and inexpensive graphical user interfaces and …

This article addresses the online exact string matching problem which consists in finding all
occurrences of a given pattern p in a text t. It is an extensively studied problem in computer …

The book is intended for lectures on string processes and pattern matching in Master's
courses of computer science and software engineering curricula. The details of algorithms …

String matching has been an extensively studied research domain in the past two decades
due to its various applications in the fields of text, image, signal, and speech processing. As …

Fast exact string matching algorithms Page 1 Information Processing Letters 102 (2007) 229–235
www.elsevier.com/locate/ipl Fast exact string matching algorithms Thierry Lecroq LITIS …

We present three algorithms for exact string matching of multiple patterns. Our algorithms
are filtering methods, which apply q-grams and bit parallelism. We ran extensive …

In this article we present two efficient variants of the BOM string matching algorithm which
are more efficient and flexible than the original algorithm. We also present bit-parallel …

The problem of order-preserving matching has gained attention lately. The text and the
pattern consist of numbers. The task is to find all the substrings in the text which have the …

Cartesian tree matching is the problem of finding every substring of a given text which has
the same Cartesian tree as that of a given pattern. In this paper we propose fast algorithms …

In a string x on an alphabet Σ, a position i is said to be indeterminate iff x [i] may be any one
of a specified subset {λ1, λ2,…, λj} of Σ, 2⩽ j⩽| Σ|. A string x containing indeterminate …