Skip to main content
Log in

A separation method for DNA computing based on concentration control

  • Special Issue
  • Published:
New Generation Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Adleman, L., “Molecular Computation of Solutions to Combitonatrial Problems,”Science, 266, pp. 1021–1024, 1994.

    Article  Google Scholar 

  2. Lipton, R. J., “DNA Solution of Hard Computational Problems,”Science, 268, pp. 542–545, 1995.

    Article  Google Scholar 

  3. Ouyang, Q., Kaplan, P., Lir, S. and Libchaber, A., “DNA Solution of the Maximal Clique Problem,”Science, 278, pp. 446–449, 1997.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  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.

  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.

    Article  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Masahito Yamamoto.

Additional information

Masahito Yamamoto, Ph.D.: He is associate professor of information engineering at Hokkaido University. He received Ph.D. from the Graduate School of Engineering, Hokkaido University in 1996. His current research interests include DNA computing based the laboratory experiments. He is a member of Operations Research Society of Japan, Japanese Society for Artificial Intelligence, Information Processing Society of Japan etc.

Atsushi Kameda, Ph.D.: He is the research staff of Japan Science and Technology Corporation, and has participated in research of DNA computing in Hokkaido University. He received his Ph.D. from Hokkaido University in 2001. For each degree he majored in molecular biology. His research theme is about the role of polyphosphate in the living body. As one of the researches relevant to it, he constructed the ATP regeneration system using two enzyme which makes polyphosphate the phosphagen.

Nobuo Matsuura: He is a master course student of Division of Systems and Information Engineering of Hokkaido University. His research interests relate to DNA computing with concentration control for shortest path problems, as a means of solution of optimization problems with bimolecular.

Toshikazu Shiba, Ph.D.: He is associate, professor of biochemical engineering at Hokkaido University. He received his Ph.D. from Osaka University in 1991. He majored in molecular genetics and biochemistry. His research has progressed from bacterial molecular biology (regulation of gene expression of bacterial cells) to tissue engineering (bone regeneration). Recently, he is very interested in molecular computation and trying to apply his biochemical idea to information technology.

Yumi Kawazoe: She is a master course student of Division of Molecular Chemistry of Hokkaido University. Although her major is molecular biology, she is very interested in molecular computation and bioinformatics.

Azuma Ohuchi, Ph.D.: He is professor of Information Engineering at the University of Hokkaido, Sapporo, Japan. He has been developing a new field of complex systems engineering, i.e., Harmonious Systems Engineering since 1995. He has published numerous papers on systems engineering, operations research, and computer science. In addition, he is currently supervising projects on DNA computing, multi-agents based artificial market systems, medical informatics, and autonomous flying objects. He was awarded “The 30th Anniversary Award for Excellent Papers” by the Information Processing Society of Japan. He is a member of Operations Research Society of Japan, Japanese Society for Artificial Intelligence, Information Processing Society of Japan, Japan Association for Medical Informatics, IEEE Computer Society, IEEE System, Man and Cybernetics Society etc. He received PhD from Hokkaido University in 1976.

About this article

Cite this article

Yamamoto, M., Kameda, A., Matsuura, N. et al. A separation method for DNA computing based on concentration control. New Gener Comput 20, 251–261 (2002). https://doi.org/10.1007/BF03037359

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037359

Keywords

Navigation