Difference between revisions of "DNA computing"
| Line 1: | Line 1: | ||
'''DNA Computing Papers'''<br> | '''DNA Computing Papers'''<br> | ||
| − | [http://gcat.davidson.edu/mediawiki-1.15.0/images/6/62/Adelman_1994.pdf Adleman 1994]<br> | + | [http://gcat.davidson.edu/mediawiki-1.15.0/images/6/62/Adelman_1994.pdf Adleman 1994] First DNA computer, used to solve 7-node, 14-edge HPP<br> |
[http://gcat.davidson.edu/mediawiki-1.15.0/images/2/22/Benneson_review_2009.pdf Benneson review 2009] Review of DNA computers in terms of Tiling systems, State Machines, Logic Networks. <br> | [http://gcat.davidson.edu/mediawiki-1.15.0/images/2/22/Benneson_review_2009.pdf Benneson review 2009] Review of DNA computers in terms of Tiling systems, State Machines, Logic Networks. <br> | ||
Revision as of 13:55, 1 June 2011
DNA Computing Papers
Adleman 1994 First DNA computer, used to solve 7-node, 14-edge HPP
Benneson review 2009 Review of DNA computers in terms of Tiling systems, State Machines, Logic Networks.
Chen 1999 DNA Comuting Implementing Genetic Algorithms
ShapiroNature2004 DNA computer to analyze mRNA levels
Roweis stickers 1996 A sticker based model for DNA computation
Rothemund 2000 DNA computing by self-assembly
Benneson 2003 DNA computer using restriction and ligation
Boneh 1996 Review on the computational power of DNA
Adleman Scientific American Good introduction to Adleman HPP experiment
Adleman Data Encryption Standard 1999 Proposal to use the Sticker Model to attack the US Data Encryption Standard
Ravinderjit 2000 Using a gel based DNA computer to solve a 6-variable 11-clause 3-SAT problem
Molecular Computation by Hairpin Formation; Sakamoto et al.
Need full text from this paper: DNA-Based Computing of Strategic Assignment Problems, http://prl.aps.org/abstract/PRL/v106/i18/e188702
Criticism of DNA-Based Computing of Strategic Assignment Problems: http://arstechnica.com/science/news/2011/05/is-dna-computing-going-to-terminate-internet-banking.ars
