arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.4383cs.CC
收藏

使用RNA酶的任意碱基的自组装:满足小比例因子的柯尔莫哥洛夫界限(扩展摘要)

Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)

Erik D. Demaine, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers

摘要:

我们考虑了SODA 2010中研究的方形Wang瓦片的几何形状的算法自组装模型,其中有两种类型的瓦片(例如,由DNA和RNA材料构成)和一个破坏特定类型的所有瓦片的操作(例如,RNA酶破坏所有RNA瓦片)。我们表明,一个单一的使用这种销毁操作,使更有效地建设任意形状。特别地,在仅通过对数因子缩放形状之后,可以使用渐进最优数量的不同瓦片类型(与形状的柯尔莫哥洛夫复杂度相关)来构造任意形状。相比之下,在没有破坏操作的情况下,最好的这种结果具有在形状的大小上至少线性的比例因子,并且仅由缩放的瓦片的生成树连接。我们还描述了大量的形状,可以有效地构建没有任何缩放。

英文摘要:

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 types (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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑