1. L.M. Adleman, “Molecular computation of solutions to combinatorial problems,” Science, vol. 266, pp. 1021–1024, 1994.
2. Narayanan, and S. Zorbalas, “DNA algorithms for computing shortest paths,” Proceedings of Genetic Programming, pp. 718–723, 1998.
3. Y. Yamamoto, A. Kameda, N. Matsuura, T. Shiba, Y. Kawazoe, and A. Ahochi, “Local search by concentration-controlled DNA computing,” International Journal of Computational Intelligence and Applications, vol. 2, pp. 447–455, 2002.
4. J.Y. Lee, S.Y. Shin, S.J. Augh, T.H. Park, and B.T. Zhang, “Temperature gradient-based DNA computing for graph problems with weighted edges,” Lecture Notes in Computer Science, Springer-Verlag, vol. 2568, pp. 73–84, 2003.
5. Z. Ibrahim, Y. Tsuboi, O. Ono, and M. Khalid, “Direct-proportional length-based DNA computing for shortest path problem,” International Journal of Computer Science and Applications, vol. 1, issue 1, pp. 46–60, 2004.