One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile

In the classical model of tile self-assembly, unit square tiles translate in the plane and attach edgewise to form large crystalline structures. This model of self-assembly has been shown to be capable of asymptotically optimal assembly of arbitrary shapes and, via information-theoretic arguments, increasingly complex shapes necessarily require increasing numbers of distinct types of tiles.

[1]  E. Winfree,et al.  Synthesis of crystals with a programmable kinetic barrier to nucleation , 2007, Proceedings of the National Academy of Sciences.

[2]  Erik Winfree,et al.  Reducing facet nucleation during algorithmic self-assembly. , 2007, Nano letters.

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

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

[5]  Erik Winfree,et al.  Two computational primitives for algorithmic self-assembly: copying and counting. , 2005, Nano letters.

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

[7]  Bin Fu,et al.  Self-assembly with Geometric Tiles , 2011, ICALP.

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

[9]  Paul W. K. Rothemund,et al.  Design of DNA origami , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

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

[11]  P. Rothemund,et al.  Programmable molecular recognition based on the geometry of DNA nanostructures. , 2011, Nature chemistry.

[12]  André Nies,et al.  Computation, Physics and Beyond , 2012, Lecture Notes in Computer Science.

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

[14]  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.

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

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

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

[18]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[19]  Zhi Xu,et al.  Triangular and Hexagonal Tile Self-assembly Systems , 2012, Computation, Physics and Beyond.

[20]  Erik Winfree,et al.  An information-bearing seed for nucleating algorithmic self-assembly , 2009, Proceedings of the National Academy of Sciences.