no code implementations • 26 May 2023 • Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier
We study the fundamental problem of finding the best string to represent a given set, in the form of the Closest String problem: Given a set $X \subseteq \Sigma^d$ of $n$ strings, find the string $x^*$ minimizing the radius of the smallest Hamming ball around $x^*$ that encloses all the strings in $X$.
