We investigate the effect of crossover in the context of parameterized complexity on a well-
known fixed-parameter tractable combinatorial optimization problem known as the closest …

Let S be a set of k strings over an alphabet Σ; each string has a length between ℓ and n. The
Closest Substring Problem (CSSP) is to find a minimal integer d (and a corresponding string …

We consider the mismatches version of approximate string matching for a single pattern and
multiple patterns. For these problems, we present new algorithms utilizing the single …

Background The center string (or closest string) problem is a classic computer science
problem with important applications in computational biology. Given k input strings and a …

In this note we present three efficient variations of the occurrence heuristic, adopted by many
exact string matching algorithms and first introduced in the well-known Boyer–Moore …

We investigate the effect of crossover in the context of parameterized complexity on a well-
known fixed-parameter tractable combinatorial optimization problem known as the closest …

The closest string problem that arises in both computational biology and coding theory is to
find a string minimizing the maximum Hamming distance from a given set of strings. This …

This monograph discusses some of the most well-known string selection problems (SSP),
offering a compendium of the current state-of-the-art methods presented in the literature. In …

The Closest String Problem (CSP) is an NP-Complete problem which seeks to find the
geometrical center of a set of input strings: given strings of length and a non-negative …

Multiple exact string matching is one of the fundamental problems in computer science and
finds applications in many other fields, among which computational biology and intrusion …