{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:28:13Z","timestamp":1649183293197},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1007\/bf03037363","type":"journal-article","created":{"date-parts":[[2009,4,21]],"date-time":"2009-04-21T22:08:40Z","timestamp":1240351720000},"page":"307-315","source":"Crossref","is-referenced-by-count":0,"title":["Experimental efficiency of programmed mutagenesis"],"prefix":"10.1007","volume":"20","author":[{"given":"Julia","family":"Khodor","sequence":"first","affiliation":[]},{"given":"David K.","family":"Gifford","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,1]]},"reference":[{"key":"BF03037363_CR1","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-48017-X_28","volume-title":"DNA Computing","author":"Julia Khodor","year":"2002","unstructured":"Khodor, J. and Gifford, D. K., \u201cProgrammed Mutagenesis is a Universal Model of Computation,\u201d to appear in a special issue ofLecture Notes in Computer Science, Springer-Verlag, 2002."},{"issue":"5","key":"BF03037363_CR2","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s00224-002-1044-8","volume":"35","author":"Julia Khodor","year":"2002","unstructured":"Khodor, J. and Gifford, D. K., \u201cProgrammed Mutagenesis is Universal,\u201d to appear in a special issue ofTheory of Computing Systems, Springer-Verlag, 2002.","journal-title":"Theory of Computing Systems"},{"issue":"5187","key":"BF03037363_CR3","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L. Adleman","year":"1994","unstructured":"Adleman, L., \u201cMolecular Computation of Solutions to Combinatorial Problems,\u201dScience, 266, 5187, pp. 1021\u20131024, 1994.","journal-title":"Science"},{"issue":"5210","key":"BF03037363_CR4","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"R. J. Lipton","year":"1995","unstructured":"Lipton, R. J., \u201cDNA Solution to Computational Problems,\u201dScience, 268, 5210, pp. 542\u2013545, 1995.","journal-title":"Science"},{"issue":"1\u20133","key":"BF03037363_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0166-218X(96)00058-3","volume":"71","author":"D. Boneh","year":"1996","unstructured":"Boneh, D., Dunworth, C., Lipton, R. J., and Sgall, S., \u201cOn the Computational Power of DNA,\u201dDiscrete Applied Mathematics, 71, 1\u20133, pp. 79\u201394, 1996.","journal-title":"Discrete Applied Mathematics"},{"key":"BF03037363_CR6","doi-asserted-by":"crossref","unstructured":"Komiya, K., Sakamoto, K., Gouzu, H., Yokoyama, S., Arita, M., Nishilkawa, A., and Hagiya, M., \u201cSuccessive State Transitions with I\/O Interface by Molecules,\u201din Proc. of Sixth International Meeting on DNA Based Computers, Preliminary, pp. 21\u201330, 2000.","DOI":"10.1007\/3-540-44992-2_2"},{"issue":"5469","key":"BF03037363_CR7","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1126\/science.288.5469.1223","volume":"288","author":"K. Sakamoto","year":"2000","unstructured":"Sakamoto, K. Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., and Hagiya, M., \u201cMolecular Computation by DNA Hairpin Formation,\u201dScience, 288, 5469, pp. 1223\u20131226, 2000.","journal-title":"Science"},{"key":"BF03037363_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/inco.1996.0091","volume":"131","author":"L. Kari","year":"1996","unstructured":"Kari, L. and Thierrin, G., \u201cContextual Insertions\/Deletions and Computability,\u201dInformation and Computation, 131, pp. 47\u201361, 1996.","journal-title":"Information and Computation"},{"key":"BF03037363_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0303-2647(99)00027-1","volume":"52","author":"L. F. Landwebber","year":"1999","unstructured":"Landwebber, L. F. and Kari, L., \u201cThe Evolution of Cellular Computing: Nature's Solution to a Computational Problem,\u201dBiosystems, 52, pp. 3\u201313, 1999.","journal-title":"Biosystems"},{"key":"BF03037363_CR10","first-page":"29","volume":"27","author":"D. Beaver","year":"1996","unstructured":"Beaver, D., \u201cMolecular Computing,\u201d1st DIMACS Workshop on DNA-based computers, Princeton, DIMACS Series, 27, pp. 29\u201336, 1996.","journal-title":"1st DIMACS Workshop on DNA-based computers, Princeton, DIMACS Series"},{"key":"BF03037363_CR11","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/BF02481771","volume":"49","author":"T. Head","year":"1987","unstructured":"Head, T., \u201cFormal Language Theory and DNA: an Analysis of the Generative Capacity of Specific Recombinant Behaviors,\u201dBulletin of Mathematical Biology, 49, pp. 737\u2013759, 1987.","journal-title":"Bulletin of Mathematical Biology"},{"key":"BF03037363_CR12","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"G. Paun","year":"2000","unstructured":"Paun, G., \u201cComputing with Membranes,\u201dJ Comput Syst Sci, 61, pp. 108\u2013143, 2000.","journal-title":"J Comput Syst Sci"},{"key":"BF03037363_CR13","unstructured":"Winfree, E., \u201cOn the Computational Power of DNA Annealing and Ligation,\u201dDNA Based Computers II: DIMACS Workshop, June 10\u201312, 1996, American Mathematical Society, pp. 191\u2013213, 1998."},{"key":"BF03037363_CR14","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1038\/35035038","volume":"407","author":"C. Mao","year":"2000","unstructured":"Mao, C., LaBean, T. H., Reif, J. H. and Seeman, N. C., \u201cLogical Computation Using Algorithmic Self-assembly of DNA Triple-crossover Molecules,\u201dNature, 407, pp. 493\u2013496, 2000.","journal-title":"Nature"},{"key":"BF03037363_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0303-2647(99)00050-7","volume":"52","author":"A. J. Hartemink","year":"1999","unstructured":"Hartemink, A. J., Gifford, D. K. and Khodor, J., \u201cAutomated Constraint-Governed Nucleotide Sequence Selection for DNA Computation,\u201dBiosystems, 52, pp. 93\u201397, 1999.","journal-title":"Biosystems"},{"key":"BF03037363_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0303-2647(99)00036-2","volume":"52","author":"J. Khodor","year":"1999","unstructured":"Khodor, J. and Gifford, D.K., \u201cDesign and Implementation of Computational Systems Based on Programmed Mutagenesis,\u201dBiosystems, 52, pp. 227\u2013235, 1999.","journal-title":"Biosystems"},{"key":"BF03037363_CR17","unstructured":"Current Protocols in Molecular Biology (Ausubel, I. and Frederick, M., eds), 8.5, John Wiley & Sons, Inc, 1997."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037363.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037363\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037363.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T20:52:35Z","timestamp":1558558355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["BF03037363"],"URL":"https:\/\/doi.org\/10.1007\/bf03037363","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}