{"id":"https://openalex.org/W1706917786","doi":"https://doi.org/10.1090/dimacs/054/12","title":"2D DNA self-assembly for satisfiability","display_name":"2D DNA self-assembly for satisfiability","publication_year":2000,"publication_date":"2000-11-14","ids":{"openalex":"https://openalex.org/W1706917786","doi":"https://doi.org/10.1090/dimacs/054/12","mag":"1706917786"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/054/12","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/054/12","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084693234","display_name":"Michail G. Lagoudakis","orcid":"https://orcid.org/0000-0003-2803-3755"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michail Lagoudakis","raw_affiliation_strings":["California Institute of Technology, Pasadena, CA"],"affiliations":[{"raw_affiliation_string":"California Institute of Technology, Pasadena, CA","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036574954","display_name":"Thomas H. LaBean","orcid":"https://orcid.org/0000-0002-6739-2059"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas LaBean","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084693234"],"corresponding_institution_ids":["https://openalex.org/I122411786"],"apc_list":null,"apc_paid":null,"fwci":5.0901,"has_fulltext":false,"cited_by_count":82,"citation_normalized_percentile":{"value":0.95680987,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"141","last_page":"154"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9972000122070312,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9972000122070312,"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/T12029","display_name":"DNA and Biological Computing","score":0.9940999746322632,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9320999979972839,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5383729934692383},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47847720980644226},{"id":"https://openalex.org/keywords/computational-biology","display_name":"Computational biology","score":0.3608844578266144},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.27642303705215454},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2671777009963989}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5383729934692383},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47847720980644226},{"id":"https://openalex.org/C70721500","wikidata":"https://www.wikidata.org/wiki/Q177005","display_name":"Computational biology","level":1,"score":0.3608844578266144},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.27642303705215454},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2671777009963989}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1090/dimacs/054/12","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/054/12","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.40.9610","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.9610","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~mgl/papers/dna5.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.92.5900","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.5900","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~thl/papers/Lagoudakis_LaBean.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{".":[0],"DNA":[1,53],"self-assembly":[2,54],"has":[3],"been":[4],"proposed":[5,23],"as":[6,17,103],"a":[7,72,91,104],"way":[8,74],"to":[9,38],"cope":[10],"with":[11],"huge":[12],"combinatorial":[13],"NP-HARD":[14,146],"problems,":[15],"such":[16],"satisfiability.":[18],"However,":[19],"the":[20,35,64,69,77,80,84,113,139,145],"algorithmic":[21,45],"designs":[22],"so":[24],"far":[25],"either":[26],"involve":[27],"many":[28],"biosteps":[29],"or":[30],"are":[31],"highly":[32],"dependent":[33],"on":[34,86],"particular":[36,87],"instance":[37],"be":[39,99,119,126],"solved.":[40],"This":[41],"paper":[42],"presents":[43],"an":[44],"design":[46,65],"for":[47,116],"solving":[48],"satisfiability":[49],"problems":[50],"using":[51],"two-dimensional":[52],"(tiling).":[55],"The":[56,129,133],"main":[57],"driving":[58],"factor":[59],"in":[60,71,101],"this":[61],"work":[62,95],"was":[63],"and":[66,82,96,122,147],"encoding":[67],"of":[68,94,144,150],"algorithm":[70,78],"general":[73],"that":[75,112],"separates":[76],"from":[79],"data":[81],"minimizes":[83],"dependency":[85],"instances.":[88],"In":[89,107],"effect,":[90],"large":[92],"amount":[93],"preparation":[97],"can":[98],"done":[100],"advance":[102],"batch":[105],"process.":[106],"practice,":[108],"it":[109],"is":[110,138],"likely":[111],"total":[114],"time":[115],"computation":[117],"will":[118,125],"decreased":[120],"significantly":[121],"laboratory":[123],"procedures":[124],"simplified.":[127],"1.":[128],"Satisfiability":[130,135],"(SAT)":[131,136],"Problem":[132],"Boolean":[134],"problem":[137],"most":[140],"well":[141],"known":[142],"representative":[143],"NP-COMPLETE":[148],"classes":[149],"problems.":[151],"These":[152],"probl...":[153]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}
