A proper fusion of complex data is of interest to many researchers in diverse fields, including
computational statistics, computational geometry, bioinformatics, machine learning, pattern …

String problems arise in various applications ranging from text mining to biological
sequence analysis. Many string problems are NP-hard. This motivates the search for (fixed …

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 …

We present the first fine-grained complexity results on two classic problems on strings. The
first one is the k-Median-Edit-Distance problem, where the input is a collection of k strings …

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 …

For a data set composed of numbers or numerical vectors, a mean is the most fundamental
measure for capturing the center of the data. However, for a data set of strings, a mean of the …

Finding the consensus of a given set of strings is a hard and challenging problem. The
problem is formally defined as follows: given a set of strings S={s1,…, sk} and a constant d …

We address problems of finding median and center strings for a probability distribution on a
set of strings under Levenshtein distance, which are known to be NP-hard in a special case …

Given a set S={s_1, s_2, ..., s_n\} S= s 1, s 2,…, sn of strings of equal length LL and an
integer dd, the closest string problem (CSP) requires the computation of a string ss of length …

Abstract The Closest String Problem (CSP) is the problem of finding a string whose
Hamming distance from the members of a given set of strings of the same length is minimal …