A heuristic algorithm based on Lagrangian relaxation for the closest string problem.

Shunji Tanaka

Browse the full SMC paper archive.