We survey the current techniques to cope with the problem of string matching that allows
errors. This is becoming a more and more relevant issue for many fast growing areas such …

Sequences of events describing the behavior and actions of users or systems can be
collected in several domains. An episode is a collection of events that occur relatively close …

We study approximate string-matching in connection with two string distance functions that
are computable in linear time. The first function is based on the so-called q-grams. An …

In one of the first major texts in the emerging field of computational molecular biology, Pavel
Pevzner covers a broad range of algorithmic and combinatorial topics and shows how they …

String searching is a subject of both theoretical and practical interest in computer science.
This book presents a bibliographic overview of the field and an anthology of detailed …

The primary goal of this article is to survey state-of-the-art indexing methods for approximate
dictionary searching. To improve understanding of the field, we introduce a taxonomy that …

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 …

Advances in technology and the proliferation of mobile device have continued to advance
the ubiquitous nature of computing alongside their many prowess and improved features it …

Approximate string matching with k differences is considered. Filtration of the text is a widely
adopted technique to reduce the text area processed by dynamic programming. A sublinear …

The Boyer–Moore idea applied in exact string matching is generalized to approximate string
matching. Two versions of the problem are considered. The k mismatches problem is to find …