AI helps you reading Science
Optimal Solutions for the Closest-String Problem via Integer Programming
INFORMS Journal on Computing, no. 4 (2004): 419-429
EI
Keywords
Abstract
In this paper we study the closest-string problem (CSP), which can be defined as follows: Given a finite set = {s1, s2, ', sn} of strings, each string with length m, find a center string t of length m minimizing d, such that for every string si â聢聢 , dH(t, si) â聣陇 d. By dH(t, si) we mean the Hamming distance between t and si. This is an N...More
Code:
Data:
Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn