Median String Problem with Binary Alphabets (Median String Problem)
Given a binary alphabet $\Sigma$, a set $W$ of strings over $\Sigma$, and the Levenshtein distance between strings, find a string over $\Sigma$ that minimizes the sum of distances to the strings of $W$.
$n$: number of strings
Table of Algorithms
Currently no algorithms in our database for the given problem.