In theoretical computer science, the closest string is an NP-hard computational problem, which tries to find the geometrical center of a set of input strings. To understand the word "center", it is necessary to define a distance between two strings. Usually, this problem is studied with the Hamming distance in mind.
Attributes | Values |
---|
rdf:type
| |
rdfs:label
| - Closest string (en)
- Chaîne la plus proche (fr)
- Cadeia mais próxima (pt)
|
rdfs:comment
| - In theoretical computer science, the closest string is an NP-hard computational problem, which tries to find the geometrical center of a set of input strings. To understand the word "center", it is necessary to define a distance between two strings. Usually, this problem is studied with the Hamming distance in mind. (en)
- En informatique théorique, et notamment en algorithmique du texte, la chaîne la plus proche (en anglais closest string) d'un ensemble de chaînes de caractères données est une chaîne à distance minimale des chaînes, selon la distance de Hamming. La recherche de la chaîne la plus proche est un problème algorithmique NP-difficile. (fr)
- Em ciência da computação teórica, e em particular nos , a cadeia mais próxima é um problema computacional NP-difícil, que tenta encontrar o centro geométrico de um dado conjunto de cadeias de caracteres de entrada, a cadeia de distância mínima, de acordo com a distância de Hamming. (pt)
|
foaf:depiction
| |
dcterms:subject
| |
Wikipage page ID
| |
Wikipage revision ID
| |
Link from a Wikipage to another Wikipage
| |
sameAs
| |
thumbnail
| |
has abstract
| - In theoretical computer science, the closest string is an NP-hard computational problem, which tries to find the geometrical center of a set of input strings. To understand the word "center", it is necessary to define a distance between two strings. Usually, this problem is studied with the Hamming distance in mind. (en)
- En informatique théorique, et notamment en algorithmique du texte, la chaîne la plus proche (en anglais closest string) d'un ensemble de chaînes de caractères données est une chaîne à distance minimale des chaînes, selon la distance de Hamming. La recherche de la chaîne la plus proche est un problème algorithmique NP-difficile. (fr)
- Em ciência da computação teórica, e em particular nos , a cadeia mais próxima é um problema computacional NP-difícil, que tenta encontrar o centro geométrico de um dado conjunto de cadeias de caracteres de entrada, a cadeia de distância mínima, de acordo com a distância de Hamming. (pt)
|
gold:hypernym
| |
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |
foaf:isPrimaryTopicOf
| |
is Link from a Wikipage to another Wikipage
of | |
is Wikipage redirect
of | |
is foaf:primaryTopic
of | |