Title of article
A combinatorial approach to the problem of self-assembly Original Research Article
Author/Authors
Yakov S. Smetanich، نويسنده , , Yakov B. Kazanovich، نويسنده , , Vyacheslav V. Kornilov، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
21
From page
45
To page
65
Abstract
A formal scheme is proposed in order to mathematically describe some real features of the biological assembly. The assembly is considered to be a process of pairwise interactions of subunits leading to the creation of structures. If only one structure can be assembled according to the given interaction rules, it is called unique. Unique structures are interpreted as formal analogs of self-assembling biological structures. A criterion is found which can be used to develop an effective algorithm for recognizing the uniqueness of finite structures. Symmetry of finite and infinite unique structures is investigated. The relation is determined between the symmetry group of an infinite unique structure and its packing in space which enables classification of such structures in crystallographic terms. The applications of the formal scheme are discussed.
Journal title
Discrete Applied Mathematics
Serial Year
1995
Journal title
Discrete Applied Mathematics
Record number
884170
Link To Document