The Exact Closest String Problem as a Constraint Satisfaction Problem

Tom Kelsey, Lars Kotthoff

We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of…