L. Adleman, Molecular computation of solutions to combinatorial problems, Science 266:1021, 1994.

D. Beaver, Preliminary abstract appeared as`Factoringas`Factoring: The DNA solution, Advances in Cryptography -Asiacrypt '94 Proceedings, 1994.

D. Beaver, A universal molecular computer, pp.1-9

D. Beaver, Computing with DNA, 1995.

D. Boneh, C. Dunworth, and R. J. Lipton, Breaking DES using a molecular computer, 1995.

D. Boneh, C. Dunworth, R. J. Lipton, and J. Sgall, On the computational power of DNA, 1995.

D. Boneh and R. J. Lipton, Making DNA computers error resistant, pp.1-9

U. Feige, D. Peleg, P. , and E. Upfal, Computing with unreliable information, Proceedings of the 22nd ACM Symposium on Theory of Computing, pp.128-137, 1990.

A. , Lower bounds for the complexity for reliable boolean circuits with noisy gates, Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pp.594-601, 1991.

C. Kenyon and V. King, On boolean decision trees with faulty n o d e s . I n Random Structures and Algorithms, vol.5, pp.453-464, 1994.

R. M. Karp, C. Kenyon, and O. Waarts, Error-resilient DNA computation, 1995.
URL : https://hal.archives-ouvertes.fr/hal-02101766

R. J. Lipton, Using DNA to solve NP-Complete problems, Science, vol.268, pp.542-545, 1995.

, FIPS, vol.46, 1977.