Skip to main content
SpringerLink
Log in

Artificial Intelligence and DNA Computing

  • Chapter
Intelligent Computing Everywhere

DNA computing is a relatively new computing paradigm that has attracted great interest in the computing community. Its inherent capacity for vast parallelism, the scope for high-density storage and its intrinsic ability for potentially solving many combinatorial problems are just some of the reasons for this. Computing power alone, however, may not be enough for solving many computing problems today. This is true, in particular, for problems requiring a degree of cleverness or intelligence. It is at this juncture where DNA computing and artificial intelligence meet. This chapter investigates the potential and advances of DNA computing related to artificial intelligence.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • L. Adleman. Molecular computation of solutions to combinatorial prob- lems. Science, 266:1021-1024, 1994.

    Article  Google Scholar 

  • L.M. Adleman. Statement, Cryptographer’s Expert Panel, RSA Data Security Conference, San Francisco, CA, January 1996.

    Google Scholar 

  • L.M. Adleman. Computing with DNA. Scientific American, 279(2):34-41, August 1998.

    Google Scholar 

  • R.S. Braich, N. Chelyapov, C. Johnson, P.W.K. Rothermund, and L. Adleman. Solution of a 20-variable 3-SAT problem on a DNA computer. Science, 296:499-502, 2002.

    Article  Google Scholar 

  • D. Beaver. Factoring: the DNA solution. In J. Pieprzyk and R. Safavi-Naini, editors, Proceedings of the 4th International Conference on the Theory and Applications of Cryptology, pages 419-423, Wollongong, Australia, 1994. Springer-Verlag, New York.

    Google Scholar 

  • J. Chen, E. Antipov, B. Lemieux, W. Cedeno, and D. Wood. DNA computing implementing genetic algorithms. In L.F. Landweber, E. Winfree, R. Lipton, and S. Freeland, editors, Evolution as Computation, pages 39-49. Springer-Verlag, New York, 1999.

    Google Scholar 

  • J. Chen, Y. Wang, and R. Deaton. Large scale genomic monitoring or profiling using a DNA-based memory and microarrays. In Proceedings of the 24th Army Science Conference, Orlando, 2004. Available at http://www.asc2004.com/Manuscript/SessionA/AP-06.pdf (last accessed August, 2006).

  • R. Deaton, R.C. Murphy, J.A. Rose, M. Garzon, D.R. Franceschetti, and S.E. Stevens Jr. A DNA based implementation of an evolutionary search for good encodings for DNA computation. In Proceedings of the IEEE International Conference on Evolutionary Computation, pages 267-271, Indianapolis, IN, 1997. IEEE Computer Society Press, New York.

    Google Scholar 

  • Z. Ezziane. Applications of artificial intelligence in bioinformatics: a review. Expert Systems with Applications, 30(1):2-10, 2006.

    Article  Google Scholar 

  • Z. Ezziane. DNA computing: applications and challenges. Nanotechnol-ogy, 17:R27-R39, 2006.

    Article  Google Scholar 

  • D. Faulhammer, A.R. Cukras, R.J. Lipton, and L.F. Landweber. Molecular computation: RNA solutions to chess problems. Proceedings of the National Academy of Sciences USA, 97:1385-1389, 2000.

    Article  Google Scholar 

  • N.H. Farhat and E.D.M. Hernandez. Logistic networks with DNA- like encoding and interactions. In J. Mira and F.S. Hernandez, editors, Proceedings of the International Workshop on Artificial Neural Networks, volume 930 of Lecture Notes In Computer Science, pages 215-222, Malaga, Spain, 1995. Springer-Verlag, Berlin.

    Google Scholar 

  • D.E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA, 1989.

    MATH  Google Scholar 

  • M. Hagiya, M. Arita, D. Kiga, K. Sakamoto, and S. Yokoyama. Towards parallel evaluation and learning of Boolean µ-formulas with molecules. DNA Based Computers III, 48:57-72, 1999. DIMACS Series in Discrete Mathematics and Theoretical Computer Science.

    Google Scholar 

  • D. Haussler. Quantifying inductive bias: AI learning algorithms and Valiant’s learning framework. Artificial Intelligence, 36:177-221, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  • H. Hirsh. Generalizing version spaces. Machine Learning, 17(1):5-45, 1994.

    MATH  Google Scholar 

  • H. Hirsh, N. Mishra, and L. Pitt. Version spaces without boundary sets. In Proceedings of the 14th National Conference on Artificial Intelligence (AAAI97), pages 491-496. AAAI Press/MIT Press, Cambridge, MA, 1997.

    Google Scholar 

  • J.H. Holland. Adaptation in Natural and Artificial Systems. MIT Press, Cambridge, MA, 1975.

    Google Scholar 

  • R. Impagliazzo, R. Paturi, and F. Zane. Which problems have strongly exponential complexity? Journal of Computer and System Sciences, 63(4):512-530, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  • J. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, 1992.

    MATH  Google Scholar 

  • M. Kloster and C. Tang. Simulation and analysis of in vitro DNA evolution. Physical Review Letters, 92(3): 038101, 2004. Epub.

    Google Scholar 

  • R.J. Lipton. DNA solution of hard computational problem. Science, 268:542-545, 1995.

    Article  Google Scholar 

  • M.A Lones and A.M. Tyrrell. Enzyme genetic programming. In M. Amos, editor, Cellular Computing, Series in Systems Biology, pages 19-42. Oxford University Press, Oxford, 2004.

    Google Scholar 

  • Q. Liu, L. Wang, A.G. Frutos, A.E. Condon, R.M. Corn, and L.M. Smith. DNA computing on surfaces. Nature, 403:175-179, 2000.

    Article  Google Scholar 

  • H.W. Lim, J.E. Yun, H.M. Jang, Y.G. Chai, S.I. Yoo, and B.T. Zhang. Version space learning with DNA molecules. In H. Masami and O. Azuma, editors, 8th International Workshop on DNA Based Computers: DNA Computing, volume 2568 of Lecture Notes in Computer Science, pages 143-155. Springer-Verlag, London, 2003.

    Google Scholar 

  • T.M. Mitchell. Machine Learning. McGraw-Hill, New York, 1997.

    MATH  Google Scholar 

  • D. van Noort, F.U. Gast, and J.S. McCaskill. DNA computing in microreactors. In G. Goos, J. Hartmanis, and J. van Leeuwen, editors, Proceedings of the 7th International Meeting on DNA Based Computers, pages 128-137. Springer, Berlin, 2001.

    Google Scholar 

  • Q. Ouyang, P.D. Kaplan, S. Liu, and A. Libchaber. DNA solution of the maximal clique problem. Science, 278:446-449, 1997.

    Article  Google Scholar 

  • J. Parker. Computing with DNA. EMBO Reports, 4(1):7-10, 2003.

    Article  Google Scholar 

  • L. Ren, Y. Ding, H. Ying, and S. Shao. Emergence of self-learning fuzzy systems by a new virus DNA-based evolutionary algorithm. International Journal of Intelligent Systems, 18:339-354, 2003.

    Article  MATH  Google Scholar 

  • J.A. Rose, M. Hagiya, R.J. Deaton, and A. Suyama. DNA-based in vitro genetic program. Journal of Biological Physics, 28:493-498, 2002.

    Article  Google Scholar 

  • M.F. Russo, A.C. Huff, C.E. Heckler, and A.C. Evans. An improved DNA encoding scheme for neural network modeling. In P. Werbos, H. Szu, and B. Widrow, editors, Proceedings of the International Neural Network Society Annual Meeting, pages 354-359, San Diego, CA, 1994. Lawrence Erlbaum Associates. I/354-I359.

    Google Scholar 

  • Y. Sakakibara. DNA computing. volume 2054 of Lecture Notes in Computer Science, chapter Solving computational learning problems of Boolean formulae on DNA computers, pages 220-230. Springer-Verlag, Berlin, 2000.

    Google Scholar 

  • K. Sakamoto, H. Gouzu, K. Komiya, D. Kiga, S. Yokoyama, T. Yokomori, and M. Hagiya. Molecular computation by DNA hairpin formation. Science, 288:1223-1226, 2000.

    Article  Google Scholar 

  • K. Sakamoto, D. Kiga, K. Komiya, H. Gouzu, S. Yokoyama, S. Ikeda, H. Sugiyama, and M. Hagiya. State transitions by molecules. Biosystems, 52:81-91, 1999.

    Article  Google Scholar 

  • M.N. Stojanovic and D. Stefanovic. A deoxyribozyme-based molecular automaton. Nature Biotechnology, 21:1069-1074, 2003.

    Article  Google Scholar 

  • D.H. Wood, H. Bi, S.O. Kimbrough, D. Wu, and J. Chen. DNA starts to learn poker. In G. Goos, J. Hartmanis, and J. van Leeuwen, editors, Proceedings of the 7th International Meeting on DNA-based Computers, pages 23-32, Tampa, 2001. Springer, Berlin.

    Google Scholar 

  • D.H. Wood and J. Chen. Physical separation of DNA according to royal road fitness. In Proceedings of IEEE Conference on Evolutionary Computation, pages 1016-1025, Washington DC, 1999. IEEE Computer Society Press, New York.

    Google Scholar 

  • D.H. Wood, J. Chen, E. Antipov, W. Cedeno, and B. Lemieux. A DNA implementation of the Max 1s problem. In W. Banzhaf, J. Daida, A.E. Eiben, M.H. Garzon, V. Honavar, M. Jakiela, and R.E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 1835-1842, Orlando, 1999. Morgan Kaufmann, San Francisco.

    Google Scholar 

  • L. Yuan and F. Chen. Genetic algorithm in DNA computing: a solution to the maximal clique problem. Chinese Science Bulletin, 49(9):967-971, 2004.

    MATH  MathSciNet  Google Scholar 

  • T. Yoshikawa, T. Furuhashi, and Y. Uchikawa. The effects of combination of DNA coding method with pseudo-bacterial GA. In Proceedings of the IEEE International Conference on Evolutionary Computation, pages 285-290, Indianapolis, Indiana, USA, 1997. IEEE Computer Society Press, New York.

    Google Scholar 

  • R. Yokobayashi, R. Weiss, and F.H. Arnold. Directed evolution of a genetic circuit. Proceedings of the National Academy of Sciences USA, 99 (26):16587-16591, 2002.

    Article  Google Scholar 

  • B.T. Zhang and H.Y. Jang. DNA computing. In C. Ferretti, G. Mauri, and C. Zandron, editors, A Bayesian algorithm for in vitro molecular evolution of pattern classifiers, volume 3384 of Lecture Notes in Computer Science, pages 458-467. Springer-Verlag, Berlin, 2005.

    Google Scholar 

  • B.T. Zhang and H.Y. Jang. Molecular programming: evolving genetic programs in a test tube. In H.G. Beyer, editor, Proceedings of the 2005 Conference on Genetic and Evolutionary Computations (GECCO’05), pages 1761-1768, Washington DC., 2005. ACM Press.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Information Technology, University of Dubai, 14143, Dubai, United Arab Emirates

    Zoheir Ezziane

Authors
  1. Zoheir Ezziane
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Ulster, Shore Road, BT37 0QB, Newtownabbey, Co. Antrim, Northern Ireland

    Alfons J. Schuster

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag London Limited

About this chapter

Cite this chapter

Ezziane, Z. (2007). Artificial Intelligence and DNA Computing. In: Schuster, A.J. (eds) Intelligent Computing Everywhere. Springer, London. https://doi.org/10.1007/978-1-84628-943-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-84628-943-9_10

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84628-942-2

  • Online ISBN: 978-1-84628-943-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation