Randomized Self-assembly for Approximate Shapes
Randomized Self-assembly for Approximate Shapes
复制标题
近似形状的随机自组装
DOI：
--
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
R. Schweller
中科院分区：
文献类型：
--
作者：
M. Kao;R. Schweller
在本文中，我们设计瓷砖自组装系统组装任意接近目标广场以任意高的概率。这是在以前的工作，只考虑了确定性组件的一个单一的形状。我们的技术利用的能力，分配瓷砖浓度的自组装系统的每个瓷砖类型。这样的分配在可能的组装形状的集合上产生概率分布。我们表明，通过考虑组装的接近目标形状的高概率，而不是精确的确定性组装，我们能够实现瓷砖的复杂性显着降低。事实上，我们将自己限制在恒定大小的瓦片系统中，将关于目标形状的所有信息编码到瓦片浓度分配中。在实践中，这提供了一个潜在有用的折衷，因为大的颗粒库可能是不可行的或需要大量的努力来创建，而复制现有的颗粒来调整相对浓度可能容易得多。为了说明我们的技术，我们专注于组装的n×nsquares，一类特殊的情况下的形状，其研究已被证明是富有成效的新的自组装系统的发展。
In this paper we design tile self-assembly systems which assemble arbitrarily close approximations to target squares with arbitrarily high probability. This is in contrast to previous work which has only considered deterministic assemblies of a single shape. Our technique takes advantage of the ability to assign tile concentrations to each tile type of a self-assembly system. Such an assignment yields a probability distribution over the set of possible assembled shapes. We show that by considering the assembly of close approximations to target shapes with high probability, as opposed to exact deterministic assembly, we are able to achieve significant reductions in tile complexity. In fact, we restrict ourselves to constant sized tile systems, encoding all information about the target shape into the tile concentration assignment. In practice, this offers a potentially useful tradeoff, as large libraries of particles may be infeasible or require substantial effort to create, while the replication of existing particles to adjust relative concentration may be much easier. To illustrate our technique we focus on the assembly of n×nsquares, a special case class of shapes whose study has proven fruitful in the development of new self-assembly systems.
影响因子：
2.9
作者：
FU, TJ;SEEMAN, NC
通讯作者：
SEEMAN, NC