{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:21Z","timestamp":1759638921772},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319602516"},{"type":"electronic","value":"9783319602523"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-60252-3_13","type":"book-chapter","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T10:59:13Z","timestamp":1496401153000},"page":"164-176","source":"Crossref","is-referenced-by-count":5,"title":["Self-attraction Removal from Oritatami Systems"],"prefix":"10.1007","author":[{"given":"Yo-Sub","family":"Han","sequence":"first","affiliation":[]},{"given":"Hwee","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Trent A.","family":"Rogers","sequence":"additional","affiliation":[]},{"given":"Shinnosuke","family":"Seki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,3]]},"reference":[{"key":"13_CR1","unstructured":"dailymotion.com\/video\/x3cdj35_oritatami-folding-turing-0-abc_school"},{"key":"13_CR2","unstructured":"Aggarwal, G., Goldwasser, M.H., Kao, M.Y., Schweller, R.T.: Complexities for generalized models of self-assembly. In: Proceedings of SODA 2004, pp. 880\u2013889 (2004)"},{"issue":"15","key":"13_CR3","doi-asserted-by":"crossref","first-page":"6054","DOI":"10.1073\/pnas.0808736106","volume":"106","author":"RD Barish","year":"2009","unstructured":"Barish, R.D., Schulman, R., Rothemund, P.W.K., Winfree, E.: An information-bearing seed for nucleating algorithmic self-assembly. PNAS 106(15), 6054\u20136059 (2009)","journal-title":"PNAS"},{"key":"13_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: Proceedings of STACS 2013, vol. 20, pp. 172\u2013184. LIPIcs (2013)"},{"key":"13_CR5","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 FOCS 2012, pp. 302\u2013310 (2012)","DOI":"10.1109\/FOCS.2012.76"},{"key":"13_CR6","unstructured":"Evans, C.: Crystals that count! Physical principles and experimental investigations of DNA tile self-assembly. Ph.D. thesis, California Institute of Technology, June 2014"},{"issue":"2","key":"13_CR7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s11047-014-9430-0","volume":"14","author":"T Fochtman","year":"2015","unstructured":"Fochtman, T., Hendricks, J., Padilla, J.E., Patitz, M.J., Rogers, T.A.: Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles. Nat. Comp. 14(2), 251\u2013264 (2015)","journal-title":"Nat. Comp."},{"key":"13_CR8","unstructured":"Geary, C., Meunier, P.E., Schabanel, N., Seki, S.: Programming Biomolecules that fold greedily during transcription. In: Proceedings of MFCS 2016, vol. 58, pp. 43:1\u201343:14. LIPIcs (2016)"},{"issue":"6198","key":"13_CR9","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1126\/science.1253920","volume":"345","author":"C Geary","year":"2014","unstructured":"Geary, C., Rothemund, P.W.K., Andersen, E.S.: A single-stranded architecture for cotranscriptional folding of RNA nanostructures. Science 345(6198), 799\u2013804 (2014)","journal-title":"Science"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Hendricks, J., Patitz, M.J., Rogers, T.A.: Universal simulation of directed systems in the abstract tile assembly model requires undirectedness. In: Proceedings of FOCS 2016, pp. 800\u2013809 (2016)","DOI":"10.1109\/FOCS.2016.90"},{"issue":"7612","key":"13_CR11","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1038\/nature18287","volume":"535","author":"AGE Miyazono","year":"2016","unstructured":"Miyazono, A.G.E., Faraon, A., Rothemund, P.W.K.: Engineering and mapping nanocavity emission via precision placement of DNA origami. Nature 535(7612), 401\u2013405 (2016)","journal-title":"Nature"},{"issue":"4","key":"13_CR12","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1142\/S0129054114400061","volume":"25","author":"JE Padilla","year":"2014","unstructured":"Padilla, J.E., Patitz, M.J., Schweller, R.T., Seeman, N.C., Summers, S.M., Zhong, X.: Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes. Int. J. Found. Comput. S. 25(4), 459\u2013488 (2014)","journal-title":"Int. J. Found. Comput. S."},{"issue":"12","key":"13_CR13","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1371\/journal.pbio.0020424","volume":"2","author":"PWK Rothemund","year":"2004","unstructured":"Rothemund, P.W.K., Papadakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biol. 2(12), 424 (2004)","journal-title":"PLoS Biol."},{"issue":"17","key":"13_CR14","doi-asserted-by":"crossref","first-page":"6405","DOI":"10.1073\/pnas.1117813109","volume":"109","author":"R Schulman","year":"2012","unstructured":"Schulman, R., Yurke, B., Winfree, E.: Robust self-replication of combinatorial information via crystal growth and scission. PNAS 109(17), 6405\u201310 (2012)","journal-title":"PNAS"},{"key":"13_CR15","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. Ph.D. thesis, California Institute of Technology, June 1998"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Woods, D.: Intrinsic universality and the computational power of self-assembly. In: Proceedings of MCU 2013, vol. 128, pp. 16\u201322 (2013)","DOI":"10.4204\/EPTCS.128.5"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60252-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T11:02:18Z","timestamp":1496401338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60252-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602516","9783319602523"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60252-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}