{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T05:16:30Z","timestamp":1741410990016,"version":"3.38.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T00:00:00Z","timestamp":1711670400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T00:00:00Z","timestamp":1711670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100018770","name":"University of Wisconsin Oshkosh","doi-asserted-by":"publisher","award":["Research Sabbatical S581"],"award-info":[{"award-number":["Research Sabbatical S581"]}],"id":[{"id":"10.13039\/100018770","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s11047-024-09979-0","type":"journal-article","created":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T07:01:42Z","timestamp":1711695702000},"page":"79-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Proving new directed tile complexity lower bounds at temperature 1 by folding between 2D and just-barely 3D self-assembly"],"prefix":"10.1007","volume":"24","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":"Hailey","family":"Vadnais","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,29]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Adleman LM, Cheng Q, Goel A, et\u00a0al (2001) Running time and program size for self-assembled squares. In: Proceedings of the thirty-third annual ACM symposium on theory of computing (STOC), pp 740\u2013748","key":"9979_CR1","DOI":"10.1145\/380752.380881"},{"key":"9979_CR2","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/S0097539704445202","volume":"34","author":"G Aggarwal","year":"2005","unstructured":"Aggarwal G, Cheng Q, Goldwasser MH et al (2005) Complexities for generalized models of self-assembly. SIAM J Comput (SICOMP) 34:1493\u20131515","journal-title":"SIAM J Comput (SICOMP)"},{"doi-asserted-by":"crossref","unstructured":"Cook M, Fu Y, Schweller RT (2011) 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","key":"9979_CR3","DOI":"10.1137\/1.9781611973082.45"},{"doi-asserted-by":"crossref","unstructured":"Furcy D, Summers SM, Wendlandt C (2019) New bounds on the tile complexity of thin rectangles at temperature-1. In: DNA Computing and molecular programming\u201425th international conference, DNA 25, Seattle, WA, USA, 5\u20139 Aug 2019, Proceedings, Lecture Notes in Computer Science, vol 11648. Springer, pp 100\u2013119","key":"9979_CR4","DOI":"10.1007\/978-3-030-26807-7_6"},{"unstructured":"Furcy D, Summers SM, Withers L (2021) Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3d. In: 27th International conference on DNA computing and molecular programming, DNA 27, 13\u201316 Sept 2021, Oxford, UK (Virtual Conference), LIPIcs, vol 205. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp 4:1\u20134:18","key":"9979_CR5"},{"unstructured":"Jordan C (1887) Cours d\u2019analyse, pp 587\u2013594","key":"9979_CR6"},{"issue":"6","key":"9979_CR7","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 (2010) Two lower bounds for self-assemblies at temperature 1. J Comput Biol 17(6):841\u2013852","journal-title":"J Comput Biol"},{"doi-asserted-by":"crossref","unstructured":"Meunier PE, Patitz MJ, Summers SM, et\u00a0al (2014) 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","key":"9979_CR8","DOI":"10.1137\/1.9781611973402.56"},{"unstructured":"Rothemund PWK (2001) Theory and experiments in algorithmic self-assembly. PhD thesis, University of Southern California","key":"9979_CR9"},{"doi-asserted-by":"crossref","unstructured":"Rothemund PWK, Winfree E (2000) The program-size complexity of self-assembled squares (extended abstract). In: The thirty-second annual ACM symposium on theory of computing (STOC), pp 459\u2013468","key":"9979_CR10","DOI":"10.1145\/335305.335358"},{"key":"9979_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0022-5193(82)90002-9","volume":"99","author":"NC Seeman","year":"1982","unstructured":"Seeman NC (1982) Nucleic-acid junctions and lattices. J Theor Biol 99:237\u2013247","journal-title":"J Theor Biol"},{"issue":"6","key":"9979_CR12","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1137\/S0097539704446712","volume":"36","author":"D Soloveichik","year":"2007","unstructured":"Soloveichik D, Winfree E (2007) Complexity of self-assembled shapes. SIAM J Comput (SICOMP) 36(6):1544\u20131569","journal-title":"SIAM J Comput (SICOMP)"},{"unstructured":"Winfree E (1998) Algorithmic self-assembly of DNA. PhD thesis, California Institute of Technology","key":"9979_CR13"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-024-09979-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-024-09979-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-024-09979-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T06:38:07Z","timestamp":1741329487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-024-09979-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,29]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["9979"],"URL":"https:\/\/doi.org\/10.1007\/s11047-024-09979-0","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2024,3,29]]},"assertion":[{"value":"26 February 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}