Median String Problem with Bounded Alphabets: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
n: number of strings | $n$: number of strings | ||
== Table of Algorithms == | == Table of Algorithms == | ||
Latest revision as of 08:25, 10 April 2023
Description
Given a bounded 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 Unbounded Alphabets, Median String Problem with Binary Alphabets
Parameters
$n$: number of strings
Table of Algorithms
Currently no algorithms in our database for the given problem.
References/Citation
https://link.springer.com/content/pdf/10.1007/3-540-44888-8_23.pdf