{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:15Z","timestamp":1759637895808,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705741"},{"type":"electronic","value":"9783540705758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_31","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"370-384","source":"Crossref","is-referenced-by-count":28,"title":["Randomized Self-assembly for Approximate Shapes"],"prefix":"10.1007","author":[{"given":"Ming-Yang","family":"Kao","sequence":"first","affiliation":[]},{"given":"Robert","family":"Schweller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L., Cheng, Q., Goel, A., Huang, M.: Running time and program size for self-assembled squares. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 740\u2013748 (2001)","DOI":"10.1145\/380752.380881"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Adleman, L., Cheng, Q., Goel, A., Huang, M., Kempe, D., Espanes, P., Rothemund, P.: Combinatorial optimization problems in self-assembly. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 23\u201332 (2002)","DOI":"10.1145\/509907.509913"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/S0097539704445202","volume":"34","author":"G. Aggarwal","year":"2005","unstructured":"Aggarwal, G., Cheng, Q., Goldwasser, M.H., Kao, M.-Y., de Espanes, P.M., Schweller, R.T.: Complexities for generalized models of self-assembly. SIAM Journal on Computing\u00a034, 1493\u20131515 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR4","unstructured":"Aggarwal, G., Goldwasser, M.H., Kao, M.-Y., Schweller, R.T.: Complexities for generalized models of self-assembly. In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 880\u2013889 (2004)"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Becker, F., Remila, E., Rapaport, I.: Self-assemblying classes of shapes with a minimum number of tiles, and in optimal time. In: Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (2006)","DOI":"10.1007\/11944836_7"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Demaine, E., Demaine, M., Fekete, S., Ishaque, M., Rafalin, E., Schweller, R., Souvaine, D.: Staged self-assembly: Nanomanufacture of arbitrary shapes with O(1) glues. In: Proceedings of the 13th International Meeting on DNA Computing (2007)","DOI":"10.1007\/978-3-540-77962-9_1"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"3211","DOI":"10.1021\/bi00064a003","volume":"32","author":"T.-J. Fu","year":"1993","unstructured":"Fu, T.-J., Seeman, N.C.: DNA double-crossover molecules. Biochemistry\u00a032, 3211\u20133220 (1993)","journal-title":"Biochemistry"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Kao, M.-Y., Schweller, R.: Reducing tile complexity for self-assembly through temperature programming. In: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithms, pp. 571\u2013580 (2006)","DOI":"10.1145\/1109557.1109620"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"1848","DOI":"10.1021\/ja993393e","volume":"122","author":"T.H. LaBean","year":"2000","unstructured":"LaBean, T.H., Yan, H., Kopatsch, J., Liu, F., Winfree, E., Reif, H.J., Seeman, N.C.: The construction, analysis, ligation and self-assembly of DNA triple crossover complexes. J. Am. Chem. Soc.\u00a0122, 1848\u20131860 (2000)","journal-title":"J. Am. Chem. Soc."},{"key":"31_CR10","unstructured":"Lagoudakis, M.G., Labean, T.H.: 2D DNA self-assembly for satisfiability. In: Proceedings of the 5th DIMACS Workshop on DNA Based Computers, June\u00a026 1999, pp. 459\u2013468 (1999)"},{"key":"31_CR11","unstructured":"Reif, J.: Local parallel biomolecular computation. In: Proceedings of the 3rd Annual DIMACS Workshop on DNA Based Computers, June 23-26 (1997)"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Rothemund, P., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. In: Tenth International Meeting on DNA Computing, pp. 344\u2013354 (2005)","DOI":"10.1007\/11493785_30"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"40","author":"H. Wang","year":"1961","unstructured":"Wang, H.: Proving theorems by pattern recognition. Bell System Technical Journal\u00a040, 1\u201342 (1961)","journal-title":"Bell System Technical Journal"},{"key":"31_CR15","unstructured":"Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology, Pasadena (1998)"},{"key":"31_CR16","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.: Design and self-assembly of two-dimensional DNA crystals. Nature\u00a0394, 539\u2013544 (1998)","journal-title":"Nature"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Winfree, E., Yang, X., Seeman, N.C.: Universal computation via self-assembly of DNA: Some theory and experiments. In: Proceedings of the 2nd International Meeting on DNA Based Computers, June 10-12 1996, pp. 191\u2013213 (1996)","DOI":"10.1090\/dimacs\/044\/16"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:26:54Z","timestamp":1714620414000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}