1. Molecular computation of solutions to combinatorial problems;Adleman;Science,1994
2. R.S. Braich, C. Johnson, P.W.K. Rothemund, D. Hwang, N. Chelyapov, M. Leonard, L.M. Adleman, Solution of a satisfiability problem on a gel-based DNA computer, in: Proceedings of the Sixth International Conference on DNA Computation (DNA 2000), Lecture Notes in Computer Science, vol. 2054, 2001, pp. 27–42.
3. Weng-Long Chang, Minyi Guo, Solving the dominating-set problem in Adleman-Lipton’s model, in: Proceedings of the Third International Conference on Parallel and Distributed Computing, Applications and Technologies, 2002, pp. 167–172.
4. Weng-Long Chang, Minyi Guo, Solving the clique problem and the vertex cover problem in Adleman-Lipton’s model, in: Proceedings of IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, 2002, pp. 431–436.
5. Weng-Long Chang, Minyi Guo, Solving NP-complete problem in the Adleman–Lipton model, in: Proceedings of 2002 International Conference on Computer and Information Technology, 2002, pp. 157–162.