Advertisement

A Self-assembly Model of Time-Dependent Glue Strength

  • Sudheer SahuEmail author
  • Peng Yin
  • John H. Reif
Chapter
Part of the Natural Computing Series book series (NCS)

Abstract

Self-assembly is a ubiquitous process in which small objects self-organize into larger and complex structures. In 2000, Rothemund and Winfree proposed a Tile Assembly Model as a mathematical model for theoretical studies of self-assembly. We propose a refined self-assembly model in which the glue strength between two juxtaposed tiles is a function of the time they have been in neighboring positions. We then present an implementation of our model using strand displacement reactions on DNA tiles. Under our model, we can demonstrate and study catalysis and self-replication in the tile assembly. We then study the tile complexity for assembling shapes in our model and show that a thin rectangle of size k×N can be assembled using O((log (N))/log log (N)) types of tiles, demonstrating the glue model has additional capabilities over the prior tiling assembly model. We also describe a method to implement with DNA tiles our model of time-dependant glue strength.

Keywords

Strand Displacement Tile Assembly Model Tile Complexity Seed Tile Thin Rectangle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
    Adleman L (2000) Towards a mathematical theory of self-assembly. Tech Rep 00-722, University of Southern California Google Scholar
  3. 3.
    Adleman L, Cheng Q, Goel A, Huang M (2001) Running time and program size for self-assembled squares. In: Proceedings of the thirty-third annual ACM symposium on theory of computing. ACM, New York, pp 740–748 CrossRefGoogle Scholar
  4. 4.
    Adleman L, Cheng Q, Goel A, Huang M, Kempe D, de Espans P, Rothemund P (2002) Combinatorial optimization problems in self-assembly. In: Proceedings of the thirty-fourth annual ACM symposium on theory of computing. ACM, New York, pp 23–32 CrossRefGoogle Scholar
  5. 5.
    Adleman L, Kari J, Kari L, Reishus D (2002) On the decidability of self-assembly of infinite ribbons. In: Proceedings of the 43rd symposium on foundations of computer science, pp 530–537 Google Scholar
  6. 6.
    Aggarwal G, Cheng Q, Goldwasser MH, Kao M, de Espanes PM, Schweller RT (2005) Complexities for generalized models of self-assembly. SIAM J Comput 24:1493–1515 CrossRefGoogle Scholar
  7. 7.
    Angelov S, Khanna S, Visontai M (2008) On the complexity of graph self-assembly in accretive systems. Nat Comput Int J Arch 7:183–201 zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    Bowden N, Terfort A, Carbeck J, Whitesides G (1997) Self-assembly of mesoscale objects into ordered two-dimensional arrays. Science 276(11):233–235 CrossRefGoogle Scholar
  9. 9.
    Bruinsma R, Gelbart W, Reguera D, Rudnick J, Zandi R (2003) Viral self-assembly as a thermodynamic process. Phys Rev Lett 90(24):248101 CrossRefGoogle Scholar
  10. 10.
    Chelyapov N, Brun Y, Gopalkrishnan M, Reishus D, Shaw B, Adleman L (2004) DNA triangles and self-assembled hexagonal tilings. J Am Chem Soc 126:924–925 CrossRefGoogle Scholar
  11. 11.
    Chen H, Cheng Q, Goel A, Huang M, de Espanes P (2004) Invadable self-assembly: combining robustness with efficiency. In: Proceedings of the 15th annual ACM–SIAM symposium on discrete algorithms (SODA), pp 890–899 Google Scholar
  12. 12.
    Cheng Q, de Espanes P (2003) Resolving two open problems in the self-assembly of squares. Tech Rep 03-793, University of Southern California Google Scholar
  13. 13.
    Cheng Q, Goel A, Moisset P (2004) Optimal self-assembly of counters at temperature two. In: Proceedings of the first conference on foundations of nanoscience: self-assembled architectures and devices Google Scholar
  14. 14.
    Cook M, Rothemund PWK, Winfree E (2004) Self-assembled circuit patterns. In: DNA based computers 9. Lecture notes in computer science, vol 2943. Springer, Berlin, pp 91–107 Google Scholar
  15. 15.
    Feller W (1968) An introduction to probability theory and its applications, vol 1 Google Scholar
  16. 16.
    Fujibayashi K, Murata S (2005) A method for error suppression for self-assembling DNA tiles. In: Lecture notes in computer science, vol 3384. Springer, Berlin, pp 113–127 Google Scholar
  17. 17.
    Hughes BD (1995) Random walks and random environments, vol 1: random walks. Oxford University Press, New York zbMATHGoogle Scholar
  18. 18.
    Kao M, Schweller R (2006) Reduce complexity for tile self-assembly through temperature programming. In: Proceedings of 17th annual ACM–SIAM symposium on discrete algorithms (SODA). ACM, New York, pp 571–580 CrossRefGoogle Scholar
  19. 19.
    Klavins E (2004) Directed self-assembly using graph grammars. In: Foundations of nanoscience: self assembled architectures and devices, Snowbird, UT Google Scholar
  20. 20.
    Klavins E, Ghrist R, Lipsky D (2004) Graph grammars for self-assembling robotic systems. In: Proceedings of the international conference on robotics and automation Google Scholar
  21. 21.
    LaBean TH, Yan H, Kopatsch J, Liu F, Winfree E, Reif JH, Seeman NC (2000) Construction, analysis, ligation and self-assembly of DNA triple crossover complexes. J Am Chem Soc 122:1848–1860 CrossRefGoogle Scholar
  22. 22.
    Lagoudakis M, LaBean T (2000) 2-D DNA self-assembly for satisfiability. In: DNA based computers V. DIMACS, vol 54. American Mathematical Society, Providence, pp 141–154 Google Scholar
  23. 23.
    Liu D, Wang M, Deng Z, Walulu R, Mao C (2004) Tensegrity: construction of rigid DNA triangles with flexible four-arm DNA junctions. J Am Chem Soc 126:2324–2325 CrossRefGoogle Scholar
  24. 24.
    Mao C, Sun W, Seeman NC (1999) Designed two-dimensional DNA holliday junction arrays visualized by atomic force microscopy. J Am Chem Soc 121:5437–5443 CrossRefGoogle Scholar
  25. 25.
    Park SH, Pistol C, Ahn SJ, Reif JH, Lebeck AR, Dwyer C, LaBean TH (2006) Finite-size, fully addressable DNA tile lattices formed by hierarchical assembly procedures. Angew Chem Int Ed 45:735–739 CrossRefGoogle Scholar
  26. 26.
    Reif JH, Sahu S, Yin P (2005) Complexity of graph self-assembly in accretive systems and self-destructible systems. In: Lecture notes in computer science. Springer, Berlin, pp 257–274 Google Scholar
  27. 27.
    Reif JH, Sahu S, Yin P (2006). Compact error-resilient computational DNA tilings. In: Nanotechnology: science and computation, pp 79–103 Google Scholar
  28. 28.
    Revesz P (1990) Random walk in random and non-random environments. World Scientific, Singapore zbMATHGoogle Scholar
  29. 29.
    Robinson R (1971) Undecidability and non periodicity of tilings of the plane. Invent Math 12:177–209 CrossRefMathSciNetGoogle Scholar
  30. 30.
    Rothemund P (2000) Using lateral capillary forces to compute by self-assembly. Proc Natl Acad Sci USA 97(3):984–989 CrossRefGoogle Scholar
  31. 31.
    Rothemund P (2001) Theory and experiments in algorithmic self-assembly. PhD thesis, University of Southern California Google Scholar
  32. 32.
    Rothemund P, Winfree E (2000) The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of the thirty-second annual ACM symposium on theory of computing. ACM, New York, pp 459–468 CrossRefGoogle Scholar
  33. 33.
    Sa-Ardyen P, Jonoska N, Seeman NC (2003) Self-assembling DNA graphs. Nat Comput 2:427–438 zbMATHCrossRefMathSciNetGoogle Scholar
  34. 34.
    Schulman R, Lee S, Papadakis N, Winfree E (2004) One dimensional boundaries for DNA tile self-assembly. In: DNA based computers 9. Lecture notes in computer science, vol 2943. Springer, Berlin, pp 108–125 Google Scholar
  35. 35.
    Schulman R, Winfree E (2005) Programmable control of nucleation for algorithmic self-assembly. In: Lecture notes in computer science, vol 3384. Springer, Berlin, pp 319–328 Google Scholar
  36. 36.
    Schulman R, Winfree E (2005) Self-replication and evolution of DNA crystals. In: The 13th European conference on artificial life (ECAL) Google Scholar
  37. 37.
    Soloveichik D, Winfree E (2006) Complexity of compact proofreading for self-assembled patterns. In: Lecture notes in computer science, vol 3892. Springer, Berlin, pp 305–324 Google Scholar
  38. 38.
    Soloveichik D, Winfree E (2007) Complexity of self-assembled shapes. SIAM J Comput 36:1544–1569 zbMATHCrossRefMathSciNetGoogle Scholar
  39. 39.
    Wang H (1961) Proving theorems by pattern recognition, II. Bell Syst Tech J 40:1–41 Google Scholar
  40. 40.
    Winfree E (1998) Simulation of computing by self-assembly. Tech Rep 1998.22, Caltech Google Scholar
  41. 41.
    Winfree E (2006). Self-healing tile sets. In: Nanotechnology: science and computation, pp 55–78 Google Scholar
  42. 42.
    Winfree E, Bekbolatov R (2004) Proofreading tile sets: error correction for algorithmic self-assembly. In: DNA based computers 9. Lecture notes in computer science, vol 2943. Springer, Berlin, pp 126–144 Google Scholar
  43. 43.
    Winfree E, Liu F, Wenzler LA, Seeman NC (1998) Design and self-assembly of two-dimensional DNA crystals. Nature 394(6693):539–544 CrossRefGoogle Scholar
  44. 44.
    Winfree E, Yang X, Seeman NC (1999) Universal computation via self-assembly of DNA: some theory and experiments. In: Landweber L, Baum E (eds) DNA based computers II. DIMACS, vol 44. American Mathematical Society, Providence, pp 191–213 Google Scholar
  45. 45.
    Yan H, LaBean TH, Feng L, Reif JH (2003) Directed nucleation assembly of DNA tile complexes for barcode-patterned lattices. Proc Natl Acad Sci USA 100(14):8103–8108 CrossRefGoogle Scholar
  46. 46.
    Yan H, Park SH, Finkelstein G, Reif JH, LaBean TH (2003) DNA-templated self-assembly of protein arrays and highly conductive nanowires. Science 301(5641):1882–1884 CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.Department of Computer ScienceDuke UniversityDurhamUSA
  2. 2.Department of Computer Science, Department of BioengineeringCenter for Biological Circuit Design, CaltechPasadenaUSA

Personalised recommendations