DNA-based computing of strategic assignment problems

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....

Full description

Saved in:
Bibliographic Details
Main Authors: Shu, Jian Jun, Wang, Qi Wen, Yong, Kian Yan
Other Authors: School of Mechanical and Aerospace Engineering
Format: Article
Language:English
Published: 2011
Subjects:
Online Access:https://hdl.handle.net/10356/94052
http://hdl.handle.net/10220/7123
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-94052
record_format dspace
spelling sg-ntu-dr.10356-940522023-03-04T17:17:59Z DNA-based computing of strategic assignment problems Shu, Jian Jun Wang, Qi Wen Yong, Kian Yan School of Mechanical and Aerospace Engineering DRNTU::Engineering::Bioengineering 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. Published version 2011-09-29T07:31:10Z 2019-12-06T18:49:59Z 2011-09-29T07:31:10Z 2019-12-06T18:49:59Z 2011 2011 Journal Article Shu, J. J., Wang, Q. W., & Yong, K. Y. (2011). DNA-Based Computing of Strategic Assignment Problems. Physical Review Letters, 106(18). 0031-9007 https://hdl.handle.net/10356/94052 http://hdl.handle.net/10220/7123 10.1103/PhysRevLett.106.188702 158237 en 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. 4 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::Bioengineering
spellingShingle DRNTU::Engineering::Bioengineering
Shu, Jian Jun
Wang, Qi Wen
Yong, Kian Yan
DNA-based computing of strategic assignment problems
description 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.
author2 School of Mechanical and Aerospace Engineering
author_facet School of Mechanical and Aerospace Engineering
Shu, Jian Jun
Wang, Qi Wen
Yong, Kian Yan
format Article
author Shu, Jian Jun
Wang, Qi Wen
Yong, Kian Yan
author_sort Shu, Jian Jun
title DNA-based computing of strategic assignment problems
title_short DNA-based computing of strategic assignment problems
title_full DNA-based computing of strategic assignment problems
title_fullStr DNA-based computing of strategic assignment problems
title_full_unstemmed DNA-based computing of strategic assignment problems
title_sort dna-based computing of strategic assignment problems
publishDate 2011
url https://hdl.handle.net/10356/94052
http://hdl.handle.net/10220/7123
_version_ 1759853873001922560