Plasmid DNA computing model of 0–1 programming problem

Abstract

0–1 programming, a special case of integer programming, is a typical Hard computing problem. It has close relation to other NP-complete problems. In this paper, a DNA algorithm by operating on plasmids was presented to solve the problem. The proposed method clearly showed the distinct advantage of plasmid DNA computing model in terms of integer computation.