1. Adleman, L.: Molecular Computation of Solutions to Combinatorial Problems. Science 266, 1021–1024 (1994)
2. Narayanan, A., Zorbalas, S.: DNA Algorithms for Computing Shortest Paths. In: Proceedings of Genetic Programming, pp. 718–723 (1998)
3. Lecture Notes in Computer Science;J.Y. Lee,2003
4. Ibrahim, Z., Tsuboi, Y., Ono, O., Khalid, M.: Direct-Proportional Length-Based DNA Computing for Shortest Path Problem. International Journal of Computer Science and Applications (IJCSA), Technomathematics Research Foundation 1, 46–60 (2004)
5. Yamamoto, M., Kameda, A., Matsuura, N., Shiba, T., Kawazoe, Y., Ahochi, A.: A Separation Method for DNA Computing Based on Concentration Control. New Generation Computing 20, 251–262 (2002)