Job shop scheduling problem based on DNA computing

This paper proposes a DNA algorithm based on biological technology for the maximal matching problem. Maximum matching problem is a typical combinatorial optimization problem. The main idea of the algorithm is draw the line graph to observe adjacent edges firstly, then use the direct proportional length-based DNA strands to encode the given weighted graph edges. All data pool generated in a test tube. Then the result comes out by a series of biological reaction and computation such as denaturation, anneal, Polymerase Chain Reaction, enzyme-cutting reaction, gel electrophoresis. The maximal matching of the graph will find. Finally this article discusses the feasibility of this algorithm and confirmed its effectiveness by an example.

A DNA algorithm for maximal matching problem

Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm

The minimum vertex cover problem is to find a minimum subset of vertex which covers all the edges in a given graph. This is a NP-complete problem. The DNA algorithm for the vertex cover problem based on bio-molecular technology is introduced. The key of the algorithm is that mathematical problem is mapped onto DNA strand and the vertex is coded by DNA sequence. The problem is solved by tube operation that performs the basic core processing and extraction that makes the results visible. On the basis of the experiment method of bio-molecular, the algorithm is an effective method. Finally, the advantage and disadvantage are discussed, the future research directions are pointed out.

Gao Lin

Papers

DNA algorithm for minimum vertex cover problem based on molecular computation