Advertisement

Triangular and Hexagonal Tile Self-assembly Systems

  • Lila Kari
  • Shinnosuke Seki
  • Zhi Xu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7160)

Abstract

We discuss theoretical aspects of the self-assembly of triangular tiles, in particular, right triangular tiles and equilateral triangular tiles, and the self-assembly of hexagonal tiles. We show that triangular tile assembly systems and square tile assembly systems cannot be simulated by each other in a non-trivial way. More precisely, there exists a deterministic square (hexagonal) tile assembly system S such that no deterministic triangular tile assembly system that is a division of S produces an equivalent supertile (of the same shape and same border glues). There also exists a deterministic triangular tile assembly system T such that no deterministic square (hexagonal) tile assembly system produces the same final supertile while preserving border glues.

Keywords

Equilateral Triangle Tile System Adjacent Edge Tile Type Grid Graph 
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.
    Adleman, L.: Toward a mathematical theory of self-assembly (manuscript, 2000), https://eprints.kfupm.edu.sa/72519/1/72519.pdf
  2. 2.
    Winfree, E., Liu, F., Wenzler, L.A., Seeman, N.C.: Design and self-assembly of two-dimensional DNA crystals. Nature 394, 539–544 (1998)CrossRefGoogle Scholar
  3. 3.
    Wang, H.: Proving theorems by pattern recognition II. Bell System Technical Journal 40, 1–42 (1961)CrossRefGoogle Scholar
  4. 4.
    Winfree, E.: On the computational power of DNA annealing and ligation. In: DNA Based Computers: DIMACS Workshop, vol. 27, pp. 199–221 (1996)Google Scholar
  5. 5.
    Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares. In: Proc. 32nd Ann. ACM Symp. Theor. of Comp. (STOC 2000), pp. 459–468 (2000)Google Scholar
  6. 6.
    Adleman, L., Cheng, Q., Goel, A., Huang, M.: Running time and program size for self-assembled. In: Proc. 33rd Ann. ACM Symp. Theor. of Comp. (STOC 2001), pp. 740–748 (2001)Google Scholar
  7. 7.
    Kao, M., Schweller, R.: Reducing tile complexity for self-assembly through temperature programming. In: Proc. 7th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 571–580 (2006)Google Scholar
  8. 8.
    Liu, D., Wang, M., Deng, Z., Walulu, R., Mao, C.: Tensegrity: Construction of rigid DNA triangles with flexible four-arm DNA junctions. J. Am. Chem. Soc. 126, 2324–2325 (2004)CrossRefGoogle Scholar
  9. 9.
    Ding, B., Sha, R., Seeman, N.C.: Pseudohexagonal 2D DNA crystals from double crossover cohesion. J. Am. Chem. Soc. 126, 10230–10231 (2004)CrossRefGoogle Scholar
  10. 10.
    He, Y., Chen, Y., Liu, H., Ribbe, A.E., Mao, C.: Self-assembly of hexagonal DNA two-dimensional (2D) arrays. J. Am. Chem. Soc. 127, 12202–12203 (2005)CrossRefGoogle Scholar
  11. 11.
    Rothemund, P.W.K., Papadakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biol. 2, e424 (2004), http://dx.doi.org/10.1371/journal.pbio.0020424 CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Lila Kari
    • 1
  • Shinnosuke Seki
    • 1
  • Zhi Xu
    • 1
  1. 1.Department of Computer ScienceUniversity of Western OntarioLondonCanada

Personalised recommendations