{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:45:17Z","timestamp":1757630717677,"version":"3.44.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T00:00:00Z","timestamp":1752364800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T00:00:00Z","timestamp":1752364800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2329908","2329908"],"award-info":[{"award-number":["2329908","2329908"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"University of Wisconsin Oshkosh Research Sabbatical","award":["(S581) Fall 2023"],"award-info":[{"award-number":["(S581) Fall 2023"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s11047-025-10035-8","type":"journal-article","created":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T08:59:42Z","timestamp":1752397182000},"page":"731-761","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Self-assembly of patterns in the abstract tile assembly model"],"prefix":"10.1007","volume":"24","author":[{"given":"Phillip","family":"Drake","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Patitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott M.","family":"Summers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tyler","family":"Tracy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,13]]},"reference":[{"key":"10035_CR1","doi-asserted-by":"publisher","unstructured":"Adleman L, Cheng Q, Goel A et\u00a0al (2001) Running time and program size for self-assembled squares. In: Proceedings of the 33rd annual ACM symposium on theory of computing, Hersonissos, Greece, pp 740\u2013748. https:\/\/doi.org\/10.1145\/380752.380881","DOI":"10.1145\/380752.380881"},{"key":"10035_CR2","doi-asserted-by":"crossref","unstructured":"Becker F, Hader D, Patitz MJ (2025) Strict self-assembly of discrete self-similar fractals in the abstract tile assembly model. In: Proceedings of the 2025 annual ACM-SIAM symposium on discrete algorithms (SODA\u201925), New Orleans, USA, SIAM, pp 2387\u20132466","DOI":"10.1137\/1.9781611978322.80"},{"key":"10035_CR3","unstructured":"Cannon S, Demaine ED, Demaine ML et\u00a0al (2013) Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM. In: Portier N, Wilke T (eds) STACS, LIPIcs, vol\u00a020. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp 172\u2013184"},{"key":"10035_CR4","doi-asserted-by":"crossref","unstructured":"Chen HL, Doty D, Seki S (2011) Program size and temperature in self-assembly. In: ISAAC 2011: proceedings of the 22nd international symposium on algorithms and computation, lecture notes in computer science, vol 7074. Springer-Verlag, pp 445\u2013453","DOI":"10.1007\/978-3-642-25591-5_46"},{"key":"10035_CR5","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-32208-2_5","volume-title":"DNA computing and molecular programming, lecture notes in computer science","author":"E Czeizler","year":"2012","unstructured":"Czeizler E, Popa A (2012) Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly. In: Stefanovic D, Turberfield A (eds) DNA computing and molecular programming, lecture notes in computer science, vol 7433. Springer, Berlin\/Heidelberg, pp 58\u201372"},{"key":"10035_CR6","doi-asserted-by":"publisher","unstructured":"Doty D, Fleming H, Hader D et\u00a0al (2023) Accelerating self-assembly of crisscross slat systems. In: Chen HL, Evans CG (eds) 29th international conference on DNA computing and molecular programming (DNA 29), Leibniz international proceedings in informatics (LIPIcs), vol 276. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, pp 7:1\u20137:23, https:\/\/doi.org\/10.4230\/LIPIcs.DNA.29.7, https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.DNA.29.7","DOI":"10.4230\/LIPIcs.DNA.29.7"},{"key":"10035_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-031-63742-1_7","volume-title":"International conference on unconventional computation and natural computation","author":"P Drake","year":"2024","unstructured":"Drake P, Patitz MJ, Summers SM et al (2024) Self-assembly of patterns in the abstract tile assembly model. International conference on unconventional computation and natural computation. Springer, Cham, pp 89\u2013103"},{"key":"10035_CR8","unstructured":"Drake P, Patitz MJ, Tracy T (2024b) Pattern self-assembly software. http:\/\/self-assembly.net\/wiki\/index.php\/Pattern_Self-Assembly"},{"key":"10035_CR9","unstructured":"Evans CG (2014) Crystals that count! Physical principles and experimental investigations of DNA tile self-assembly. PhD thesis, California Institute of Technology"},{"key":"10035_CR10","unstructured":"Hader D (2024) WebTAS: a browser-based simulator. http:\/\/self-assembly.net\/wiki\/index.php\/WebTAS"},{"key":"#cr-split#-10035_CR11.1","doi-asserted-by":"crossref","unstructured":"Hader D, Koch A, Patitz MJ et\u00a0al (2020) The impacts of dimensionality, diffusion, and directedness on intrinsic universality in the abstract tile assembly model. In: Chawla S","DOI":"10.1137\/1.9781611975994.159"},{"key":"#cr-split#-10035_CR11.2","unstructured":"(ed) Proceedings of the 2020 ACM-SIAM symposium on discrete algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. SIAM, pp 2607-2624"},{"key":"10035_CR12","doi-asserted-by":"crossref","unstructured":"Hendricks J, Patitz MJ, Rogers TA (2016) Universal simulation of directed systems in the abstract tile assembly model requires undirectedness. In: Proceedings of the 57th annual IEEE symposium on foundations of computer science (FOCS 2016), New Brunswick, New Jersey, USA October 9-11, 2016, pp 800\u2013809","DOI":"10.1109\/FOCS.2016.90"},{"issue":"1","key":"10035_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-016-0154-7","volume":"78","author":"L Kari","year":"2017","unstructured":"Kari L, Kopecki S, Meunier P et al (2017) Binary pattern tile set synthesis is np-hard. Algorithmica 78(1):1\u201346. https:\/\/doi.org\/10.1007\/s00453-016-0154-7","journal-title":"Algorithmica"},{"key":"10035_CR14","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.tcs.2008.09.062","volume":"410","author":"JI Lathrop","year":"2009","unstructured":"Lathrop JI, Lutz JH, Summers SM (2009) Strict self-assembly of discrete Sierpinski triangles. Theor Comput Sci 410:384\u2013405","journal-title":"Theor Comput Sci"},{"issue":"3","key":"10035_CR15","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s00224-010-9252-0","volume":"48","author":"JI Lathrop","year":"2011","unstructured":"Lathrop JI, Lutz JH, Patitz MJ et al (2011) Computability and complexity in self-assembly. Theory Comput Syst 48(3):617\u2013647","journal-title":"Theory Comput Syst"},{"key":"10035_CR16","doi-asserted-by":"crossref","unstructured":"Lempi\u00e4inen T, Czeizler E, Orponen P (2011) Synthesizing small and reliable tile sets for patterned dna self-assembly. In: Proceedings of the 17th international conference on DNA computing and molecular programming. Springer-Verlag, Berlin, Heidelberg, DNA\u201911, pp 145\u2013159. http:\/\/dl.acm.org\/citation.cfm?id=2042033.2042048","DOI":"10.1007\/978-3-642-23638-9_13"},{"issue":"5","key":"10035_CR17","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1109\/TCAD.2008.917973","volume":"27","author":"X Ma","year":"2008","unstructured":"Ma X, Lombardi F (2008) Synthesis of tile sets for DNA self-assembly. IEEE Trans CAD Integr Circuits Syst 27(5):963\u2013967","journal-title":"IEEE Trans CAD Integr Circuits Syst"},{"key":"10035_CR18","unstructured":"Patitz MJ (2011) Simulation of self-assembly in the abstract tile assembly model with isu tas. Tech. Rep. 1101.5151, Computing Research Repository. arXiv: 1101.5151"},{"issue":"2","key":"10035_CR19","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s11047-010-9218-9","volume":"10","author":"MJ Patitz","year":"2011","unstructured":"Patitz MJ, Summers SM (2011) Self-assembly of decidable sets. Nat Comput 10(2):853\u2013877","journal-title":"Nat Comput"},{"issue":"7082","key":"10035_CR20","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1038\/nature04586","volume":"440","author":"PWK Rothemund","year":"2006","unstructured":"Rothemund PWK (2006) Folding DNA to create nanoscale shapes and patterns. Nature 440(7082):297\u2013302. https:\/\/doi.org\/10.1038\/nature04586","journal-title":"Nature"},{"key":"10035_CR21","doi-asserted-by":"crossref","unstructured":"Rothemund PWK, Winfree E (2000) The program-size complexity of self-assembled squares (extended abstract). In: STOC \u201900: proceedings of the thirty-second annual ACM Symposium on theory of computing. ACM, Portland, Oregon, United States, pp 459\u2013468","DOI":"10.1145\/335305.335358"},{"issue":"12","key":"10035_CR22","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pbio.0020424","volume":"2","author":"PWK Rothemund","year":"2004","unstructured":"Rothemund PWK, Papadakis N, Winfree E (2004) Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biol 2(12):e424","journal-title":"PLoS Biol"},{"issue":"6","key":"10035_CR23","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 36(6):1544\u20131569","journal-title":"SIAM J Comput"},{"issue":"7683","key":"10035_CR24","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1038\/nature24655","volume":"552","author":"G Tikhomirov","year":"2017","unstructured":"Tikhomirov G, Petersen P, Qian L (2017) Fractal assembly of micrometre-scale DNA origami arrays with arbitrary patterns. Nature 552(7683):67\u201371","journal-title":"Nature"},{"key":"10035_CR25","unstructured":"Winfree E (1998a) Algorithmic self-assembly of DNA. PhD thesis, California Institute of Technology"},{"key":"10035_CR26","unstructured":"Winfree E (1998b) The xgrow simulator. http:\/\/www.dna.caltech.edu\/Xgrow"},{"key":"10035_CR27","doi-asserted-by":"crossref","unstructured":"Wintersinger CM, Minev D, Ershova A et\u00a0al (2022) Multi-micron crisscross structures grown from DNA-origami slats. Nat Nanotechnol 1\u20139","DOI":"10.1038\/s41565-022-01283-1"},{"issue":"7748","key":"10035_CR28","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1038\/s41586-019-1014-9","volume":"567","author":"D Woods","year":"2019","unstructured":"Woods D, Doty D, Myhrvold C et al (2019) Diverse and robust molecular algorithms using reprogrammable DNA self-assembly. Nature 567(7748):366\u2013372","journal-title":"Nature"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-025-10035-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-025-10035-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-025-10035-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T19:19:59Z","timestamp":1757531999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-025-10035-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,13]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["10035"],"URL":"https:\/\/doi.org\/10.1007\/s11047-025-10035-8","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2025,7,13]]},"assertion":[{"value":"23 June 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}