title: DNA-based computing of strategic assignment problems.
abstract: DNA-based computing is a novel technique to tackle computationally difficult problems, in which computing time grows exponentially corresponding to problematic size. A strategic assignment problem is a typical nondeterministic polynomial problem, which is often associated with strategy applications. In this Letter, a new approach dealing with strategic assignment problems is proposed based on manipulating DNA strands, which is believed to be better than the conventional silicon-based computing in solving the same problem.
authors.affiliation: School of Mechanical and Aerospace Engineering, Nanyang Technological University, Singapore, Singapore.
authors.forename: Jian-Jun
authors.initials: JJ
authors.lastname: Shu
authors.forename: Qi-Wen
authors.initials: QW
authors.lastname: Wang
authors.forename: Kian-Yan
authors.initials: KY
authors.lastname: Yong
mesh_terms: D003198:Computer Simulation; D039301:Computers, Molecular; D004247:DNA / Q000737:chemistry* / Q000235:genetics; D008967:Molecular Biology / Q000379:methods*; D013647:Task Performance and Analysis
chemical_list: D004247:DNA