A formalization of Kauffman Boolean Networks in terms of P systems is suggested along two lines: by means of register machines and directly by means of membranes with receptors.
This work concerns the synthesis of a "minimal cell' by means of a P system, which is a distributed rewriting system inspired by the structure and the functioning of the biological cell. Specifically, we aim to define a dynamical system which exhibits a steady metabolic evolution, resulting in self-maintenance and self-reproduction. Metabolic P...
Several algorithms of maximum search are investigated and eval- uated in different types of P systems, namely using priorities, multiple nested membranes and linked transport. The proposed solutions are expected to find application in a wide range of problems. In particular, the authors are currently working on modeling an algorithm for DNA...
Signal transduction networks are very complex processes employed by the living cell to suitably react to environmental stimuli. Qualitative and quantitative computational models play an increasingly important role in the representation of these networks and in the search of new insights about these phenomena. In this work we analyze some...
We prove that P systems with mate and drip operations and using at most five membranes during any step of a computation are universal. This improves a recent similar result from, where eleven membranes are used. The proof of this result has the "drawback" that the output of a computation is obtained on an inner membrane of the system. A...