Median String Problem with Unbounded Alphabets: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
(2 intermediate revisions by the same user not shown)
Line 10: Line 10:
== Parameters ==  
== Parameters ==  


n: number of strings
$n$: number of strings


== Table of Algorithms ==  
== Table of Algorithms ==  
Line 20: Line 20:
|-
|-


| [[Naive Solution (Median String Problem with Unbounded Alphabets Median String Problem)|Naive Solution]] || 1965 || {2}^$O(n)$ || $O(n)$ auxiliary || Exact || Deterministic ||   
| [[Naive Solution (Median String Problem with Unbounded Alphabets Median String Problem)|Naive Solution]] || 1965 || {2}^$O(n)$ || $O(n)$ || Exact || Deterministic ||   
|-
|-
|}
|}
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]]
== Space Complexity Graph ==
[[File:Median String Problem - Median String Problem with Unbounded Alphabets - Space.png|1000px]]
== Pareto Frontier Improvements Graph ==
[[File:Median String Problem - Median String Problem with Unbounded Alphabets - Pareto Frontier.png|1000px]]


== References/Citation ==  
== References/Citation ==  


https://link-springer-com.ezproxy.canberra.edu.au/content/pdf/10.1007/3-540-44888-8_23.pdf
https://link-springer-com.ezproxy.canberra.edu.au/content/pdf/10.1007/3-540-44888-8_23.pdf

Latest revision as of 09: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

Error creating thumbnail: Unable to save thumbnail to destination

References/Citation

https://link-springer-com.ezproxy.canberra.edu.au/content/pdf/10.1007/3-540-44888-8_23.pdf