{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:53Z","timestamp":1725795893529},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_31","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"368-379","source":"Crossref","is-referenced-by-count":25,"title":["One Tile to Rule Them All: Simulating\u00a0Any\u00a0Tile\u00a0Assembly\u00a0System with\u00a0a\u00a0Single\u00a0Universal\u00a0Tile"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[]},{"given":"Martin L.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"S\u00e1ndor P.","family":"Fekete","sequence":"additional","affiliation":[]},{"given":"Matthew J.","family":"Patitz","sequence":"additional","affiliation":[]},{"given":"Robert T.","family":"Schweller","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Winslow","sequence":"additional","affiliation":[]},{"given":"Damien","family":"Woods","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L., Cheng, Q., Goel, A., Huang, M.-D.: Running time and program size for self-assembled squares. In: Proceedings of 33rd Annual Symposium on Theory of Computing, pp. 740\u2013748 (2001)","DOI":"10.1145\/380752.380881"},{"issue":"12","key":"31_CR2","doi-asserted-by":"publisher","first-page":"2586","DOI":"10.1021\/nl052038l","volume":"5","author":"R.D. Barish","year":"2005","unstructured":"Barish, R.D., Rothemund, P.W., Winfree, E.: Two computational primitives for algorithmic self-assembly: Copying and counting. Nano Letters\u00a05(12), 2586\u20132592 (2005)","journal-title":"Nano Letters"},{"issue":"15","key":"31_CR3","doi-asserted-by":"publisher","first-page":"6054","DOI":"10.1073\/pnas.0808736106","volume":"106","author":"R.D. Barish","year":"2009","unstructured":"Barish, R.D., Schulman, R., Rothemund, P.W., Winfree, E.: An information-bearing seed for nucleating algorithmic self-assembly. Proceedings of the National Academy of Sciences\u00a0106(15), 6054\u20136059 (2009)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"31_CR4","unstructured":"Cannon, S., Demaine, E.D., Demaine, M.L., Eisenstat, S., Patitz, M.J., Schweller, R.T., Summers, S.M., Winslow, A.: Two hands are better than one (up to constant factors): Self-assembly in the 2HAM vs. aTAM. In: STACS 2013. LIPIcs, vol.\u00a020, pp. 172\u2013184. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2013)"},{"issue":"9","key":"31_CR5","doi-asserted-by":"publisher","first-page":"2913","DOI":"10.1021\/nl070793o","volume":"7","author":"H.-L. Chen","year":"2007","unstructured":"Chen, H.-L., Schulman, R., Goel, A., Winfree, E.: Reducing facet nucleation during algorithmic self-assembly. Nano Letters\u00a07(9), 2913\u20132919 (2007)","journal-title":"Nano Letters"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Cook, M., Fu, Y., Schweller, R.: Temperature 1 self-assembly: Deterministic assembly in 3D and probabilistic assembly in 2D. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 570\u2013589 (2011)","DOI":"10.1137\/1.9781611973082.45"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Doty, D., Lutz, J.H., Patitz, M.J., Schweller, R.T., Summers, S.M., Woods, D.: The tile assembly model is intrinsically universal. In: Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 302\u2013310 (2012)","DOI":"10.1109\/FOCS.2012.76"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/978-3-642-31594-7_60","volume-title":"Automata, Languages, and Programming","author":"B. Fu","year":"2012","unstructured":"Fu, B., Patitz, M.J., Schweller, R., Sheline, R.: Self-assembly with geometric tiles. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol.\u00a07391, pp. 714\u2013725. Springer, Heidelberg (2012)"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-642-27654-5_28","volume-title":"Computation, Physics and Beyond","author":"L. Kari","year":"2012","unstructured":"Kari, L., Seki, S., Xu, Z.: Triangular and hexagonal tile self-assembly systems. In: Dinneen, M.J., Khoussainov, B., Nies, A. (eds.) Computation, Physics and Beyond. LNCS, vol.\u00a07160, pp. 357\u2013375. Springer, Heidelberg (2012)"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Meunier, P.-E., Patitz, M.J., Summers, S.M., Theyssier, G., Winslow, A., Woods, D.: Intrinsic universality in tile self-assembly requires cooperation. In: SODA 2014: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Portland, Oregon, pp. 752\u2013771. SIAM (2014)","DOI":"10.1137\/1.9781611973402.56"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/ICCAD.2005.1560114","volume-title":"ICCAD 2005: Proceedings of the 2005 IEEE\/ACM International Conference on Computer-Aided Design","author":"P.W.K. Rothemund","year":"2005","unstructured":"Rothemund, P.W.K.: Design of DNA origami. In: ICCAD 2005: Proceedings of the 2005 IEEE\/ACM International Conference on Computer-Aided Design, pp. 471\u2013478. IEEE Computer Society, Washington, DC (2005)"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of ACM Symposium on Theory of Computing (STOC), pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"issue":"39","key":"31_CR13","doi-asserted-by":"publisher","first-page":"15236","DOI":"10.1073\/pnas.0701467104","volume":"104","author":"R. Schulman","year":"2007","unstructured":"Schulman, R., Winfree, E.: Synthesis of crystals with a programmable kinetic barrier to nucleation. Proceedings of the National Academy of Sciences\u00a0104(39), 15236\u201315241 (2007)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"6","key":"31_CR14","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1137\/S0097539704446712","volume":"36","author":"D. Soloveichik","year":"2007","unstructured":"Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. SIAM Journal on Computing\u00a036(6), 1544\u20131569 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR15","unstructured":"Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology (June 1998)"},{"issue":"6693","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.A., Seeman, N.C.: Design and self-assembly of two-dimensional DNA crystals. Nature\u00a0394(6693), 539\u2013544 (1998)","journal-title":"Nature"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1038\/nchem.1070","volume":"3","author":"S. Woo","year":"2011","unstructured":"Woo, S., Rothemund, P.W.: Stacking bonds: Programming molecular recognition based on the geometry of DNA nanostructures. Nature Chemistry\u00a03, 620\u2013627 (2011)","journal-title":"Nature Chemistry"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Woods, D.: Intrinsic universality and the computational power of self-assembly. In: MCU: Proceedings of Machines, Computations and Universality. Electronic Proceedings in Theoretical Computer Science, vol.\u00a0128, pp. 16\u201322 (2013)","DOI":"10.4204\/EPTCS.128.5"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:18:57Z","timestamp":1558909137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}