{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:01:16Z","timestamp":1773270076969,"version":"3.50.1"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p>A fundamental problem in coding theory concerns the computation of\n\n  the maximum cardinality of a set S of length\n\n  n code words over an alphabet of size q, such that every pair of\n\n  code words has Hamming distance at least d, and the set of\n\n  additional constraints U on S is satisfied.  This problem has\n\n  application in several areas, one of which is the design of DNA\n\n  codes where q=4 and the alphabet is {A,C,G,T}.\n\n  We describe a new constraint model for this problem and demonstrate\n\n  that it improves on previous solutions (computes better lower\n\n  bounds) for various instances of the problem.  Our approach is based\n\n  on a clustering of DNA words into small sets of words.  Solutions\n\n  are then obtained as the union of such clusters.  Our approach is\n\n  SAT based: we specify constraints on clusters of DNA words and solve\n\n  these using a Boolean satisfiability solver.<\/jats:p>","DOI":"10.24963\/ijcai.2017\/82","type":"proceedings-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T09:14:07Z","timestamp":1501233247000},"page":"585-591","source":"Crossref","is-referenced-by-count":3,"title":["The DNA Word Design Problem: A New Constraint Model and New Results"],"prefix":"10.24963","author":[{"given":"Michael","family":"Codish","sequence":"first","affiliation":[{"name":"Ben-Gurion University of the Negev"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Frank","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Lagoon","sequence":"additional","affiliation":[{"name":"Cadence Design Systems, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"name":"Twenty-Sixth International Joint Conference on Artificial Intelligence","theme":"Artificial Intelligence","location":"Melbourne, Australia","acronym":"IJCAI-2017","number":"26","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)","University of Technology Sydney (UTS)","Australian Computer Society (ACS)"],"start":{"date-parts":[[2017,8,19]]},"end":{"date-parts":[[2017,8,26]]}},"container-title":["Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T11:52:10Z","timestamp":1501242730000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2017\/82"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2017\/82","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}