On stoichiometry for the assembly of flexible tile DNA complexes

Given a set of flexible branched junction DNA molecules with sticky-ends (building blocks), called here “tiles”, we consider the problem of determining the proper stoichiometry such that all sticky-ends could end up connected. In general, the stoichiometry is not uniform, and the goal is to determine the proper proportion (spectrum) of each type of molecule within a test tube to allow for complete assembly. According to possible components that assemble in complete complexes we partition multisets of tiles, called here “pots”, into classes: unsatisfiable, weakly satisfiable, satisfiable and strongly satisfiable. This classification is characterized through the spectrum of the pot, and it can be computed in PTIME using the standard Gauss-Jordan elimination method. We also give a geometric description of the spectrum as a convex hull within the unit cube.

[1]  Natasa Jonoska,et al.  Complexity classes for self-assembling flexible tiles , 2009, Theor. Comput. Sci..

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

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

[4]  N. Seeman,et al.  Designed Two-Dimensional DNA Holliday Junction Arrays Visualized by Atomic Force Microscopy , 1999 .

[5]  Rob D. Coalson,et al.  Rotational Relaxation in Polar Solvents. Molecular Dynamics Study of Solute−Solvent Interaction , 1998 .

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

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

[8]  Sudheer Sahu,et al.  A Self-assembly Model of Time-Dependent Glue Strength , 2005, DNA.

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

[10]  Leon Cooper,et al.  Methods and applications of linear programming , 1974 .

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

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

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

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

[15]  N C Seeman,et al.  Gel electrophoretic analysis of DNA branched junctions , 1989, Electrophoresis.

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

[17]  Stuart A. Kurtz,et al.  Active transport in biological computing , 1996, DNA Based Computers.

[18]  Michael J. Panik.  Linear programming - mathematics, theory and algorithms , 1996, Applied optimization.

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

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

[21]  N. Seeman,et al.  Ligation of triangles built from bulged 3-arm DNA branched junctions , 1996 .

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

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

[24]  A. Brøndsted.  An Introduction to Convex Polytopes , 1982 .

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

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