1. Molecular computation of solutions to combinatorial problems;Adleman;Science,1994
2. M. Amos, DNA Computation, Ph.D. Thesis, Department of Computer Science, The University of Warwick, 1997.
3. W.-L. Chang, M. Guo, Resolving the 3-dimensional matching problem and the set-packing problem in Adleman–Lipton’s model, in: IASTED International Conference, Networks, Parallel and Distributed Processing and Applications, Japan, 2002, pp. 455–460.
4. Solving the set-cover problem and the problem of exact cover by 3-sets in the Adleman–Lipton’s model;Chang;BioSystems,2003
5. Fast parallel molecular algorithms for DNA-based computation: factoring integers;Chang;IEEE Transactions on Nanobioscience,2005