Saitou K
Department of Mechanical Engineering and Applied Mechanics, University of Michigan, Ann Arbor 48109-2125, USA.
Pac Symp Biocomput. 1998:609-20.
An abstract model of self-assembling systems is presented where assembly instructions are written as conformational switches-local rules that specify conformational changes of a component. The model, the self-assembling automaton, is defined as a sequential rule-based machine that operates on one-dimensional strings of symbols. Classes of self-assembling automata are defined based on classes of subassembly sequences in which the components self-assemble. The minimum number of conformations is provided which are necessary to encode subassembly sequences in the each class. It is shown that three conformations for each component are enough to encode any subassembly sequences of a string with arbitrary length.
本文提出了一种自组装系统的抽象模型，其中组装指令被编写为构象开关——即指定组件构象变化的局部规则。该模型，即自组装自动机，被定义为一种基于规则的顺序机器，它对一维符号串进行操作。自组装自动机的类别是根据组件在其中自组装的子组装序列的类别来定义的。给出了在每个类别中编码子组装序列所需的最少构象数。结果表明，每个组件的三种构象足以编码任意长度字符串的任何子组装序列。
