{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T17:05:04Z","timestamp":1763399104735},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3850,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0304-3975(02)00533-9","type":"journal-article","created":{"date-parts":[[2003,2,5]],"date-time":"2003-02-05T01:51:53Z","timestamp":1044409913000},"page":"2095-2107","source":"Crossref","is-referenced-by-count":6,"title":["Is DNA computing viable for 3-SAT problems?"],"prefix":"10.1016","volume":"290","author":[{"given":"Dafa","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00533-9_BIB1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"Adleman","year":"1994","journal-title":"Science"},{"key":"10.1016\/S0304-3975(02)00533-9_BIB2","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1006\/jcss.1998.1586","article-title":"DNA models and algorithms for NP-complete problems","volume":"57","author":"Bach","year":"1998","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00533-9_BIB3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0304-3975(99)00100-0","article-title":"Using DNA to solve the bounded post correspondence problem","volume":"231","author":"Kari","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00533-9_BIB4","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"Lipton","year":"1995","journal-title":"Science"},{"key":"10.1016\/S0304-3975(02)00533-9_BIB5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1038\/35001232","article-title":"DNA computing on surfaces","volume":"403","author":"Liu","year":"2000","journal-title":"Nature"},{"key":"10.1016\/S0304-3975(02)00533-9_BIB6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1038\/35003071","article-title":"DNA computing on a chip","volume":"403","author":"Ogihara","year":"2000","journal-title":"Nature"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502005339?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502005339?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T00:50:13Z","timestamp":1553907013000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502005339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397502005339"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00533-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}