Randomized Self-Assembly for Exact Shapes

Working in Winfree's abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n x n square with high probability, for any sufficiently large n. This answers an open question of Kao and Schweller (Randomized Self-Assembly for Approximate Shapes, ICALP 2008), who showed how to build an *approximately* n x n square using tile concentration programming, and asked whether the approximation could be made *exact* with high probability.

[1]  Ming-Yang Kao,et al.  Reducing tile complexity for self-assembly through temperature programming , 2006, SODA '06.

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

[3]  Jehoshua Bruck,et al.  Programmability of Chemical Reaction Networks , 2009, Algorithmic Bioprocesses.

[4]  Ivan Rapaport,et al.  Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time , 2006, FSTTCS.

[5]  Matthew J. Patitz.  Simulation of Self-Assembly in the Abstract Tile Assembly Model with ISU TAS , 2011, ArXiv.

[6]  Scott M. Summers.  Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming , 2011, Algorithmica.

[7]  Hao Wang.  Dominoes and the Aea Case of the Decision Problem , 1990 .

[8]  Charles H. Bennett.  Logical depth and physical complexity , 1988 .

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

[10]  J V Maizel,et al.  Molecular weight estimation of polypeptide chains by electrophoresis in SDS-polyacrylamide gels. , 1967, Biochemical and biophysical research communications.

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

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

[13]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[14]  L. Hagel,et al.  Gel‐Filtration Chromatography , 1998, Current protocols in protein science.

[15]  C. Ó’Fágáin,et al.  Gel-Filtration Chromatography , 2016, Nature Methods.

[16]  David Doty.  Randomized Self-Assembly for Exact Shapes , 2010, SIAM J. Comput..

[17]  Jack H. Lutz,et al.  Strict self-assembly of discrete Sierpinski triangles , 2007, Theor. Comput. Sci..

[18]  Ming-Yang Kao,et al.  Randomized Self-assembly for Approximate Shapes , 2008, ICALP.

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

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

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

[22]  D. Bollag,et al.  Gel-filtration chromatography. , 1994, Methods in molecular biology.

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

[24]  J. Sambrook,et al.  Molecular Cloning: A Laboratory Manual , 2001 .

[25]  Matthew Cook,et al.  Computation with finite stochastic chemical reaction networks , 2008, Natural Computing.

[26]  Erik D. Demaine,et al.  Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues , 2008, Natural Computing.

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

[28]  Rolf Herken,et al.  The Universal Turing Machine: A Half-Century Survey , 1992 .