{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T11:23:20Z","timestamp":1696418600815},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T00:00:00Z","timestamp":1692748800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T00:00:00Z","timestamp":1692748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s00224-023-10137-9","type":"journal-article","created":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T06:02:32Z","timestamp":1692770552000},"page":"1082-1130","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D"],"prefix":"10.1007","volume":"67","author":[{"given":"David","family":"Furcy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott M.","family":"Summers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Logan","family":"Withers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,23]]},"reference":[{"key":"10137_CR1","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. PhD thesis, California Institute of Technology (1998)"},{"key":"10137_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0022-5193(82)90002-9","volume":"99","author":"NC Seeman","year":"1982","unstructured":"Seeman, N.C.: Nucleic-acid junctions and lattices. J. Theor. Biol. 99, 237\u2013247 (1982)","journal-title":"J. Theor. Biol."},{"key":"10137_CR3","doi-asserted-by":"crossref","unstructured":"Wang, H.: Proving theorems by pattern recognition \u2013 II. Bell Syst. Tech. J. XL(1), 1\u201341 (1961)","DOI":"10.1002\/j.1538-7305.1961.tb03975.x"},{"key":"10137_CR4","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of selfassembled squares (extended abstract). In: The Thirty-Second Annual ACM Symposium on Theory of Computing (STOC), pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"issue":"6","key":"10137_CR5","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1089\/cmb.2009.0067","volume":"17","author":"J Manuch","year":"2010","unstructured":"Manuch, J., Stacho, L., Stoll, C.: Two lower bounds for self-assemblies at temperature 1. J. Comput. Biol. 17(6), 841\u2013852 (2010)","journal-title":"J. Comput. Biol."},{"key":"10137_CR6","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: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 752\u2013771 (2014)","DOI":"10.1137\/1.9781611973402.56"},{"key":"10137_CR7","doi-asserted-by":"crossref","unstructured":"Meunier, P., Woods, D.: The non-cooperative tile assembly model is not intrinsically universal or capable of bounded turing machine simulation. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19\u201323, 2017, pp. 328\u2013341 (2017)","DOI":"10.1145\/3055399.3055446"},{"key":"10137_CR8","doi-asserted-by":"crossref","unstructured":"Meunier, P., Regnault, D., Woods, D.: The program-size complexity of self-assembled paths. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020, pp. 727\u2013737 (2020)","DOI":"10.1145\/3357713.3384263"},{"key":"10137_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.tcs.2010.08.023","volume":"412","author":"D Doty","year":"2011","unstructured":"Doty, D., Patitz, M.J., Summers, S.M.: Limitations of self-assembly at temperature 1. Theor. Comput. Sci. 412, 145\u2013158 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10137_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11047-008-9073-0","volume":"7","author":"ED Demaine","year":"2008","unstructured":"Demaine, E.D., Demaine, M.L., Fekete, S.P., Ishaque, M., Rafalin, E., Schweller, R.T., Souvaine, D.L.: Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues. Nat Comput 7(3), 347\u2013370 (2008)","journal-title":"Nat Comput"},{"key":"10137_CR11","doi-asserted-by":"crossref","unstructured":"Doty, D., Patitz, M.J., Reishus, D., Schweller, R.T., Summers, S.M.: Strong fault-tolerance for self-assembly with fuzzy temperature. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), pp. 417\u2013426 (2010)","DOI":"10.1109\/FOCS.2010.47"},{"key":"10137_CR12","doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Hendricks, J., Patitz, M.J., Rogers, T.A., Schweller, R.T.: Universal computation with arbitrary polyomino tiles in non-cooperative self-assembly. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pp. 148\u2013167 (2015)","DOI":"10.1137\/1.9781611973730.12"},{"key":"10137_CR13","doi-asserted-by":"crossref","unstructured":"Fu, B., Patitz, M.J., Schweller, R.T., Sheline, R.: Self-assembly with geometric tiles. In: Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I, pp. 714\u2013725 (2012)","DOI":"10.1007\/978-3-642-31594-7_60"},{"key":"10137_CR14","doi-asserted-by":"crossref","unstructured":"Gilbert, O., Hendricks, J., Patitz, M.J., Rogers, T.A.: Computing in continuous space with self-assembling polygonal tiles (extended abstract). In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pp. 937\u2013956 (2016)","DOI":"10.1137\/1.9781611974331.ch67"},{"key":"10137_CR15","doi-asserted-by":"crossref","unstructured":"Patitz, M.J., Schweller, R.T., Summers, S.M.: Exact shapes and Turing universality at temperature 1 with a single negative glue. In: Proceedings of the 17th International Conference on DNA Computing and Molecular Programming. DNA\u201911, pp. 175\u2013189. Springer, Berlin, Heidelberg (2011). http:\/\/dl.acm.org\/citation.cfm?id=2042033.2042050","DOI":"10.1007\/978-3-642-23638-9_15"},{"key":"10137_CR16","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.tcs.2015.12.008","volume":"743","author":"J Hendricks","year":"2018","unstructured":"Hendricks, J., Patitz, M.J., Rogers, T.A., Summers, S.M.: The power of duples (in self-assembly): It\u2019s not so hip to be square. Theor. Comput. Sci. 743, 148\u2013166 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"10137_CR17","doi-asserted-by":"crossref","unstructured":"Cook, M., Fu, Y., Schweller, R.T.: Temperature 1 self-assembly: Deterministic assembly in 3D and probabilistic assembly in 2D. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 570\u2013589 (2011)","DOI":"10.1137\/1.9781611973082.45"},{"issue":"4","key":"10137_CR18","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1007\/s00453-016-0147-6","volume":"77","author":"D Furcy","year":"2017","unstructured":"Furcy, D., Micka, S., Summers, S.M.: Optimal program-size complexity for self-assembled squares at temperature 1 in 3D. Algorithmica 77(4), 1240\u20131282 (2017)","journal-title":"Algorithmica"},{"key":"10137_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2021.02.001","volume":"872","author":"D Furcy","year":"2021","unstructured":"Furcy, D., Summers, S.M., Wendlandt, C.: Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D. Theor. Comput. Sci. 872, 55\u201378 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"10137_CR20","doi-asserted-by":"crossref","unstructured":"Furcy, D., Summers, S.M.: Optimal self-assembly of finite shapes at temperature 1 in 3D. Algorithmica 80(6), 1909\u20131963 (2018)","DOI":"10.1007\/s00453-016-0260-6"},{"key":"10137_CR21","doi-asserted-by":"crossref","unstructured":"Adleman, L.M., Cheng, Q., Goel, A., Huang, M.-D.A.: Running time and program size for self\u2013assembled squares. In: Proceedings of the Thirty\u2013Third Annual ACM Symposium on Theory of Computing (STOC), pp. 740\u2013748 (2001)","DOI":"10.1145\/380752.380881"},{"issue":"6","key":"10137_CR22","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 J. Comput. (SICOMP) 36(6), 1544\u20131569 (2007)","journal-title":"SIAM J. Comput. (SICOMP)"},{"key":"10137_CR23","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 Espan\u00e9s, P.M., Schweller, R.T.: Complexities for generalized models of selfassembly. SIAM J. Comput. (SICOMP) 34, 1493\u20131515 (2005)","journal-title":"SIAM J. Comput. (SICOMP)"},{"key":"10137_CR24","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.tcs.2008.09.062","volume":"410","author":"JI Lathrop","year":"2009","unstructured":"Lathrop, J.I., Lutz, J.H., Summers, S.M.: Strict self-assembly of discrete Sierpinski triangles. Theor. Comput. Sci. 410, 384\u2013405 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"10137_CR25","unstructured":"Rothemund, P.W.K.: Theory and experiments in algorithmic selfassembly. PhD thesis, University of Southern California (2001)"},{"issue":"3","key":"10137_CR26","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/s00224-011-9345-4","volume":"51","author":"JH Lutz","year":"2012","unstructured":"Lutz, J.H., Shutters, B.: Approximate self-assembly of the sierpinski triangle. Theor. Comput. Syst. 51(3), 372\u2013400 (2012)","journal-title":"Theor. Comput. Syst."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-023-10137-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-023-10137-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-023-10137-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T09:03:45Z","timestamp":1696323825000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-023-10137-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,23]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["10137"],"URL":"https:\/\/doi.org\/10.1007\/s00224-023-10137-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,23]]},"assertion":[{"value":"22 June 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}