A separation method for DNA computing based on concentration control is presented. The concentration control method was earlier developed and has enabled us to use DNA concentrations as input data and as filters to extract target DNA. We have also applied the method to the shortest path problems, and have shown the potential of concentration control to solve large-scale combinatorial optimization problems. However, it is still quite difficult to separate different DNA with the same length and to quantify individual DNA concentrations. To overcome these difficulties, we use DGGE and CDGE in this paper. We demonstrate that the proposed method enables us to separate different DNA with the same length efficiently, and we actually solve an instance of the shortest path problems.
DNA Computing Concentration Control Shortest Path Problem DGGE CDGE
This is a preview of subscription content, log in to check access.
Adleman, L., “Molecular Computation of Solutions to Combitonatrial Problems,”Science, 266, pp. 1021–1024, 1994.CrossRefGoogle Scholar
Lipton, R. J., “DNA Solution of Hard Computational Problems,”Science, 268, pp. 542–545, 1995.CrossRefGoogle Scholar
Ouyang, Q., Kaplan, P., Lir, S. and Libchaber, A., “DNA Solution of the Maximal Clique Problem,”Science, 278, pp. 446–449, 1997.CrossRefGoogle Scholar
Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T. and Hagiya, M., “Molecular Computation by DNA Hairpin Formation,”Science, 288, pp. 1223–1226, 2000.CrossRefGoogle Scholar
Matsuura, N., Yamamoto, M., Shiba, T., Kawazoe, Y. and Ohuchi, A. “Solutions of Shortest Path Problems by Concentration Control,”in Preliminary Proc. of 7th International Meeting on DNA Computing, pp. 231–240, 2001.Google Scholar
Wood, D. H., Chen, J., Antipov, E., Lemieux, B. and Cedeño, W., “In Vitro Selection for a OneMax DNA Evolutionary Computation,”DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 54, pp. 23–37 2000.MathSciNetCrossRefGoogle Scholar
Yamamoto, M., Yamashita, J., Shiba, T., Hirayama, T., Takiya, S., Suzuki, K., Munekata, M. and Ohuchi, A., “A Study on the Hybridization Process in DNA Computing,”DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 54, pp. 101–110, 2000.MathSciNetCrossRefGoogle Scholar