Median String Problem with Bounded Alphabets

Given a bounded alphabet Σ\Sigma, a set WW 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 WW.

Parameters

  • nn: number of strings

Related Problems

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table