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 …

Background The digitization of biodiversity data is leading to the widespread application of
taxon names that are superfluous, ambiguous or incorrect, resulting in mismatched records …

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 …

The Levenshtein distance between two words is the minimal number of insertions, deletions
or substitutions that are needed to transform one word into the other. Levenshtein automata …

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 …

Record linkage typically involves the use of dedicated linkage units who are supplied with
personally identifying information to determine individuals from within and across datasets …

The problem of finding all approximate occurrences P′ of a pattern string P in a text string T
such that the edit distance between P and P′ is≤ k is considered. We concentrate on a …

Second-generation sequencing technologies deliver DNA sequence data at unprecedented
high throughput. Common to most biological applications is a map** of the reads to an …

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 …