Soft Computing

, Volume 5, Issue 1, pp 19–24

A design for DNA computation of the OneMax problem

Authors

  • D. H. Wood
    • Department of Computer Science, University of Delaware, Smith Hall 103, Newark, DE 19716, USA e-mail: wood@mail.eecis.udel.edu
  • J. Chen
    • Department of Chemistry and Biochemistry, University of Delaware, Newark, DE 19716, USA
  • E. Antipov
    • Department of Chemical Engineering, University of Delaware, Newark, DE 19716, USA
  • B. Lemieux
    • Department of Plant and Soil Science, University of Delaware, Newark, DE 19716, USA
  • W. Cedeño
    • Hewlett-Packard, Centerville Road, Wilmington, DE 19808, USA
Focus: Molecular Computing

DOI: 10.1007/s005000000063

Cite this article as:
Wood, D., Chen, J., Antipov, E. et al. Soft Computing (2001) 5: 19. doi:10.1007/s005000000063
  • 26 Views

Abstract

 Elements of evolutionary computation and molecular biology are combined to design a DNA evolutionary computation. The traditional test problem for evolutionary computation, OneMax problem is addressed. The key feature is the physical separation of DNA strands consistent with OneMax “fitness.”

Copyright information

© Springer-Verlag Berlin Heidelberg 2001