1. Adleman, Leonard M., “Molecular Computation of Solutions to Combinatorial Problems,”Science, Vol. 266, pp. 1021–1024, 1994.
2. Alivisatos, A. Paul, Johnsson Kai P., Peng, Xiaogang, Wilson, Troy E., Loweth, Colin J., Bruchez, Marcel P., Jr. and Schultz, Peter G., “Organization of ‘nanocrystal molecules’ using DNA,”Nature, Vol. 382, pp. 609–611, 1996.
3. Arita, Masanori, Hagiya, Masami and Suyama, Akira, “Joining and Rotating Data with Molecules,”IEEE International Conference on Evolutionary Computation, pp. 243–248, 1997.
4. Boneh, Dan, Dunworth, Christopher and Lipton, Richard J., “Breaking DES Using a Molecular Computer,” inDNA Based Computers, Proceedings of a DIMACS Workshop, April 4, 1995, Princeton University,Series in Discrite Mathematics and Theoretical Computer Science, Vol. 27, pp. 37–65, 1996.
5. Deaton, Russel, Murphy, Randy C., Garzon, Max, Franceschetti, D. R. and Stevens, S. E., Jr., “Good Encodings for DNA-based Solutions to Combinatorial Problems,” inSecond Annual Meeting on DNA Based Computers, Jun. 10–12, 1996, DIMACS Workshop, Princeton University, Dept. of Computer Science, pp. 131–140.