DNA-based computing of strategic assignment problems
Shu, Jian Jun
Wang, Qi Wen
Yong, Kian Yan
Date of Issue2011
School of Mechanical and Aerospace Engineering
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.
Physical review letters
© 2011 American Physical Society. This paper was published in Physical Review Letters and is made available as an electronic reprint (preprint) with permission of American Physical Society. The paper can be found at: [DOI: http://dx.doi.org/10.1103/PhysRevLett.106.188702]. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law.