22 Information Theory References - Adleman and papers related tomolecular computation
Description
This article is from the Biological Information Theory and Chowder Society FAQ, by Thomas D. Schneider toms@ncifcrf.gov.
22 Information Theory References - Adleman and papers related tomolecular computation
Tom Schneider has a list of molecular computation resources.
A longer and more complete list of references is maintained by J.H.M.Dassen
(jdassen@wi.leidenuniv.nl) in A biblography on Molecular Computation and
Splicing Systems (http://www.wi.LeidenUniv.nl/~jdassen/dna.bib). There are
also hyperlinks to most of the (90+) papers
(http://www.wi.LeidenUniv.nl/~jdassen/dna.html).
@article{Adleman1994,
author = "Leonard M. Adleman",
title = "Molecular computation of solutions to combinatorial problems",
journal = "Science",
volume = "266",
pages = "1021-1024",
date = "November 11",
year = 1994}
@article{Baum1995,
author = "Eric B. Baum",
title = "Building an associative memory vastly larger that the brain",
journal = "Science",
volume = "268",
pages = "583-585",
date = "April 28",
year = 1995}
@article{Lipton1995,
author = "Richard J. Lipton",
title = "DNA solution of hard computational problems",
journal = "Science",
volume = "268",
pages = "542-545",
date = "April 28",
year = 1995}
@manuscript{Adleman1995,
author = "Leonard M. Adleman",
title = "On constructing a molecular computer",
note = "Available by anonymous ftp:
/pub/csinfo/papers/adleman/molecular_computer.ps on usc.edu",
year = 1995}
Other available manuscripts:
1. Dick Lipton of Princeton
Speeding up computations via molecular biology. Draft. Dec. 9, 1994.
ftp://ftp.cs.princeton.edu/pub/people/rjl/bio.ps
2. Dan Boneh of Princeton has several manuscripts available at:
Breaking DES Using a Molecular Computer.
Authors: D. Boneh, C. Dunworth, R. Lipton
This paper contains the talk from the workshop.
http://www.cs.princeton.edu/~dabo/biocomp.html
On the Computational Power of DNA.
Authors: D. Boneh, C. Dunworth, R. Lipton, J. Sgall
This is a new paper which contains several results:
a. Shows how to solve the circuit satisfaction problem.
b. Shows how to solve optimization problems such as MAX-Clique without going
through decision problems.
c. Shows how to evaluate predicates in the polynomial hirarchy.
Making DNA Computers Error Resistant.
Authors: D. Boneh, R. Lipton
This paper shows how to transform volume reducing DNA algorithms into
algorithm that are resistant to errors.
Continue to:
My Books
