title: The general form of 0-1 programming problem based on DNA computing.
abstract: DNA computing is a novel method of solving a class of intractable computational problems, in which the computing speeds up exponentially with the problem size. Up to now, many accomplishments have been made to improve its performance and increase its reliability. In this paper, we solved the general form of 0-1 programming problem with fluorescence labeling techniques based on surface chemistry by attempting to apply DNA computing to a programming problem. Our method has some significant advantages such as simple encoding, low cost, and short operating time.
authors.affiliation: Department of Mathematics and Physics, Anhui University of Science and Technology, Anhui 232001, China. zxyin@mail.hust.edu.cn
authors.forename: Yin
authors.initials: Y
authors.lastname: ZhiXiang
authors.forename: Zhang
authors.initials: Z
authors.lastname: Fengyue
authors.forename: Xu
authors.initials: X
authors.lastname: Jin
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D003201:Computers; D039301:Computers, Molecular; D004247:DNA / Q000737:chemistry*; D004581:Electronics; D004791:Enzyme Inhibitors / Q000737:chemistry; D016247:Information Storage and Retrieval / Q000379:methods*; D008128:Logic; D008956:Models, Chemical; D009690:Nucleic Acid Conformation; D009691:Nucleic Acid Denaturation; D012815:Signal Processing, Computer-Assisted / Q000295:instrumentation*; D013696:Temperature
chemical_list: D004791:Enzyme Inhibitors; D004247:DNA