Abstract
The 2-handed assembly model (2HAM) is a tile-based self-assembly model in which, typically beginning from single tiles, arbitrarily large aggregations of static tiles combine in pairs to form structures. The signal-passing tile assembly model (STAM) is an extension of the 2HAM in which the tiles are dynamically changing components which are able to alter their binding domains as they bind together. In this paper, we examine the \(\hbox {STAM}^+\), a restriction of the STAM that does not allow glues to be turned “off”, and prove that there exists a 3D tile set at temperature \(\tau >1\) in the 2HAM which is intrinsically universal for the class of all 2D \(\hbox {STAM}^+\) systems at temperature \(\tau \) for each \(\tau \) (where the \(\hbox {STAM}^+\) does not make use of the STAM’s power of glue deactivation and assembly breaking, as the tile components of the 2HAM are static and unable to change or break bonds). This means that there is a single tile set \(U\) in the 3D 2HAM which can, for an arbitrarily complex \(\hbox {STAM}^+\) system \(S\), be configured with a single input configuration which causes \(U\) to exactly simulate \(S\) at a scale factor dependent upon \(S\). Furthermore, this simulation uses only two planes of the third dimension. This implies that there exists a 3D tile set at temperature \(2\) in the 2HAM which is intrinsically universal for the class of all 2D \(\hbox {STAM}^+\) systems at temperature \(1\). Moreover, we also show that there exists an \(\hbox {STAM}^+\) tile set for temperature \(\tau \) which is intrinsically universal for the class of all 2D \(\hbox {STAM}^+\) systems at temperature \(\tau \), including the case where \(\tau = 1\). To achieve these results, we also demonstrate useful techniques and transformations for converting an arbitrarily complex \(\hbox {STAM}^+\) tile set into an \(\hbox {STAM}^+\) tile set where every tile has a constant, low amount of complexity, in terms of the number and types of “signals” they can send, with a trade off in scale factor. While the first result is of more theoretical interest, showing the power of static tiles to simulate dynamic tiles when given one extra plane in 3D, the second result is of more practical interest for the experimental implementation of STAM tiles, since it provides potentially useful strategies for developing powerful STAM systems while keeping the complexity of individual tiles low, thus making them easier to physically implement.
Similar content being viewed by others
References
Abel Z, Benbernou N, Damian M, Demaine ED, Demaine ML, Flatland R, Kominers SD, Schweller RT (2010) Shape replication through self-assembly and rnase enzymes. In: Proceedings of the twenty-first annual ACM-SIAM symposium on discrete algorithms, pp 1045–1064
Becker F, Rapaport I, Rémila E (2006) Self-assembling classes of shapes with a minimum number of tiles, and in optimal time. In: Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp 45–56
Chandran H, Gopalkrishnan N, Reif JH (2009) The tile complexity of linear assemblies. In: Albers S, Marchetti-Spaccamela A, Matias Y, Nikoletseas SE, Thomas W (eds) Automata, languages and programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5–12, 2009, proceedings, part I. Lecture Notes in Computer Science, vol 5555. Springer, Berlin, pp 235–253
Cheng Q, Aggarwal G, Goldwasser MH, Kao M-Y, Schweller RT, de Espanés PM (2005) Complexities for generalized models of self-assembly. SIAM J Comput 34:1493–1515
Cook M, Fu Y, Schweller R (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 ’11, SIAM, pp 570–589
Costa Santini C, Bath J, Tyrrell AM, Turberfield AJ (2013) A clocked finite state machine built from DNA. Chem Commun 49:237–239
Delorme M, Mazoyer J, Ollinger N, Theyssier G (2011a) Bulking I: an abstract theory of bulking. Theor Comput Sci 412(30):3866–3880
Delorme M, Mazoyer J, Ollinger N, Theyssier G (2011b) Bulking II: classifications of cellular automata. Theor Comput Sci 412(30):3881–3905
Demaine ED, Demaine ML, Fekete SP, Ishaque M, Rafalin E, Schweller RT, Souvaine DL (2008) Staged self-assembly: nanomanufacture of arbitrary shapes with \({O}(1)\) glues. Nat Comput 7(3):347–370
Demaine ED, Patitz MJ, Rogers TA, Schweller RT, Summers SM, Woods D (2013) The two-handed assembly model is not intrinsically universal. In: 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, Riga, Latvia, July 8–12, 2013. Lecture notes in computer science. Springer, Berlin
Doty D, Kari L, Masson B (2013) Negative interactions in irreversible self-assembly. Algorithmica 66:153–172; preliminary version appeared in DNA 2010
Doty D, Lutz JH, Patitz MJ, Schweller RT, Summers SM, Woods D (2012) The tile assembly model is intrinsically universal. In Proceedings of the 53rd annual IEEE symposium on foundations of computer science, FOCS 2012, pp 302–310
Fu B, Patitz MJ, Schweller RT, Sheline R (2012) Self-assembly with geometric tiles. In: Proceedings of the 39th international colloquium on automata, languages and programming, ICALP, to appear
Han D, Pal S, Yang Y, Jiang S, Nangreave J, Liu Y, Yan H (2013) DNA gridiron nanostructures based on four-arm junctions. Science 339(6126):1412–1415
Hendricks J, Padilla JE, Patitz MJ, Rogers TA (2013) 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. Lecture notes in computer science, vol 8141. Springer, Berlin, pp 90–104
Hendricks JG, Padilla JE, Patitz MJ, Rogers TA (2013) Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles. Technical report 1306.5005. Computing Research Repository
Ke Y, Ong LL, Shih WM, Yin P (2012) Three-dimensional structures self-assembled from DNA bricks. Science 338(6111):1177–1183
Kim J-W, Kim J-H, Deaton R (2011) DNA-linked nanoparticle building blocks for programmable matter. Angew Chem Int Ed 50(39):9185–9190
Padilla JE (2013) Personal communication
Padilla JE, Patitz MJ, Pena R, Schweller RT, Seeman NC, Sheline R, Summers SM, Zhong X (2013) Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes. In: Mauri G, Dennunzio A, Manzoni L, Porreca AE (eds) UCNC. Lecture notes in computer science, vol 7956. Springer, Berlin, pp 174–185
Pinheiro AV, Han D, Shih WM, Yan H (2011) Challenges and opportunities for structural DNA nanotechnology. Nat Nanotechnol 6(12):763–772
Rothemund PW, Papadakis N, Winfree E (2004) Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biol 2(12):e424
Winfree E (1998) Algorithmic self-assembly of DNA. Ph.D. thesis, California Institute of Technology
Woods D, Chen H-L, Goodfriend S, Dabby N, Winfree E, Yin P (2013) Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. In Proceedings of the 4th conference on innovations in theoretical computer science, ITCS ’13. ACM, New York, pp 353–354
Acknowledgments
Tyler Fochtman, Jacob Hendricks, Matthew J. Patitz, Trent A. Rogers: Supported in part by National Science Foundation Grant CCF-1117672; Jennifer E. Padilla: This author’s research was supported by National Science Foundation Grant CCF-1117210.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fochtman, T., Hendricks, J., Padilla, J.E. et al. Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles. Nat Comput 14, 251–264 (2015). https://doi.org/10.1007/s11047-014-9430-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-014-9430-0