DNA Sticky End Design and Assignment for Robust Algorithmic Self-assembly
A major challenge in practical DNA tile self-assembly is the minimization of errors. Using the kinetic Tile Assembly Model, a theoretical model of self-assembly, it has been shown that errors can be reduced through abstract tile set design. In this paper, we instead investigate the effects of “sticky end” sequence choices in systems using the kinetic model along with the nearest-neighbor model of DNA interactions. We show that both the sticky end sequences present in a system and their positions in the system can significantly affect error rates, and propose algorithms for sequence design and assignment.
Unable to display preview. Download preview PDF.
- 2.The Xgrow simulator, http://dna.caltech.edu/Xgrow/
- 12.Jang, B., Kim, Y., Lombardi, F.: Error tolerance of DNA self-assembly by monomer concentration control. In: 2006 21st IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, pp. 89–97. IEEE (2006)Google Scholar
- 21.Rothemund, P.W.K., Papadakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biol. 2, e424 (2004)Google Scholar
- 27.Winfree, E.: On the Computational Power of DNA Annealing and Ligation. In: DNA Computers. DIMACS Series in Discrete Mathematics and Computer Science, pp. 199–221. AMS (1996)Google Scholar
- 28.Winfree, E.: Simulations of computing by self-assembly. Tech. Rep. CaltechCSTR:1998.22, Pasadena, CA (1998)Google Scholar