Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/94052
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shu, Jian Jun | en |
dc.contributor.author | Wang, Qi Wen | en |
dc.contributor.author | Yong, Kian Yan | en |
dc.date.accessioned | 2011-09-29T07:31:10Z | en |
dc.date.accessioned | 2019-12-06T18:49:59Z | - |
dc.date.available | 2011-09-29T07:31:10Z | en |
dc.date.available | 2019-12-06T18:49:59Z | - |
dc.date.copyright | 2011 | en |
dc.date.issued | 2011 | en |
dc.identifier.citation | Shu, J. J., Wang, Q. W., & Yong, K. Y. (2011). DNA-Based Computing of Strategic Assignment Problems. Physical Review Letters, 106(18). | en |
dc.identifier.issn | 0031-9007 | en |
dc.identifier.uri | https://hdl.handle.net/10356/94052 | - |
dc.description.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. | en |
dc.format.extent | 4 p. | en |
dc.language.iso | en | en |
dc.relation.ispartofseries | Physical review letters | en |
dc.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: 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. | en |
dc.subject | DRNTU::Engineering::Bioengineering | en |
dc.title | DNA-based computing of strategic assignment problems | en |
dc.type | Journal Article | en |
dc.contributor.school | School of Mechanical and Aerospace Engineering | en |
dc.identifier.doi | 10.1103/PhysRevLett.106.188702 | en |
dc.description.version | Published version | en |
dc.identifier.rims | 158237 | en |
item.grantfulltext | open | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | MAE Journal Articles |
SCOPUSTM
Citations
20
23
Updated on Jan 18, 2023
Web of ScienceTM
Citations
20
22
Updated on Jan 29, 2023
Page view(s) 1
1,875
Updated on Feb 1, 2023
Download(s) 5
790
Updated on Feb 1, 2023
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.