Can You Solve Closest String Faster than Exhaustive Search?

Amir Abboud, Nick Fischer, Elazar Goldenberg +2

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…