Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces

We show how to design a universal shape replicator in a self-assembly system with both attractive and repulsive forces. More precisely, we show that there is a universal set of constant-size objects that, when added to any unknown hole-free polyomino shape, produces an unbounded number of copies of that shape (plus constant-size garbage objects). The constant-size objects can be easily constructed from a constant number of individual tile types using a constant number of preprocessing self-assembly steps. Our construction uses the well-studied 2-Handed Assembly Model (2HAM) of tile self-assembly, in the simple model where glues interact only with identical glues, allowing glue strengths that are either positive (attractive) or negative (repulsive), and constant temperature (required glue strength for parts to hold together). We also require that the given shape has specified glue types on its surface, and that the feature size (smallest distance between nonincident edges) is bounded below by a constant. Shape replication necessarily requires a self-assembly model where parts can both attach and detach, and this construction is the first to do so using the natural model of negative/repulsive glues (also studied before for other problems such as fuel-efficient computation); previous replication constructions require more powerful global operations such as an "enzyme" that destroys a subset of the tile types.

[1]  Robert T. Schweller,et al.  Fuel Efficient Computation in Passive Self-Assembly , 2013, SODA.

[2]  Sudheer Sahu,et al.  Complexity of graph self-assembly in accretive systems and self-destructible systems , 2011, Theor. Comput. Sci..

[3]  Matthew J. Patitz,et al.  Resiliency to Multiple Nucleation in Temperature-1 Self-Assembly , 2016, DNA.

[4]  Jacob Hendricks,et al.  Replication of Arbitrary Hole-Free Shapes via Self-assembly with Signal-Passing Tiles , 2015, UCNC.

[5]  P W Rothemund,et al.  Using lateral capillary forces to compute by self-assembly , 2000, Proc. Natl. Acad. Sci. USA.

[6]  Lila Kari,et al.  Negative Interactions in Irreversible Self-assembly , 2010, Algorithmica.

[7]  E. Winfree,et al.  Robust self-replication of combinatorial information via crystal growth and scission , 2012, Proceedings of the National Academy of Sciences.

[8]  Matthew J. Patitz,et al.  Resiliency to multiple nucleation in temperature-1 self-assembly , 2017, Natural Computing.

[9]  Leonard M. Adleman,et al.  Theory and experiments in algorithmic self-assembly , 2001 .

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

[11]  Jacob Hendricks,et al.  Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles , 2014, Natural Computing.

[12]  Erik D. Demaine,et al.  Shape replication through self-assembly and RNase enzymes , 2010, SODA '10.

[13]  Erik D. Demaine,et al.  Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM , 2013, STACS.

[14]  Xingsi Zhong,et al.  Exponential replication of patterns in the signal tile assembly model , 2014, Natural Computing.

[15]  Ming-Yang Kao,et al.  Complexities for generalized models of self-assembly , 2004, SODA '04.