{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T19:55:04Z","timestamp":1722628504881},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,2]],"date-time":"2015-11-02T00:00:00Z","timestamp":1446422400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00453-015-0085-8","type":"journal-article","created":{"date-parts":[[2015,11,2]],"date-time":"2015-11-02T16:39:47Z","timestamp":1446482387000},"page":"537-554","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Tight Bounds for Active Self-Assembly Using an Insertion Primitive"],"prefix":"10.1007","volume":"77","author":[{"given":"Benjamin","family":"Hescott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caleb","family":"Malchik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Winslow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,2]]},"reference":[{"key":"85_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 ACM Symposium on Theory of Computing (STOC) (2001)","DOI":"10.1145\/380752.380881"},{"key":"85_CR2","doi-asserted-by":"crossref","unstructured":"Chen, H., Doty, D.: Parallelism and time in hierarchical self-assembly. In: Proceedings of 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1163\u20131182 (2012)","DOI":"10.1137\/1.9781611973099.92"},{"key":"85_CR3","first-page":"20","volume-title":"DNA Computing and Molecular Programming, LNCS","author":"HL Chen","year":"2014","unstructured":"Chen, H.L., Doty, D., Holden, D., Thachuk, C., Woods, D., Yang, C.T.: Fast algorithmic self-assembly of simple shapes using random agitation. In: Murata, S., Kobayashi, S. (eds.) DNA Computing and Molecular Programming, LNCS, vol. 8727, pp. 20\u201336. Springer, Berlin (2014)"},{"key":"85_CR4","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-319-01928-4_2","volume-title":"DNA Computing and Molecular Programming, LNCS","author":"M Chen","year":"2013","unstructured":"Chen, M., Xin, D., Woods, D.: Parallel computation using active self-assembly. In: Soloveichik, D., Yurke, B. (eds.) DNA Computing and Molecular Programming, LNCS, vol. 8141, pp. 16\u201330. Springer, Berlin (2013)"},{"issue":"4","key":"85_CR5","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statist. 23(4), 493\u2013507 (1952)","journal-title":"Ann. Math. Statist."},{"key":"85_CR6","unstructured":"Dabby, N.: Synthetic molecular machines for active self-assembly: prototype algorithms, designs, and experimental study. Ph.D. thesis, Caltech (2013)"},{"key":"85_CR7","doi-asserted-by":"crossref","unstructured":"Dabby, N., Chen, H.L.: Active self-assembly of simple units using an insertion primitive. In: Proceedings of 24th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1526\u20131536 (2013)","DOI":"10.1137\/1.9781611973105.110"},{"key":"85_CR8","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 53rd IEEE Symposium on Foundations of Computer Sciences (FOCS), pp. 302\u2013310 (2012)","DOI":"10.1109\/FOCS.2012.76"},{"key":"85_CR9","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/978-3-642-45008-2_6","volume-title":"Theory and Practice of Natural Computing, LNCS","author":"VK Gautam","year":"2013","unstructured":"Gautam, V.K., Haddow, P.C., Kuiper, M.: Reliable self-assembly by self-triggered activation of enveloped DNA tiles. In: Dediu, A.H., Mart\u00edn-Vide, C., Truthe, B., Vega-Rodr\u00edguez, M.A. (eds.) Theory and Practice of Natural Computing, LNCS, vol. 8273, pp. 68\u201379. Springer, Berlin (2013)"},{"key":"85_CR10","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/978-3-319-01928-4_7","volume-title":"DNA Computing and Molecular Programming, LNCS","author":"J Hendricks","year":"2013","unstructured":"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. In: Soloveichik, D., Yurke, B. (eds.) DNA Computing and Molecular Programming, LNCS, vol. 8141, pp. 90\u2013104. Springer, Berlin (2013)"},{"issue":"2","key":"85_CR11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1142\/S0129054114500087","volume":"25","author":"N Jonoska","year":"2014","unstructured":"Jonoska, N., Karpenko, D.: Active tile self-assembly, part 1: universality at temperature 1. Int. J. Found. Comput. Sci. 25(2), 141\u2013163 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"85_CR12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1142\/S0129054114500099","volume":"25","author":"N Jonoska","year":"2014","unstructured":"Jonoska, N., Karpenko, D.: Active tile self-assembly, part 2: self-similar structures and structural recursion. Int. J. Found. Comput. Sci. 25(2), 165\u2013194 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"85_CR13","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/978-3-319-01928-4_9","volume-title":"DNA Computing and Molecular Programming, LNCS","author":"A Keenan","year":"2013","unstructured":"Keenan, A., Schweller, R., Zhong, X.: Exponential replication of patterns in the signal tile assembly model. In: Soloveichik, D., Yurke, B. (eds.) DNA Computing and Molecular Programming, LNCS, vol. 8141, pp. 118\u2013132. Springer, Berlin (2013)"},{"key":"85_CR14","doi-asserted-by":"crossref","unstructured":"Klavins, E.: Universal self-replication using graph grammars. In: Proceedings of International Conference on MEMS, NANO, and Smart Systems, pp. 198\u2013204 (2004)","DOI":"10.1109\/ICMENS.2004.1508947"},{"key":"85_CR15","doi-asserted-by":"crossref","unstructured":"Klavins, E., Ghrist, R., Lipsky, D.: Graph grammars for self assembling robotic systems. In: Proceedings of the International Conference on Robotics and Automation (ICRA), vol. 5, pp. 5293\u20135300 (2004)","DOI":"10.1109\/ROBOT.2004.1302558"},{"key":"85_CR16","first-page":"15","volume-title":"DNA Computing and Molecular Programming, LNCS","author":"U Majumder","year":"2008","unstructured":"Majumder, U., LaBean, T.H., Reif, J.H.: Activatable tiles: compact, robust programmable assembly and other applications. In: Garzon, M.H., Yan, H. (eds.) DNA Computing and Molecular Programming, LNCS, vol. 4848, pp. 15\u201325. Springer, Berlin (2008)"},{"key":"85_CR17","doi-asserted-by":"crossref","unstructured":"Malchik, C., Winslow, A.: Tight bounds for active self-assembly using an insertion primitive. In: Proceedings of 22nd European Symposium on Algorithms (ESA), pp. 677\u2013688 (2014)","DOI":"10.1007\/978-3-662-44777-2_56"},{"issue":"2","key":"85_CR18","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s11047-011-9268-7","volume":"11","author":"JE Padilla","year":"2012","unstructured":"Padilla, J.E., Liu, W., Seeman, N.C.: Hierarchical self assembly of patterns from the robinson tilings: DNA tile design in an enhanced tile assembly model. Nat. Comput. 11(2), 323\u2013338 (2012)","journal-title":"Nat. Comput."},{"issue":"4","key":"85_CR19","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. Sci. 25(4), 459\u2013488 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"85_CR20","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of 32nd ACM Symposium on Theory of Computing (STOC), pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"issue":"6","key":"85_CR21","doi-asserted-by":"crossref","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 J. Comput. 36(6), 1544\u20131569 (2007)","journal-title":"SIAM J. Comput."},{"key":"85_CR22","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. Ph.D. thesis, Caltech (1998)"},{"key":"85_CR23","doi-asserted-by":"crossref","unstructured":"Woods, D., Chen, H.L., Goodfriend, S., Dabby, N., Winfree, E., Yin, P.: Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. In: Proceedings of 4th Conference on Innovations in Theoretical Compuer Science (ITCS), pp. 353\u2013354 (2013)","DOI":"10.1145\/2422436.2422476"},{"key":"85_CR24","doi-asserted-by":"crossref","unstructured":"Woods, D., Chen, H.L., Goodfriend, S., Dabby, N., Winfree, E., Yin, P.: Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. Tech. rep., arXiv (2013)","DOI":"10.1145\/2422436.2422476"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0085-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0085-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0085-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0085-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T05:46:44Z","timestamp":1567316804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0085-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,2]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["85"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0085-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,2]]}}}