Title :
Plasmid DNA computing model of 0–1 programming problem
Author :
Yin Zhixiang ; Chen, Hua ; Bosheng, Song
Author_Institution :
Sch. of Sci., Anhui Univ. of Sci. & Technol., Huainan, China
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.
Keywords :
biocomputing; computational complexity; integer programming; 0-1 programming; DNA algorithm; NP-complete problem; hard computing problem; integer computation; integer programming; plasmid DNA computing model; DNA; 0–1 programming; DNA computing; plasmid;
Conference_Titel :
Bio-Inspired Computing: Theories and Applications (BIC-TA), 2010 IEEE Fifth International Conference on
Conference_Location :
Changsha
Print_ISBN :
978-1-4244-6437-1
DOI :
10.1109/BICTA.2010.5645341
