Len Adleman
Qi Cheng
ABSTRACT
Self-assembly is the ubiquitous process by which simple objects autonomously assemble into intricate complexes. It has been suggested that intricate self-assembly processes will ultimately be used in circuit fabrication, nano-robotics, DNA computation, and amorphous computing. In this paper, we study two combinatorial optimization problems related to efficient self-assembly of shapes in the Tile Assembly Model of self-assembly proposed by Rothemund and Winfree [18]. The first is the Minimum Tile Set Problem, where the goal is to find the smallest tile system that uniquely produces a given shape. The second is the Tile Concentrations Problem, where the goal is to decide on the relative concentrations of different types of tiles so that a tile system assembles as quickly as possible. The first problem is akin to finding optimum program size, and the second to finding optimum running time for a "program" to assemble the shape.Self-assembly is the ubiquitous process by which simple objects autonomously assemble into intricate complexes. It has been suggested that intricate self-assembly processes will ultimately be used in circuit fabrication, nano-robotics, DNA computation, and amorphous computing. In this paper, we study two combinatorial optimization problems related to efficient self-assembly of shapes in the Tile Assembly Model of self-assembly proposed by Rothemund and Winfree [18]. The first is the Minimum Tile Set Problem, where the goal is to find the smallest tile system that uniquely produces a given shape. The second is the Tile Concentrations Problem, where the goal is to decide on the relative concentrations of different types of tiles so that a tile system assembles as quickly as possible. The first problem is akin to finding optimum program size, and the second to finding optimum running time for a "program" to assemble the shape.We prove that the first problem is NP-complete in general, and polynomial time solvable on trees and squares. In order to prove that the problem is in NP, we present a polynomial time algorithm to verify whether a given tile system uniquely produces a given shape. This algorithm is analogous to a program verifier for traditional computational systems, and may well be of independent interest. For the second problem, we present a polynomial time $O(\log n)$-approximation algorithm that works for a large class of tile systems that we call partial order systems.
- H. Abelson, D, Allen, D. Coore, C. Hanson, G. Homsy, T. Knight, R. Nagpal, E. Rauch, G. Sussman and R. Weiss. Amorphous Computing. Communications of the ACM vol 43, p 74--82, 2000. Google Scholar
Digital Library
- L. Adleman. Towards a (MATH)ematical theory of self-assembly. Technical Report 00-722, Department of Computer Science, University of Southern California, (2000).Google Scholar
- L. Adleman, Q. Cheng, A. Goel, M. Huang and Hal Wasserman. Linear Self-Assemblies: Equilibria, Entropy, and Convergence Rates. Unpublished.Google Scholar
- L. Adleman, Q. Cheng, A. Goel and M. Huang, Running time and program size for self-assembled squares, ACM Symposium on Theory of Computing (STOC) 2001. pages 740--748. Google ScholarDigital Library
- M. Cook, D. Kempe, P. Rothemund, E. Winfree.Google Scholar
- M. Cook, D. Kempe, P. Rothemund, E. Winfree. Personal communication.Google Scholar
- M. Gomez-Lopez, J. Preece, and J. Stoddart, The art and science of self-assembling molecular machines, Nanotechnology, Vol. 7, No. 3, pp. 183--192, September 1996.Google Scholar
- D. Gracias, J. Tien, T. Breen, C. Hsu and G. Whitesides, Forming Electrical Networks in Three Dimensions by Self-Assembly, Science 289, 5482, p 1170--1173 (2000).Google Scholar
- M. Grotschel, L. Lovasz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 1993 (2nd corrected edition).Google ScholarCross Ref
- L. Khachian, A Polynomial Algorithm in Linear Programming. Soviet (MATH)ematics Doklady 20, 191--194 (1979).Google Scholar
- G. Lopinski, D. Wayner and R. Wolkow. Self-Directed Growth of Molecular Nano-Structures on Silicon. Nature 406, 48 (2000).Google Scholar
- G. Louth, M. Mitzenmacher and F. Kelly. Computational complexity of loss networks, Theoretical Computer Science journal, (1994) vol 125, p 45--59. Google ScholarDigital Library
- C. Mao, T. LaBean, J. Reif and N. Seeman. Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature.407, 493--496. (2000).Google ScholarCross Ref
- Lagoudakis and T. LaBean. 2D DNA Self-Assembly for Satisfiability. in DIMACS Series in Discrete (MATH)ematics and Theoretical Computer Science 1999, Volume 54, Editors: E. Winfree and D.K. Gifford, Proceedings of the 5th DIMACS Workshop on DNA Based Computers; MIT: Cambridge. ISBN 0-8218-2053-2Google Scholar
- J. Reif. Local Parallel Biomolecular Computation. Third Annual DIMACS Workshop on DNA Based Computers, University of Pennsylvania, June 23--26, 1997. Published in DNA Based Computers, III, DIMACS Series in Discrete (MATH)ematics and Theoretical Computer Science, Vol 48 (ed. H. Rubin), American (MATH)ematical Society, p 217--254, (1999).Google Scholar
- P. Rothemund. Using lateral capillary forces to compute by self-assembly. Proceedings of the National Academy of Sciences, vol 9. p 984--989. (2000).Google ScholarCross Ref
- P. Rothemund. Theory and Experiments in Algorithmic Self-Assembly University of Southern California Ph.D. Thesis Copyright 2001. Google ScholarDigital Library
- P. Rothemund and E. Winfree. The program-size complexity of self-assembled squares. ACM Symposium on Theory of Computing (STOC) 2001. pages 459--468. Google ScholarDigital Library
- J.H. Schön, H. Meng and Z. Bao. Self-assembled monolayer organic field-effect transistors. Nature. 413, 713--715. (2001).Google Scholar
- H. Wang. Proving theorems by pattern recognition. II. Bell Systems Technical Journal, 40:1--42, (1961).Google ScholarCross Ref
- E. Winfree, X. Yang and N. Seeman, Universal Computation via Self-assembly of DNA: Some Theory and Experiments, Proceedings of the Second Annual Meeting on DNA Based Computers, Princeton University, June 10--12, (1996).Google Scholar
- E. Winfree, F. Liu, L. Wenzler, N. Seeman. Design and self-assembly of two-dimensional DNA crystals, 6 pages. (Nature 394, 539--544 (Aug. 6, 1998) Article).Google ScholarCross Ref
- E. Winfree. Algorithmic Self-Assembly of DNA, Ph.D. thesis. California Institute of Technology, Pasadena, (1998). Google ScholarDigital Library
- G. Whitesides, J. (MATH)ias and Christopher T. Seto. Molecular self-assembly and nanochemistry: a chemical strategy for the synthesis of nanostructures, Science, vol 254, p 1312--1319. Nov 1991.Google Scholar
Index Terms
- Combinatorial optimization problems in self-assembly
Recommendations
Algorithmic DNA self-assembly
AAIM'06: Proceedings of the Second international conference on Algorithmic Aspects in Information and ManagementSelf-assembly is the ubiquitous process by which objects autonomously assemble into complexes. This phenomenon is common in nature and yet is poorly understood from mathematical and programming perspectives. It is believed that self-assembly technology ...
Reflections on tiles (in self-assembly)
We define the Reflexive Tile Assembly Model (RTAM), which is obtained from the abstract Tile Assembly Model (aTAM) by allowing tiles to reflect across their horizontal and/or vertical axes. We show that the class of directed temperature-1 RTAM systems ...
Triangular tile self-assembly systems
DNA'10: Proceedings of the 16th international conference on DNA computing and molecular programmingWe discuss theoretical aspects of the self-assembly of triangular tiles; in particular, right triangular tiles and equilateral triangular tiles. Contrary to intuition, we show that triangular tile assembly systems and square tile assembly systems are ...
Comments