0-1 integer programming based on DNA tetrahedral probe

Abstract

It is difficult to find an effective algorithm for solving NP complete problems such as integer programming. The nanostructure constructed by DNA origami combines huge parallelism and massive storage capacity of DNA computing. In the calculation process, it can effectively avoid the number of experimental operations required by other DNA computing models. It greatly reduces the time consumption and the rate of misinterpretation, thus providing an effective way to efficiently solve integer programming. DNA tetrahedron is a nanostructure constructed by origami. It has stable structure, good toughness and compression resistance, simple production process, high yield, rich functional modification sites, good biocompatibility, but also resistance to a variety of specific or non-specific nuclease. Therefore it can reduce the misinterpretation rate of biochemical reactions using DNA tetrahedron and DNA single strand to construct probes, finding the true solution according to the constraint condition. And then it can improve the computational efficiency of the model.