Making all spanning tree problem based on sticker model

The composition of sticker model is discussed. In order to improve the successful rate of separation experiment, DNA strand is used as memory strand and separation probe and PNA strand is used as sticker strand. Fundamental biochemistry experiments of sticker model and their realization process are analyzed. Based on separation technology and electrophoresis experiment, a new detection experiment is put forward, which can be used to detect several kinds of memory complex. DNA algorithm of making all spanning tree problem and its biochemical realization process are put forward, first the initial solution space of spanning subgraph is created, then all spanning trees are selected from the initial solution space. During the creation of solution space of spanning subgraph, complete hybridization based on incomplete separation is first put forward, which can separate equably one tube into several tubes according to the requirement of algorithm design. The correctness and complexity of the DNA algorithm are discussed and proved. Finally, the feasibility and validity of the DNA algorithm are explained by a simulate experiment. Two kinds of biotechnology techniques are first put forward, which are detection experiment based on separation technology and complete hybridization based on incomplete separation, and DNA algorithm of making all spanning tree problem is also first put forward.