One Dimensional Boundaries for DNA Tile Self-Assembly
In this paper we report the design and synthesis of DNA molecules (referred to as DNA tiles) with specific binding interactions that guide self-assembly to make one-dimensional assemblies shaped as lines, V’s and X’s. These DNA tile assemblies have been visualized by atomic force microscopy. The highly-variable distribution of shapes – e.g., the length of the arms of X-shaped assemblies – gives us insight into how the assembly process is occurring. Using stochastic models that simulate addition and dissociation of each type of DNA tile, as well as simplified models that more cleanly examine the generic phenomena, we dissect the contribution of accretion vs aggregation, reversible vs irreversible and seeded vs unseeded assumptions for describing the growth processes. The results suggest strategies for controlling self-assembly to make more uniformly-shaped assemblies.
Unable to display preview. Download preview PDF.
- 1.Bloomfield, V.A., Crothers, D.M., Tinoco Jr., I.: Nucleic Acids: Structures, Properties, and Functions. University Science Books (2000)Google Scholar
- 3.Bondarenko, B.A.: Generalized Pascal Triangles and Pyramids, Their Fractals, Graphs and Applications. In: Bollinger, R.C. (ed.) The Fibonacci Association (1993) (Translated from the Russian)Google Scholar
- 6.Flory, P.J.: Principles of Polymer Chemistry. Cornell University Press (1953)Google Scholar
- 9.Rothemund, P.W.K., Winfree, E.: The program-size complexity of selfassembled squares. In: Symposium on Theory of Computing (STOC), May 21-23, ACM, New York (2000)Google Scholar
- 11.Schulman, R., Winfree, E.: Controlling nucleation rates in algorithmic selfassembly (in preparation)Google Scholar
- 12.Schulman, R., Winfree, E.: Relationships among tile assembly models (in preparation)Google Scholar
- 14.Wang, H.: Proving theorems by pattern recognition. II. Bell System Technical Journal 40, 1–42 (1961)Google Scholar
- 15.Wang, H.: Dominoes and the AEA case of the decision problem. In: Fox, J. (ed.) Proceedings of the Symposium on the Mathematical Theory of Automata, pp. 23–55. Polytechnic Press, Brooklyn (1963)Google Scholar
- 16.Winfree, E.: On the computational power of DNA annealing and ligation. In: Lipton, R.J., Baum, E.B. (eds.) DNA Based Computers: DIMACS Workshop, April 4, vol. 27, pp. 199–221. American Mathematical Society, Providence (1996)Google Scholar
- 17.Winfree, E.: Simulations of computing by self-assembly. Technical Report CSTR: 1998.22, Caltech, 1998. Originally appeared in the preliminary proceedings of the 4th DIMACS Meeting on DNA Based Computers, held at the University of Pennsylvania, June 16-19 (1998)Google Scholar