Sciweavers

Share
CORR
2010
Springer

The Exact Closest String Problem as a Constraint Satisfaction Problem

9 years 5 months ago
The Exact Closest String Problem as a Constraint Satisfaction Problem
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 symbol occurrences can provide search heuristics that provide several orders of magnitude speedup at and above the optimal distance. We also report (to our knowledge) the first analysis and evaluation
Tom Kelsey, Lars Kotthoff
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2010
Where CORR
Authors Tom Kelsey, Lars Kotthoff
Comments (0)
books