PubMed · 7497113
Computing with DNA.
Abstract
We consider molecular models for computing and derive a DNA-based mechanism for solving intractable problems through massive parallelism. In principle, such methods might reduce the effort needed to solve otherwise difficult tasks, such as factoring large numbers, a computationally intensive task whose intractability forms the basis for much of modern cryptography.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
D Beaver. 1995. Computing with DNA.. https://doi.org/10.1089/cmb.1995.2.1
Cite the original work for its findings. Save a collection to share your selection of sources.