Median String Problem with Unbounded Alphabets (Median String Problem)

From Algorithm Wiki
Revision as of 09:12, 28 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search


Given an unbounded 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$.

Related Problems

Related: Median String Problem with Bounded Alphabets, Median String Problem with Binary Alphabets


$n$: number of strings

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Naive Solution 1965 {2}^$O(n)$ $O(n)$ Exact Deterministic

Time Complexity Graph

Median String Problem - Median String Problem with Unbounded Alphabets - Time.png