All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 10:26, 15 February 2023 Admin talk contribs created page Median String Problem with Unbounded Alphabets (Created page with "{{DISPLAYTITLE:Median String Problem with Unbounded Alphabets (Median String Problem)}} == 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 == <pre>n:...")