Complexity classes for self-assembling flexible tiles

We present a theoretical model for self-assembling DNA tiles with flexible branches. We encode an instance of a ''problem'' as a pot of such tiles for which a ''solution'' is an assembled complete complex without any free sticky ends. Using the number of tiles in an assembled complex as a measure of complexity we show how NTIME classes (such as NP and NEXP) can be represented with corresponding classes of the model.

[1]  Natasa Jonoska,et al.  Creating 3-dimensional graph structures with DNA , 1997, DNA Based Computers.

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

[3]  Natasa Jonoska,et al.  Computation by Self-assembly of DNA Graphs , 2004, Genetic Programming and Evolvable Machines.

[4]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[5]  Russell P. Goodman,et al.  Rapid Chiral Assembly of Rigid DNA Building Blocks for Molecular Nanofabrication , 2005, Science.

[6]  L F Landweber,et al.  Molecular computation: RNA solutions to chess problems , 2000, Proc. Natl. Acad. Sci. USA.

[7]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[8]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[9]  Gang Wu,et al.  Construction of a DNA nano-object directly demonstrates computation , 2009, Biosyst..

[10]  Nadrian C Seeman,et al.  Assembly and characterization of 8-arm and 12-arm DNA branched junctions. , 2007, Journal of the American Chemical Society.

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

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

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

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  N. Seeman.  DNA Nicks and Nodes and Nanotechnology , 2001 .

[16]  N. Jonoska,et al.  Three dimensional DNA structures in computing. , 1999, Bio Systems.

[17]  William M. Shih,et al.  A 1.7-kilobase single-stranded DNA that folds into a nanoscale octahedron , 2004, Nature.

[18]  J. Reif,et al.  Construction, analysis, ligation, and self-assembly of DNA triple crossover complexes , 2000 .

[19]  Natasa Jonoska,et al.  A Computational Model for Self-assembling Flexible Tiles , 2005, UC.

[20]  N. Seeman,et al.  Synthesis from DNA of a molecule with the connectivity of a cube , 1991, Nature.

[21]  Ming-Yang Kao,et al.  DNA Self-Assembly For Constructing 3D Boxes , 2001, ISAAC.

[22]  Natasa Jonoska,et al.  Expectation and Variance of Self-assembled Graph Structures , 2005, DNA.

[23]  J. Reif,et al.  Logical computation using algorithmic self-assembly of DNA triple-crossover molecules , 2000, Nature.

[24]  Natasha Jonoska,et al.  Self-assembly of irregular graphs whose edges are DNA helix axes. , 2004, Journal of the American Chemical Society.

[25]  N. Seeman,et al.  Construction of a DNA-Truncated Octahedron , 1994 .

[26]  N C Seeman,et al.  Assembly and characterization of five-arm and six-arm DNA branched junctions. , 1991, Biochemistry.

[27]  Sanjeev Khanna,et al.  On the complexity of graph self-assembly in accretive systems , 2007, Natural Computing.

[28]  Natasa Jonoska,et al.  Flexible Versus Rigid Tile Assembly , 2006, UC.

[29]  Ashish Goel,et al.  Combinatorial optimization problems in self-assembly , 2002, STOC '02.

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

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

[32]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

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

[34]  N. Seeman,et al.  DNA double-crossover molecules. , 1993, Biochemistry.

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

[36]  G Rozenberg,et al.  Computing with DNA by operating on plasmids. , 2000, Bio Systems.

[37]  Erik Winfree,et al.  Universal computation via self-assembly of DNA: Some theory and experiments , 1996, DNA Based Computers.

[38]  Jarkko Kari,et al.  On the decidability of self-assembly of infinite ribbons , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[39]  Natasa Jonoska,et al.  Spectrum of a Pot for DNA Complexes , 2006, DNA.