New Generation Computing

, Volume 20, Issue 3, pp 251–261 | Cite as

A separation method for DNA computing based on concentration control

  • Masahito Yamamoto
  • Atsushi Kameda
  • Nobuo Matsuura
  • Toshikazu Shiba
  • Yumi Kawazoe
  • Azuma Ohuchi
Special Issue

Abstract

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.

Keywords

DNA Computing Concentration Control Shortest Path Problem DGGE CDGE 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1).
    Adleman, L., “Molecular Computation of Solutions to Combitonatrial Problems,”Science, 266, pp. 1021–1024, 1994.CrossRefGoogle Scholar
  2. 2).
    Lipton, R. J., “DNA Solution of Hard Computational Problems,”Science, 268, pp. 542–545, 1995.CrossRefGoogle Scholar
  3. 3).
    Ouyang, Q., Kaplan, P., Lir, S. and Libchaber, A., “DNA Solution of the Maximal Clique Problem,”Science, 278, pp. 446–449, 1997.CrossRefGoogle Scholar
  4. 4).
    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
  5. 5).
    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
  6. 6).
    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
  7. 7).
    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

Copyright information

© Ohmsha, Ltd. and Springer 2002

Authors and Affiliations

  • Masahito Yamamoto
    • 1
    • 2
  • Atsushi Kameda
    • 1
  • Nobuo Matsuura
    • 2
  • Toshikazu Shiba
    • 2
  • Yumi Kawazoe
    • 2
  • Azuma Ohuchi
    • 2
  1. 1.Japan Science and Technology Corporation (JST)KawaguchiJapan
  2. 2.Hokkaido UniversitySapporoJapan

Personalised recommendations