Literature DB >> 21635133

DNA-based computing of strategic assignment problems.

Jian-Jun Shu1, Qi-Wen Wang, Kian-Yan Yong.   

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.

Entities:  

Mesh:

Substances:

Year:  2011        PMID: 21635133     DOI: 10.1103/PhysRevLett.106.188702

Source DB:  PubMed          Journal:  Phys Rev Lett        ISSN: 0031-9007            Impact factor:   9.161


  4 in total

1.  Parallelizing Assignment Problem with DNA Strands.

Authors:  Babak Khorsand; Abdorreza Savadi; Mahmoud Naghibzadeh
Journal:  Iran J Biotechnol       Date:  2020-01-01       Impact factor: 1.671

2.  Degeneracy allows for both apparent homogeneity and diversification in populations.

Authors:  James M Whitacre; Sergei P Atamas
Journal:  Biosystems       Date:  2012-08-10       Impact factor: 1.973

3.  Beyond Parrondo's paradox.

Authors:  Jian-Jun Shu; Qi-Wen Wang
Journal:  Sci Rep       Date:  2014-02-28       Impact factor: 4.379

4.  A statistical thin-tail test of predicting regulatory regions in the Drosophila genome.

Authors:  Jian-Jun Shu; Yajing Li
Journal:  Theor Biol Med Model       Date:  2013-02-14       Impact factor: 2.432

  4 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.