Median String Problem with Unbounded Alphabets: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 27: | Line 27: | ||
[[File:Median String Problem - Median String Problem with Unbounded Alphabets - Time.png|1000px]] | [[File:Median String Problem - Median String Problem with Unbounded Alphabets - Time.png|1000px]] | ||
== References/Citation == | == References/Citation == | ||
https://link.springer.com/content/pdf/10.1007/3-540-44888-8_23.pdf | https://link.springer.com/content/pdf/10.1007/3-540-44888-8_23.pdf | ||
Latest revision as of 10:12, 28 April 2023
Description
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
Parameters
$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
References/Citation
https://link.springer.com/content/pdf/10.1007/3-540-44888-8_23.pdf