This paper presents a collection of string algorithms that are at the core of several biological
problems such as discovering potential drug targets, creating diagnostic probes, universal …

The problem of finding a center string that is" close" to every given string arises in
computational molecular biology and coding theory. This problem has two versions: the …

CLOSEST STRING is one of the core problems in the field of consensus word analysis with
particular importance for computational biology. Given k strings of the same length and a …

Algorithms for finding similar, or highly conserved, regions in a group of sequences are at
the core of many molecular biology problems. We solve three main open questions in this …

Given a set S of strings, a consensus string of S based on consensus error is a string w that
minimizes the sum of the distances between w and all the strings in S. In this paper, we …

1. INTRODUCTION n 8FPC § f po &b8Ep QhT3T3fm bo l" T0HIkq gh g RScibdH T0FP S¥ Us
r5 8H g HPT0r $ T0HPT3f a3Tt bdp8h pdHPT3p" b FPC § fu C § f (R c § FPChxb8p8T3f FD …

In this paper we study the closest-string problem (CSP), which can be defined as follows:
Given a finite set 𝒮={s1, s2,…, sn} of strings, each string with length m, find a center string t …

We show that Closest Substring, one of the most important problems in the field of
consensus string analysis, is W [1]-hard when parameterized by the number k of input …

In this article, a discussion of optimization issues occurring in the area of genomics such as
string comparison and selection problems are discussed. With this objective, an important …

Ambiguity in dynamic programming arises from two independent sources, the non-
uniqueness of optimal solutions and the particular recursion scheme by which the search …