In theoretical computer science, the closest string is an NP-hard computational problem,[1] 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.