Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)
Name
Demaine_Self-assembly of.pdf
Size
834.27 KB
Format
Adobe PDF
Checksum (MD5)
123d72f1b4881a00cbe86a2c2dae721c
Author(s)
Demaine, Erik D.
Patitz, Matthew J.
Schweller, Robert T.
Summers, Scott M.
Date Issued
March 2011
Journal
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Publisher
Schloss Dagstuhl Publishing
Citation
Demaine, Erik, D., Matthew J. Patitz, Robert T. Schweller, and Scott M. Summers. "Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)." in 28th Symposium on Theoretical Aspects of Computer Science (STACS’11). March 10-12, 2011, Technische Universität, Dortmund, Germany. Editors: Thomas Schwentick, Christoph Dürr. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. pp. 201–212.
Version
Final published version
Abstract
We consider a model of algorithmic self-assembly of geometric shapes out of square Wang tiles studied in SODA 2010, in which there are two types of tiles (e.g., constructed out of DNA and RNA material) and one operation that destroys all tiles of a particular type (e.g., an RNAse enzyme destroys all RNA tiles). We show that a single use of this destruction operation enables much more efficient construction of arbitrary shapes. In particular, an arbitrary shape can be constructed using an asymptotically optimal number of distinct tile type (related to the shape's Kolmogorov complexity), after scaling the shape by only a logarithmic factor. By contrast, without the destruction operation, the best such result has a scale factor at least linear in the size of the shape and is connected only by a spanning tree of the scaled tiles. We also characterize a large collection of shapes that can be constructed efficiently without any scaling.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-NonCommercial-No Derivative Works 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.4230/LIPIcs.STACS.2011.201
