{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T14:41:23Z","timestamp":1761921683388,"version":"build-2065373602"},"reference-count":19,"publisher":"Wiley","issue":"3-4","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5814,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct. Alg."],"published-print":{"date-parts":[[1999,10]]},"DOI":"10.1002\/(sici)1098-2418(199910\/12)15:3\/4<450::aid-rsa12>3.0.co;2-2","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T17:23:36Z","timestamp":1030296216000},"page":"450-466","source":"Crossref","is-referenced-by-count":4,"title":["Error-resilient DNA computation"],"prefix":"10.1002","volume":"15","author":[{"given":"Richard M.","family":"Karp","sequence":"first","affiliation":[]},{"given":"Claire","family":"Kenyon","sequence":"additional","affiliation":[]},{"given":"Orli","family":"Waarts","sequence":"additional","affiliation":[]}],"member":"311","reference":[{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"Adleman","year":"1994","journal-title":"Science"},{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB2","series-title":"Lecture Notes","volume-title":"Advances in Cryptography?Asiacrypt '94 Proc","author":"Beaver","year":"1994","unstructured":"Factoring: The DNA solution, Advances in Cryptography?Asiacrypt '94 Proc, Lecture Notes in Computer Science, Springer, Berlin, 1994."},{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB3","series-title":"DIMACS Series","first-page":"29","volume-title":"A Universal molecular computer","volume":"27","author":"Beaver","year":"1995","unstructured":"? A Universal molecular computer,? DNA-Based Computing, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, and (Editors), American Mathematical Society, Providence, RI, 1995, Vol. 27, pp. 29-36."},{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1089\/cmb.1995.2.1","volume":"2(1)","author":"Beaver","year":"1995","journal-title":"Comput Biol"},{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB5","series-title":"DIMACS Series","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1090\/dimacs\/027\/04","volume-title":"DNA-Based Computing","volume":"27","author":"Boneh","year":"1995","unstructured":"and ? Breaking DES using a molecular computer,? DNA-Based Computing, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, and (Editors), American Mathematical Society, Providence, RI, 1995, Vol. 27, pp. 37-66."},{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0166-218X(96)00058-3","volume":"71","author":"Boneh","year":"1996","journal-title":"Discrete Appl Math"},{"journal-title":"Proc 2nd Annual DIMACS Workshop on DNA Computing","year":"1996","author":"Boneh","key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB7"},{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB8","first-page":"128","author":"Feige","year":"1990","journal-title":"Proc 22nd ACM Symp on Theory of Computing"},{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB9","first-page":"594","volume-title":"Proc 32nd IEEE Symp Foundations of Computer Science","author":"Gal","year":"1991","unstructured":"Lower bounds for the complexity for reliable boolean circuits with noisy gates, in Proc 32nd IEEE Symp Foundations of Computer Science, 1991, pp. 594-601."},{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB10","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1002\/rsa.3240050306","volume":"5","author":"Kenyon","year":"1994","journal-title":"Random Struct Alg"},{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0129054190000023","volume":"1","author":"Kenyon","year":"1990","journal-title":"Internat J Found Comput Sci"},{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB12","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"Lipton","year":"1995","journal-title":"Science"},{"year":"1977","key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB13","unstructured":"National Bureau of Standards, Data Encryption Standard, U.S. Department of Commerce, FIPS, pub. 46, January 1977."},{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB14","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1137\/0220062","volume":"20","author":"Nisan","year":"1991","journal-title":"SIAM J Comput"},{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB15","first-page":"30","author":"Pippenger","year":"1985","journal-title":"Proc 26th IEEE Symp on Foundations of Computer Science"},{"journal-title":"Proc 7th ACM Symp on Parallel Algorithms and Architecture","year":"1995","author":"Reif","key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB16"},{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB17","first-page":"602","volume-title":"Proc 32nd IEEE Symp on Foundations of Computer Science","author":"Reischuk","year":"1991","unstructured":"and Reliable computation with noisy circuits and decisions trees?A general n log n lower bound, Proc 32nd IEEE Symp on Foundations of Computer Science, 1991, pp. 602-611."},{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB18","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/0022-0000(80)90014-8","volume":"20","author":"Rivest","year":"1980","journal-title":"J Comput Syst Sci"},{"key":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2-BIB19","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1006\/inco.1996.0094","volume":"131","author":"Rooss","year":"1996","journal-title":"Inform and Comput"}],"container-title":["Random Structures and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1098-2418(199910%2F12)15:3%2F4%3C450::AID-RSA12%3E3.0.CO;2-2","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1098-2418(199910\/12)15:3\/4%3C450::AID-RSA12%3E3.0.CO;2-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T06:24:26Z","timestamp":1625120666000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<450::AID-RSA12>3.0.CO;2-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":19,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1999,10]]}},"URL":"https:\/\/doi.org\/10.1002\/(sici)1098-2418(199910\/12)15:3\/4<450::aid-rsa12>3.0.co;2-2","relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"type":"print","value":"1042-9832"},{"type":"electronic","value":"1098-2418"}],"subject":[],"published":{"date-parts":[[1999,10]]}}}