title: DNA computation model to solve 0-1 programming problem.
abstract: 0-1 programming problem is an important problem in opsearch with very widespread applications. In this paper, a new DNA computation model utilizing solution-based and surface-based methods is presented to solve the 0-1 programming problem. This model contains the major benefits of both solution-based and surface-based methods; including vast parallelism, extraordinary information density and ease of operation. The result, verified by biological experimentation, revealed the potential of DNA computation in solving complex programming problem.
authors.affiliation: Department of Control Science and Engineering, Hua Zhong University of Science and Technology, Wuhan 430074, China. zfywuhan@sohu.com
authors.forename: Fengyue
authors.initials: F
authors.lastname: Zhang
authors.forename: Zhixiang
authors.initials: Z
authors.lastname: Yin
authors.forename: Bo
authors.initials: B
authors.lastname: Liu
authors.forename: Jin
authors.initials: J
authors.lastname: Xu
mesh_terms: D000465:Algorithms; D001483:Base Sequence; D019295:Computational Biology / Q000379:methods; D039301:Computers, Molecular; D003205:Computing Methodologies; D004247:DNA / Q000737:chemistry*; D015342:DNA Probes / Q000737:chemistry; D004591:Electrophoresis, Polyacrylamide Gel / Q000379:methods; D016247:Information Storage and Retrieval / Q000379:methods*; D009716:Numerical Analysis, Computer-Assisted; D017422:Sequence Analysis, DNA / Q000379:methods*
chemical_list: D015342:DNA Probes; D004247:DNA