DNA-based computing of strategic assignment problems

DSpace/Manakin Repository


Search DR-NTU

Advanced Search Subject Search


My Account

DNA-based computing of strategic assignment problems

Show simple item record

dc.contributor.author Shu, Jian Jun
dc.contributor.author Wang, Qi Wen
dc.contributor.author Yong, Kian Yan
dc.date.accessioned 2011-09-29T07:31:10Z
dc.date.available 2011-09-29T07:31:10Z
dc.date.copyright 2011
dc.date.issued 2011-09-29
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).
dc.identifier.issn 0031-9007
dc.identifier.uri http://hdl.handle.net/10220/7123
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.
dc.format.extent 4 p.
dc.language.iso en
dc.relation.ispartofseries Physical review letters
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.
dc.subject DRNTU::Engineering::Bioengineering.
dc.title DNA-based computing of strategic assignment problems
dc.type Journal Article
dc.contributor.school School of Mechanical and Aerospace Engineering
dc.identifier.doi http://dx.doi.org/10.1103/PhysRevLett.106.188702
dc.description.version Published version
dc.identifier.rims 158237

Files in this item

Files Size Format View
PRL11.pdf 454.4Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record


Total views

All Items Views
DNA-based computing of strategic assignment problems 1090

Total downloads

All Bitstreams Views
PRL11.pdf 470

Top country downloads

Country Code Views
Singapore 171
United States of America 146
China 60
India 13
Japan 7

Top city downloads

city Views
Singapore 171
Mountain View 57
Beijing 41
Fort Lauderdale 11
Chandigarh 8

Downloads / month

  2014-11 2014-12 2015-01 total
PRL11.pdf 0 0 5 5