The invention belongs to the technical field of biological computing, and discloses a general graph problem solving method and
system based on
DNA strand displacement, and the method comprises the steps: S1, carrying out graph structure modeling, and carrying out graph representation module based on
DNA strand displacement; s2, constructing a detection module, and realizing parallel biochemical identification of constraint conditions by using a detection gate D (u) containing a
fluorescence label; and S3, carrying out
parallel detection on candidate solutions, supporting a unified solution framework of problems such as a minimum
control set and a maximum independent set, and realizing rapid screening of the solutions through candidate solution enumeration and a
fluorescence signal criterion. The method and the
system provided by the invention adopt a modular
cascade structure, realize direct solution of a complex problem on the premise of not depending on electronic calculation conversion, compress a solution space in combination with a graph feature value preprocessing technology, have the technical advantages of high neighborhood recognition accuracy, strong leakage reaction inhibition, strong experimental process universality and the like, and have a wide application prospect. And the application efficiency and stability of
DNA calculation in the field of
combinatorial optimization are remarkably improved.