Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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 ighted 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.
['Xiao Ding', 'Zhixiang Yin', 'Yong Wang']
I am writing a research paper on a idea A DNA algorithm for maximal matching problem
[{"from": "human", "value": "I am writing a research paper on a idea A DNA algorithm for maximal matching problem"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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 ighted 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."}]