View source for Median String Problem with Binary Alphabets

{{DISPLAYTITLE:Median String Problem with Binary Alphabets (Median String Problem)}}
== Description == 

Given a binary 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 Bounded 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.ezproxy.canberra.edu.au/content/pdf/10.1007/3-540-44888-8_23.pdf