An Investigation into the Use of DNA Strand Displacement Reaction Networks for Subset Sum Problem Solutions

This paper investigates an innovative application of DNA strand displacement reaction networks in solving the subset sum problem. The subset sum problem is a significant issue in computer science, and this study introduces a method based on DNA strand displacement reaction networks, simulating the specific computational process of solving the subset sum problem through visual DSD. The method involves three cascaded reaction modules-weighted, sum and threshold-ultimately expressed through the output of a single-stranded DNA. Experimental results demonstrate the method's effectiveness in identifying the presence of a target subset in a given set, where the sum equals a specific target value. The computational model presented in this paper lays the groundwork for the applicability of DNA computing in complex problem-solving scenarios, while also providing a foundation for the future development of DNA-based computer systems and biocomputing applications.