Advertisement

Self-assembly of Discrete Self-similar Fractals

(Extended Abstract)
  • Matthew J. Patitz
  • Scott M. Summers
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5347)

Abstract

In this paper, we search for absolute limitations of the Tile Assembly Model (TAM), along with techniques to work around such limitations. Specifically, we investigate the self-assembly of fractal shapes in the TAM. We prove that no self-similar fractal fully weakly self-assembles at temperature 1, and that certain kinds of self-similar fractals do not strictly self-assemble at any temperature. Additionally, we extend the fiber construction from Lathrop et. al. (2007) to show that any self-similar fractal belonging to a particular class of “nice” self-similar fractals has a fibered version that strictly self-assembles in the TAM.

Keywords

Assembly Sequence Impossibility Result Tile Type Grid Graph Fractal Shape 
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.
    Aggarwal, G., Goldwasser, M.H., Kau, M.-Y., Schweller, R.T.: Complexities for generalized models of self-assembly. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (2004)Google Scholar
  2. 2.
    Cheng, Q., Goel, A., de Espanés, P.M.: Optimal self-assembly of counters at temperature two. In: Proceedings of the First Conference on Foundations of Nanoscience: Self-assembled Architectures and Devices (2004)Google Scholar
  3. 3.
    Doty, D., Gu, X., Lutz, J.H., Mayordomo, E., Moser, P.: Zeta-dimension. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 283–294. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Kao, M.-Y., Schweller, R.: Reducing tile complexity for self-assembly through temperature programming. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), Miami, Florida, pp. 571–580 (January 2006) (2007)Google Scholar
  5. 5.
    Lathrop, J.I., Lutz, J.H., Patitz, M.J., Summers, S.M.: Computability and complexity in self-assembly. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 349–358. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Lathrop, J.I., Lutz, J.H., Summers, S.M.: Strict self-assembly of discrete sierpinski triangles. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497, pp. 455–464. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Majumder, U., LaBean, T.H., Reif, J.H.: Activatable tiles: Compact, robust programmable assembly and other applications. In: Garzon, M.H., Yan, H. (eds.) DNA 2007. LNCS, vol. 4848, pp. 15–25. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  8. 8.
    Rothemund, P.W.K.: Theory and experiments in algorithmic self-assembly, Ph.D. thesis, University of Southern California (December 2001)Google Scholar
  9. 9.
    Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 459–468 (2000)Google Scholar
  10. 10.
    Seeman, N.C.: Nucleic-acid junctions and lattices. Journal of Theoretical Biology 99, 237–247 (1982)CrossRefGoogle Scholar
  11. 11.
    Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. SIAM Journal on Computing 36, 1544–1569 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Wang, H.: Proving theorems by pattern recognition – II. The Bell System Technical Journal XL(1), 1–41 (1961)CrossRefGoogle Scholar
  13. 13.
    Wang, H.: Dominoes and the AEA case of the decision problem. In: Proceedings of the Symposium on Mathematical Theory of Automata (New York, 1962), pp. 23–55. Polytechnic Press of Polytechnic Inst. of Brooklyn, Brooklyn (1963)Google Scholar
  14. 14.
    Winfree, E.: Algorithmic self-assembly of DNA, Ph.D. thesis, California Institute of Technology (June 1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Matthew J. Patitz
    • 1
  • Scott M. Summers
    • 1
  1. 1.Department of Computer ScienceIowa State UniversityAmesUSA

Personalised recommendations