{"id":"https://openalex.org/W2739883859","doi":"https://doi.org/10.24963/ijcai.2017/82","title":"The DNA Word Design Problem: A New Constraint Model and New Results","display_name":"The DNA Word Design Problem: A New Constraint Model and New Results","publication_year":2017,"publication_date":"2017-07-28","ids":{"openalex":"https://openalex.org/W2739883859","doi":"https://doi.org/10.24963/ijcai.2017/82","mag":"2739883859"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2017/82","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/82","pdf_url":"https://www.ijcai.org/proceedings/2017/0082.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2017/0082.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063747415","display_name":"Michael Codish","orcid":"https://orcid.org/0000-0003-0394-5854"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Codish","raw_affiliation_strings":["Ben-Gurion University of the Negev"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085662277","display_name":"Michael Frank","orcid":"https://orcid.org/0000-0001-8972-2154"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Frank","raw_affiliation_strings":["Ben-Gurion University of the Negev"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068998933","display_name":"Vitaly Lagoon","orcid":null},"institutions":[{"id":"https://openalex.org/I66217453","display_name":"Cadence Design Systems (United States)","ror":"https://ror.org/04w8xa018","country_code":"US","type":"company","lineage":["https://openalex.org/I66217453"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vitaly Lagoon","raw_affiliation_strings":["Cadence Design Systems, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cadence Design Systems, USA","institution_ids":["https://openalex.org/I66217453"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3365,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.60307528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"585","last_page":"591"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10521","display_name":"RNA and protein synthesis mechanisms","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6059329509735107},{"id":"https://openalex.org/keywords/dna-computing","display_name":"DNA computing","score":0.5967209339141846},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.595679521560669},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5924952626228333},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5333592295646667},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4979274272918701},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.49302026629447937},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4813159704208374},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46113789081573486},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.45887935161590576},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.4564213752746582},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44640302658081055},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4026889204978943},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37764623761177063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36093658208847046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3535352349281311},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.13002291321754456}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6059329509735107},{"id":"https://openalex.org/C82047324","wikidata":"https://www.wikidata.org/wiki/Q177126","display_name":"DNA computing","level":3,"score":0.5967209339141846},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.595679521560669},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5924952626228333},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5333592295646667},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4979274272918701},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.49302026629447937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4813159704208374},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46113789081573486},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.45887935161590576},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.4564213752746582},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44640302658081055},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4026889204978943},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37764623761177063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36093658208847046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3535352349281311},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.13002291321754456},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2017/82","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/82","pdf_url":"https://www.ijcai.org/proceedings/2017/0082.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2017/82","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/82","pdf_url":"https://www.ijcai.org/proceedings/2017/0082.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2739883859.pdf","grobid_xml":"https://content.openalex.org/works/W2739883859.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1484564260","https://openalex.org/W1617230687","https://openalex.org/W1845657774","https://openalex.org/W1909638271","https://openalex.org/W1970156673","https://openalex.org/W1977312644","https://openalex.org/W1980107758","https://openalex.org/W2017423606","https://openalex.org/W2027603534","https://openalex.org/W2073036100","https://openalex.org/W2074735241","https://openalex.org/W2099215797","https://openalex.org/W2100541401","https://openalex.org/W2146308110","https://openalex.org/W2159511216","https://openalex.org/W2162224342","https://openalex.org/W2169838799","https://openalex.org/W2274696102","https://openalex.org/W2303014183","https://openalex.org/W2471091339","https://openalex.org/W2560677837","https://openalex.org/W2562376843","https://openalex.org/W2571967924","https://openalex.org/W2952566635","https://openalex.org/W3098055836","https://openalex.org/W3102811762"],"related_works":["https://openalex.org/W2301405299","https://openalex.org/W3150741540","https://openalex.org/W2118943303","https://openalex.org/W4253759203","https://openalex.org/W2085380335","https://openalex.org/W2249253838","https://openalex.org/W4381894531","https://openalex.org/W2509021277","https://openalex.org/W2408080066","https://openalex.org/W3124721760"],"abstract_inverted_index":{"A":[0],"fundamental":[1],"problem":[2,53,83],"in":[3,56],"coding":[4],"theory":[5],"concerns":[6],"the":[7,10,42,63,71,100,122],"computation":[8],"of":[9,13,17,25,32,44,60,65,99,109,115,124,137],"maximum":[11],"cardinality":[12],"a":[14,77,107,144],"set":[15,43],"S":[16,49],"length":[18],"n":[19],"code":[20,33],"words":[21,34,111,139],"over":[22],"an":[23],"alphabet":[24,72],"size":[26],"q,":[27],"such":[28,125],"that":[29,86],"every":[30],"pair":[31],"has":[35,54],"Hamming":[36],"distance":[37],"at":[38],"least":[39],"d,":[40],"and":[41,70,84,140],"additional":[45],"constraints":[46,134],"U":[47],"on":[48,89,106,135],"is":[50,62,73,104,129],"satisfied.":[51],"This":[52],"application":[55],"several":[57],"areas,":[58],"one":[59],"which":[61],"design":[64],"DNA":[66,110,138],"codes":[67],"where":[68],"q=4":[69],"{A,C,G,T}.":[74],"We":[75],"describe":[76],"new":[78],"constraint":[79],"model":[80],"for":[81,96],"this":[82],"demonstrate":[85],"it":[87],"improves":[88],"previous":[90],"solutions":[91],"(computes":[92],"better":[93],"lower":[94],"bounds)":[95],"various":[97],"instances":[98],"problem.":[101],"Our":[102,127],"approach":[103,128],"based":[105],"clustering":[108],"into":[112],"small":[113],"sets":[114],"words.":[116],"Solutions":[117],"are":[118],"then":[119],"obtained":[120],"as":[121],"union":[123],"clusters.":[126],"SAT":[130],"based:":[131],"we":[132],"specify":[133],"clusters":[136],"solve":[141],"these":[142],"using":[143],"Boolean":[145],"satisfiability":[146],"solver.":[147]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}