Negative Interactions in Irreversible Self-assembly
- 241 Downloads
This paper explores the use of negative (i.e., repulsive) interactions in the abstract Tile Assembly Model defined by Winfree. Winfree in his Ph.D. thesis postulated negative interactions to be physically plausible, and Reif, Sahu, and Yin studied them in the context of reversible attachment operations. We investigate the power of negative interactions with irreversible attachments, and we achieve two main results. Our first result is an impossibility theorem: after t steps of assembly, Ω(t) tiles will be forever bound to an assembly, unable to detach. Thus negative glue strengths do not afford unlimited power to reuse tiles. Our second result is a positive one: we construct a set of tiles that can simulate an s-space-bounded, t-time-bounded Turing machine, while ensuring that no intermediate assembly grows larger than O(s), rather than O(s⋅t) as required by the standard Turing machine simulation with tiles. In addition to the space-bounded Turing machine simulation, we show another example application of negative glues: reducing the number of tile types required to assemble “thin” (n×o(logn/loglogn)) rectangles.
KeywordsSelf-assembly Self-destructible Negative bond strength Molecular computing DNA computing Space-bounded computation
The authors are grateful to Shinnosuke Seki for insightful discussions and anonymous referees for their suggestions.
- 4.Doty, D., Lutz, J.H., Patitz, M.J., Summers, S.M., Woods, D.: Random number selection in self-assembly. In: UC 2009: Proceedings of the Eighth International Conference on Unconventional Computation. Lecture Notes in Computer Science, vol. 5715, pp. 143–157. Springer, Berlin (2009) Google Scholar
- 5.Doty, D., Lutz, J.H., Patitz, M.J., Summers, S.M., Woods, D.: Intrinsic universality in self-assembly. In: STACS 2010: Proceedings of the Twenty-Seventh International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), vol. 5, pp. 275–286 (2010) Google Scholar
- 6.Patitz, M.J., Schweller, R.T., Summers, S.M.: Exact shapes and Turing universality at temperature 1 with a single negative glue. In: DNA 17: Proceedings of the 17th International Conference on DNA Computing and Molecular Programming, DNA’11, pp. 175–189. Springer, Berlin (2011) CrossRefGoogle Scholar
- 12.Wang, H.: Proving theorems by pattern recognition—II. Bell Syst. Tech. J. XL(1), 1–41 (1961) Google Scholar
- 13.Winfree, E.: Algorithmic Self-assembly of DNA. Ph.D. thesis, California Institute of Technology (June 1998) Google Scholar