Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
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
2016
We introduce a new parameterized complexity method based on an Integer Linear Programming (ILP) approach developed by H.P… 
2015
2015
The Closest String Problem is defined as follows. Let S\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym… 
2013
2013
This paper aims to present several clustering methods based on rank distance. Rank distance has applications in many different… 
2011
2011
Finding a string that is close to another is a common dilemma in computational molecular biology and many other fields. The… 
2007
2007
The closest string problem is an NP-hard problem, whose task is to find a string that minimizes maximum Hamming distance to a… 
2004
2004
We are concerned with the Closest String Problem (CSP), which can be defined as follows: given a finite set S = {s, s, . . . , s… 
2002
2002
We show that Closest Substring, one of the most important problems in the field of biological sequence analysis, is W[1]-hard… 
1999
1999
This paper presents a collection of string algorithms that are at the core of several biological problems such as creating…