Department of Mathematics and Statistics, University of South Florida, Tampa, FL 33620, USA.
Interface Focus. 2012 Aug 6;2(4):504-11. doi: 10.1098/rsfs.2011.0117. Epub 2012 Feb 8.
The paper reviews two computing models by DNA self-assembly whose proof of principal have recently been experimentally confirmed. The first model incorporates DNA nano-devices and triple crossover DNA molecules to algorithmically arrange non-DNA species. This is achieved by simulating a finite-state automaton with output where golden nanoparticles are assembled to read-out the result. In the second model, a complex DNA molecule representing a graph emerges as a solution of a computational problem. This supports the idea that in molecular self-assembly computing, it may be necessary to develop the notion of shape processing besides the classical approach through symbol processing.
本文综述了最近通过 DNA 自组装实验验证原理的两种计算模型。第一种模型结合了 DNA 纳米器件和三链交叉 DNA 分子，以算法方式排列非 DNA 物质。这是通过模拟具有输出的有限状态自动机来实现的，其中金纳米粒子被组装以读取结果。在第二种模型中，代表图的复杂 DNA 分子作为计算问题的解决方案出现。这支持了这样一种观点，即在分子自组装计算中，除了通过符号处理的经典方法之外，可能还需要发展形状处理的概念。
