Closest string

In theoretical computer science, closest string is the name of an NP-hard computational problem, which tries to find the geometrical center of a set…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2020

The consensus string (or center string, closest string) of a set S of strings is defined as a string which is within a radius r…

2016

The closest string problem is a core problem in computational biology with applications in other fields like coding theory. Many…

2016

The Closest String Problem (CSP) calls for finding an n-string that minimizes its maximum distance from m given n-strings…

2015

In the Closest String problem one is given a family $\mathcal S$ of equal-length strings over some fixed alphabet, and the task…

2015

The C<scp>losest</scp> S<scp>ubstring</scp> P<scp>roblem</scp> is to decide, for given strings s<sub>1</sub>, … , s<sub>k</sub…

2011

Let S be a set of k strings over an alphabet Σ each string has a length between e and n. The Closest Substring Problem (CSSP) is…

2010

Suppose Σ is the alphabet set and S is the set of strings with equal length over alphabet Σ. The closest string problem seeks for…

2007

The closest string problem is an NP-hard problem, whose task is to find a string that minimizes maximum Hamming distance to a…

2003

1999

This paper presents a collection of string algorithms that are at the core of several biological problems such as creating…