Computing with DNA
- 1 January 1995
- journal article
- Published by Mary Ann Liebert Inc in Journal of Computational Biology
- Vol. 2 (1) , 1-7
- https://doi.org/10.1089/cmb.1995.2.1
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.Keywords
This publication has 2 references indexed in Scilit:
- Molecular Computation of Solutions to Combinatorial ProblemsScience, 1994
- Linear approximation of shortest superstringsJournal of the ACM, 1994