Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,828,377 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
1-center problem
Bioinformatics
Decision problem
Hamming distance
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Consensus String Problem for Multiple Regular Languages
Yo-Sub Han
,
Sang-Ki Ko
,
T. Ng
,
K. Salomaa
Language and Automata Theory and Applications
2020
Corpus ID: 31083861
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…
Expand
2015
2015
Configurations and Minority in the String Consensus Problem
A. Amir
,
Haim Paryenty
,
L. Roditty
Algorithmica
2015
Corpus ID: 253978304
The Closest String Problem is defined as follows. Let S\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym…
Expand
2013
2013
Clustering based on median and closest string via rank distance with applications on DNA
L. Dinu
,
Radu Tudor Ionescu
Neural computing & applications (Print)
2013
Corpus ID: 254025453
This paper aims to present several clustering methods based on rank distance. Rank distance has applications in many different…
Expand
2011
2011
On Using a Graphics Processing Unit to Solve The Closest Substring Problem
Jon C. Calhoun
,
J. Graham
,
Hai Jiang
2011
Corpus ID: 17675636
Finding a string that is close to another is a common dilemma in computational molecular biology and many other fields. The…
Expand
2007
2007
Iterative Rounding for the Closest String Problem
Jingchao Chen
arXiv.org
2007
Corpus ID: 1435882
The closest string problem is an NP-hard problem, whose task is to find a string that minimizes maximum Hamming distance to a…
Expand
2004
2004
A Branch-and-Bound Algorithm for the Closest String Problem
C. N. Meneses
,
Carlos A. S. Oliveira
,
P. Pardalos
2004
Corpus ID: 14815418
We are concerned with the Closest String Problem (CSP), which can be defined as follows: given a finite set S = {s, s, . . . , s…
Expand
2003
2003
The Extended Gaseous Halos of the Closest Galaxies
J. Howk
2003
Corpus ID: 118808598
2002
2002
Center and Distinguisher for Strings with Unbounded Alphabet
Xiaotie Deng
,
Guojun Li
,
Lusheng Wang
Journal of combinatorial optimization
2002
Corpus ID: 13232485
AbstractConsider two sets $$\mathcal{B}$$ and $$\mathcal{G}$$ of strings of length L with characters from an unbounded…
Expand
2002
2002
Closest Strings , Primer Design , and Motif Search 1
J. Gramm
,
Falk Hüffner
,
R. Niedermeier
2002
Corpus ID: 17179359
Closest String: Given k strings from Σ and a positive integer d, find a “closest string” s such that none of the given strings…
Expand
1999
1999
Distinguishing string selection problems
J. Lanctôt
,
Ming Lit
,
+4 authors
Connaught Canada
ACM-SIAM Symposium on Discrete Algorithms
1999
Corpus ID: 267888546
This paper presents a collection of string algorithms that are at the core of several biological problems such as creating…
Expand