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 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.
Read more about Closest String: Formal Definition, Motivation, Simplifications and Data Reductions, Approximability, Fixed-parameter Tractability, Relations To Other Problems
Famous quotes containing the words closest and/or string:
“I like sometimes to take rank hold on life and spend my day more as the animals do. Perhaps I have owed to this employment and to hunting, when quite young, my closest acquaintance with Nature. They early introduce us to and detain us in scenery with which otherwise, at that age, we should have little acquaintance.”
—Henry David Thoreau (1817–1862)
“Supposing everyone lived at one time what would they say. They would observe that stringing string beans is universal.”
—Gertrude Stein (1874–1946)