{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:45:13Z","timestamp":1742996713884,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319017808"},{"type":"electronic","value":"9783319017815"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-01781-5_9","type":"book-chapter","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T11:21:05Z","timestamp":1375356065000},"page":"95-104","source":"Crossref","is-referenced-by-count":0,"title":["Multiplier System in the Tile Assembly Model with Reduced Tileset-Size"],"prefix":"10.1007","author":[{"given":"Xiwen","family":"Fang","sequence":"first","affiliation":[]},{"given":"Xuejia","family":"Lai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5187","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L. Adleman","year":"1994","unstructured":"Adleman, L.: Molecular computation of solutions to combinatorial problems. Science\u00a0266(5187), 1021\u20131024 (1994)","journal-title":"Science"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Lipton, R.: Using dna to solve np-complete problems. Science\u00a0268(4) (1995)","DOI":"10.1126\/science.7725098"},{"issue":"6766","key":"9_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1038\/35003155","volume":"403","author":"Q. Liu","year":"2000","unstructured":"Liu, Q., Wang, L., Frutos, A., Condon, A., Corn, R., Smith, L., et al.: Dna computing on surfaces. Nature\u00a0403(6766), 175\u2013179 (2000)","journal-title":"Nature"},{"issue":"5337","key":"9_CR4","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1126\/science.278.5337.446","volume":"278","author":"Q. Ouyang","year":"1997","unstructured":"Ouyang, Q., Kaplan, P., Liu, S., Libchaber, A.: Dna solution of the maximal clique problem. Science\u00a0278(5337), 446\u2013449 (1997)","journal-title":"Science"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Rothemund, P., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 459\u2013468. ACM (2000)","DOI":"10.1145\/335305.335358"},{"key":"9_CR6","unstructured":"Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology (1998)"},{"issue":"6693","key":"9_CR7","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1038\/28998","volume":"394","author":"E. Winfree","year":"1998","unstructured":"Winfree, E., Liu, F., Wenzler, L., Seeman, N., et al.: Design and self-assembly of two-dimensional dna crystals. Nature\u00a0394(6693), 539\u2013544 (1998)","journal-title":"Nature"},{"issue":"12","key":"9_CR8","doi-asserted-by":"publisher","first-page":"2586","DOI":"10.1021\/nl052038l","volume":"5","author":"R. Barish","year":"2005","unstructured":"Barish, R., Rothemund, P., Winfree, E.: Two computational primitives for algorithmic self-assembly: Copying and counting. Nano Letters\u00a05(12), 2586\u20132592 (2005)","journal-title":"Nano Letters"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Rothemund, P., Papadakis, N., Winfree, E.: Algorithmic self-assembly of dna sierpinski triangles. PLoS Biology\u00a02(12), e424 (2004)","DOI":"10.1371\/journal.pbio.0020424"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.tcs.2007.07.052","volume":"395","author":"Y. Brun","year":"2008","unstructured":"Brun, Y.: Solving np-complete problems in the tile assembly model. Theoretical Computer Science\u00a0395(1), 31\u201346 (2008)","journal-title":"Theoretical Computer Science"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-18305-8_1","volume-title":"DNA Computing and Molecular Programming","author":"Y. Brun","year":"2011","unstructured":"Brun, Y.: Improving efficiency of 3-SAT-solving tile systems. In: Sakakibara, Y., Mi, Y. (eds.) DNA 16 2010. LNCS, vol.\u00a06518, pp. 1\u201312. Springer, Heidelberg (2011)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Lagoudakis, M., LaBean, T.: 2-d dna self-assembly for satisfiability. In: DNA Based Computers V, vol.\u00a054, pp. 141\u2013154 (2000)","DOI":"10.1090\/dimacs\/054\/12"},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2006.10.025","volume":"378","author":"Y. Brun","year":"2007","unstructured":"Brun, Y.: Arithmetic computation in the tile assembly model: Addition and multiplication. Theoretical Computer Science\u00a0378(1), 17\u201331 (2007)","journal-title":"Theoretical Computer Science"}],"container-title":["Advances in Intelligent Systems and Computing","Innovations in Bio-inspired Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-01781-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T15:05:34Z","timestamp":1676819134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-01781-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319017808","9783319017815"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-01781-5_9","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}