Advertisement

Randomized Self Assembly of Rectangular Nano Structures

  • Vamsi Kundeti
  • Sanguthevar Rajasekaran
Conference paper
  • 865 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6518)

Abstract

Self assembly systems have numerous critical applications in medicine, circuit design, etc. For example, they can serve as nano drug delivery systems. The problem of assembling squares has been well studied. A lower bound on the tile complexity of any deterministic self assembly system for an N×N square is \(\Omega(\frac{\log(N)}{\log(\log(N))})\) (inferred from the Kolmogrov complexity). Deterministic self assembly systems with an optimal tile complexity have been designed for squares and related shapes in the past. However designing \(\Theta(\frac{\log(N)}{\log(\log(N))})\) unique tiles specific to a shape which needs to be self assembled is still an intensive task. Creating a copy of a tile is much simpler than creating a unique tile. With this constraint in mind probabilistic self assembly systems were introduced. These systems have O(1) tile complexity and the concentration of each of the tiles can be varied to produce the desired shape. Becker, et al. [1] introduced a line sampling technique which can self assemble m×n rectangles, where m is the expected width and n is the expected height of the rectangle. Kao, et al. [2] combined the line sampling technique with binary counters in a novel way to self assemble a supertile which can encode a binary string. This supertile can then be used to produce an n′×n′ square such that (1 − ε)n ≤ n′ ≤ (1 + ε)n (for some relevant ε) with probability ≥ 1 − δ for sufficiently large n (i.e., n ≥ f(ε,δ), for some appropriate function f). Doty[3] made the idea of Kao more precise, however the underlying construction is still based on sub-tiles to perform binary counting and division.

In this paper we present randomized algorithms that can self assemble squares, rectangles and rectangles with constant aspect ratio with high probability (i.e. Ω(1 − 1/n α ), for any fixed α> 0) where n is the dimension of the shape which needs to be self assembled. Our self assembly constructions do not need any approximation frames introduced in Kao et al. [2] and hence are much cleaner and has significantly smaller constant in the tile complexity compared to both Kao [2] and Doty [3]. Finally In contrast to the existing randomized self assembly techniques our techniques can also self assemble a much stronger class of rectangles which have a fixed aspect ratio (α/β).

Keywords

Assembly System Binary String Geometric Distribution Target Shape Assembly Technique 
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.
    Becker, F., Rapaport, I., Rémila, É.: Self-assemblying classes of shapes with a minimum number of tiles, and in optimal time. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 45–56. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    Kao, M.-Y., Schweller, R.T.: Randomized self-assembly for approximate shapes. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 370–384. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  3. 3.
    Doty, D.: Randomized self-assembly for exact shapes. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 85–94. IEEE, Los Alamitos (2009)Google Scholar
  4. 4.
    Rothemund, P.W.K., Papadakis, N., Winfree, E.: Algorithmic self-assembly of dna sierpinski triangles. PLoS Biology 2(12) (2004)Google Scholar
  5. 5.
    Winfree, E.: Algorithmic self-assembly of dna. dissertation (ph.d.), california institute of technology (1998), http://resolver.caltech.edu/CaltechETD:etd-05192003-110022
  6. 6.
    Wang, H.: An unsolvable problem on dominoes. Technical Report BL-30 (1962)Google Scholar
  7. 7.
    Rothemund, P.W.K., Winfree, E.: Program-size complexity of self-assembled squares. In: ACM Symposium on Theory of Computation (STOC), pp. 459–468 (2000)Google Scholar
  8. 8.
    Adleman, L., Cheng, Q., Goel, A., Huang, M.: Running time and program size for self-assembled squares. In: Annual ACM Symposium on Theory of Computing, pp. 740–748 (2001)Google Scholar
  9. 9.
    Aggarwal, G., Cheng, Q.I., Goldwasser, M.H., Kao, M., De Espanes, P.M., Schweller, R.T.: Complexities for generalized models of self-assembly. SIAM Journal on Computing 34(6), 1493–1515 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Kao, M., Schweller, R.: Reducing tile complexity for self-assembly through temperature programming. In: Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 571–580 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Vamsi Kundeti
    • 1
  • Sanguthevar Rajasekaran
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of Connecticut StorrsUSA

Personalised recommendations