Please use this identifier to cite or link to this item:
Title: DNA-based computing of strategic assignment problems
Authors: Shu, Jian Jun
Wang, Qi Wen
Yong, Kian Yan
Keywords: DRNTU::Engineering::Bioengineering
Issue Date: 2011
Source: Shu, J. J., Wang, Q. W., & Yong, K. Y. (2011). DNA-Based Computing of Strategic Assignment Problems. Physical Review Letters, 106(18).
Series/Report no.: Physical review letters
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.
ISSN: 0031-9007
DOI: 10.1103/PhysRevLett.106.188702
Schools: School of Mechanical and Aerospace Engineering 
Rights: © 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:]. 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.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:MAE Journal Articles

Files in This Item:
File Description SizeFormat 
PRL11.pdf443.81 kBAdobe PDFThumbnail

Citations 20

Updated on Feb 18, 2024

Web of ScienceTM
Citations 20

Updated on Oct 28, 2023

Page view(s) 1

Updated on Feb 16, 2024

Download(s) 5

Updated on Feb 16, 2024

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.