作为约束满足问题的精确最近弦问题
The Exact Closest String Problem as a Constraint Satisfaction Problem
摘要：
我们报告（据我们所知）的第一次评估约束满足作为一个计算框架，解决最接近的字符串问题。我们表明，仔细考虑符号出现可以提供搜索启发式方法，在最佳距离及以上提供几个数量级的加速。我们还报告（据我们所知）的第一次分析和评估-使用任何技术-的计算困难，在识别所有最接近的字符串为一个给定的输入集。我们描述了网络规模的分布式解决方案的最接近的字符串问题的算法，无论是纯粹基于AI回溯搜索，也混合数值AI方法。
英文摘要：
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 -- using any technique -- of the computational difficulties involved in the identification of all closest strings for a given input set. We describe algorithms for web-scale distributed solution of closest string problems, both purely based on AI backtrack search and also hybrid numeric-AI methods.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
