New Generation Computing

, Volume 20, Issue 3, pp 237–249 | Cite as

Models of molecular computing based on molecular reactions

  • Grzegorz Rozenberg
Special Issue


We discuss two models of molecular computing. The first one is based on an abstract formulation of two sorts of molecular reactions: enforcing and forbidden. The enforcing reactions are reactions that may happen, and are allowed to happen, in a given molecular system, while the forbidden reactions are detrimental for the system (e.g., leading to “incorrect” computations) and thus must be avoided. Hence computations in such a forbidding-enforcing system are driven by enforcing conditions (describing the enforcing reactions), but they are restrained by forbidding conditions (describing the forbidden reactions). The second model, called molecular landscapes, is geared towards the display of solutions. It consists of organisms (computing agents) functioning in a common environment which plays the role of a common communication medium for the organisms. When a molecular landscapes system works on a specific computational problem, each organism is working on this problem. But as soon as an organismM will get its solution to the problem, it modifies the environment, which from this moment on supports only the organisms that get the same solution asM. This is done through a selection mechanism that relies on selective competition which “kills” the losers. Since this selection mechanism interacts with the solution mechanism from the moment that computations are initiated, it can drastically increase the density of good solutions (molecules). In this way the molecular landscapes system achieves the goal of displaying solutions.


Molecular Computing DNA Computing Molecular Reactions Filtering Methods Satisfiability Problem 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1).
    Adleman, L.M., “Molecular computation of solutions to combinatorial problems,”Science 226, pp. 1021–1024, November 1994.CrossRefGoogle Scholar
  2. 2).
    Ehrenfeucht, A., Rozenberg, G. and van Vugt, N.,Molecular landscapes, manuscript.Google Scholar
  3. 3).
    Ehrenfeucht, A., Hoogeboom, H. J., Rozenberg, G. and van Vugt, N., “Forbidding and Enforcing,”DNA Based Computers V (Winfree E. and Gifford, D.K., eds.), DIMACS Series in Discrete Mathematics 54, 2000.CrossRefGoogle Scholar
  4. 4).
    Ehrenfeucht, A., Hoogeboom, H. J., Rozenberg, G. and van Vugt, N., “Sequences of Languages in Forbidding-enforcing Families,”Soft Computing 5, pp. 121–125, 2001.CrossRefGoogle Scholar
  5. 5).
    Ehrenfeucht, A. and Rozenberg, G., “Forbidding-enforcing Systems,”Theoretical Computer Science, to appear.Google Scholar
  6. 6).
    Head, T., “Formal Language Theory and DNA: An Analysis of the Generative Capacity of Specific Recombinant Behaviours,”Bulletin of Mathematical Biology, 49, pp. 737–759, 1987.MathSciNetCrossRefGoogle Scholar
  7. 7).
    Lewis, H. R. and Papadimitriou, C. H.,Elements of the Theory of Computation, Prentice Hall, Upper Saddle River, 1987.Google Scholar
  8. 8).
    Păun, Gh., “Computing with Membranes,”Journal of Computer and System sciences, 61, pp. 108–143, 2000.MathSciNetCrossRefGoogle Scholar
  9. 9).
    Păun, Gh., Rozenberg, G. and Salomaa, A.,DNA Computing: New Computing Paradigms, Springer-Verlag, Berlin, Heidelberg, 1998.CrossRefGoogle Scholar
  10. 10).
    van Vugt, N.,Models of Molecular Computing, Ph.D. Thesis, Leiden Institute of Advanced Computer Science, Leiden University, 2002.Google Scholar

Copyright information

© Ohmsha, Ltd. and Springer 2002

Authors and Affiliations

  1. 1.Leiden Institute of Advanced Computer Science (LIACS)Leiden UniversityLeidenThe Netherlands
  2. 2.Department of Computer ScienceUniversity of Colorado at BoulderBoulderU.S.A.

Personalised recommendations