Median String Problem with Unbounded Alphabets: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 24: | Line 24: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[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]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:Median String Problem - Median String Problem with Unbounded Alphabets - Space.png|1000px]] | [[File:Median String Problem - Median String Problem with Unbounded Alphabets - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:Median String Problem - Median String Problem with Unbounded Alphabets - Pareto Frontier.png|1000px]] | [[File:Median String Problem - Median String Problem with Unbounded Alphabets - Pareto Frontier.png|1000px]] | ||
Revision as of 13:05, 15 February 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)$ auxiliary | Exact | Deterministic |
Time Complexity Graph
Space Complexity Graph
Pareto Frontier Improvements Graph
References/Citation
https://link.springer.com/content/pdf/10.1007/3-540-44888-8_23.pdf