DNA algorithm on making spanning tree problem

Composition and biochemistry experiments of sticker model and the realization process of fundamental biochemical experiments are discussed. Based on separation technology and electrophoresis experiment, a new detection experiment is put forward, which can be used to detect experimental results containing various 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 creating solution space of spanning subgraph, complete hybridization based on incomplete separation is first put forward, which can separate equally 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 validity and feasibility of the DNA algorithm are explained by a simulate experiment. Two kinds of biotechnology 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.