The self-assembly of paths and squares at temperature 1

We prove that the number of tile types required to build squares of size n x n, in Winfree's abstract Tile Assembly Model, when restricted to using only non-cooperative tile bindings, is at least 2n-1, which is also the best known upper bound. Non-cooperative self-assembly, also known as temperature 1, is where tiles bind to each other if they match on one or more sides, whereas in cooperative binding, some tiles can bind only if they match on multiple sides. Our proof introduces a new programming technique for temperature 1, that disproves the very intuitive and commonly held belief that, in the same model, assembling paths between two points A and B cannot be done with less tile types than the Manhattan distance between them. Then, we prove a necessary condition for these "efficient paths" to be assembled, and show that this necessary condition cannot hold in completely filled squares. This result proves the oldest conjecture in algorithmic self-assembly, published by Rothemund and Winfree in STOC 2000, in the case where growth starts from a corner of the square. As a corollary, we establish n as a lower bound on the tile complexity of the general case. The problem of determining the minimal number of tile types to self-assemble a shape is known to be Sigma^p_2-complete.

[1]  A. Turberfield,et al.  A DNA-fuelled molecular machine made of DNA , 2022 .

[2]  E. Winfree,et al.  Algorithmic Self-Assembly of DNA Sierpinski Triangles , 2004, PLoS biology.

[3]  P. Rothemund Folding DNA to create nanoscale shapes and patterns , 2006, Nature.

[4]  Jehoshua Bruck,et al.  Neural network computation with DNA strand displacement cascades , 2011, Nature.

[5]  Damien Woods,et al.  Intrinsic universality and the computational power of self-assembly , 2013, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[6]  Hao Wang Proving theorems by pattern recognition — II , 1961 .

[7]  Erik D. Demaine,et al.  The Two-Handed Tile Assembly Model is not Intrinsically Universal , 2013, Algorithmica.

[8]  Hao Wang,et al.  Proving theorems by pattern recognition I , 1960, Commun. ACM.

[9]  Jack H. Lutz,et al.  Computability and Complexity in Self-assembly , 2008, CiE.

[10]  Erik Winfree,et al.  Complexity of Self-Assembled Shapes , 2004, SIAM J. Comput..

[11]  Matthew J. Patitz,et al.  Efficient Squares and Turing Universality at Temperature 1 with a Unique Negative Glue , 2011 .

[12]  Mitsuo Gen,et al.  Combinatorial Optimization Problems , 2007 .

[13]  N. Seeman Nucleic acid junctions and lattices. , 1982, Journal of theoretical biology.

[14]  John H. Reif,et al.  Tile Complexity of Approximate Squares , 2012, Algorithmica.

[15]  P. Yin,et al.  Complex shapes self-assembled from single-stranded DNA tiles , 2012, Nature.

[16]  Ashish Goel,et al.  Running time and program size for self-assembled squares , 2001, STOC '01.

[17]  Erik Winfree,et al.  Molecular robots guided by prescriptive landscapes , 2010, Nature.

[18]  Matthew J. Patitz,et al.  Limitations of self-assembly at temperature 1 , 2009, Theor. Comput. Sci..

[19]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[20]  G. Seelig,et al.  Enzyme-Free Nucleic Acid Logic Circuits , 2022 .

[21]  M. Sahani,et al.  Algorithmic Self-Assembly of DNA , 2006 .

[22]  Jack H. Lutz,et al.  The Tile Assembly Model is Intrinsically Universal , 2011, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[23]  Robert T. Schweller,et al.  Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D , 2009, SODA '11.

[24]  Ján Manuch,et al.  Two Lower Bounds for Self-Assemblies at Temperature 1 , 2009 .

[25]  Lulu Qian,et al.  Supporting Online Material Materials and Methods Figs. S1 to S6 Tables S1 to S4 References and Notes Scaling up Digital Circuit Computation with Dna Strand Displacement Cascades , 2022 .

[26]  E. Winfree,et al.  Toward reliable algorithmic self-assembly of DNA tiles: a fixed-width cellular automaton pattern. , 2008, Nano letters.

[27]  Matthew J. Patitz,et al.  Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue , 2011, DNA.

[28]  Matthew J. Patitz,et al.  Intrinsic universality in tile self-assembly requires cooperation , 2013, SODA.

[29]  Lila Kari,et al.  The power of nondeterminism in self-assembly , 2011, SODA '11.

[30]  Erik Winfree,et al.  The program-size complexity of self-assembled squares (extended abstract) , 2000, STOC '00.

[31]  Matthew J. Patitz,et al.  Limitations of Self-Assembly at Temperature One (extended abstract) , 2008, CSP.

[32]  N. Seeman,et al.  Design and self-assembly of two-dimensional DNA crystals , 1998, Nature.