Computability of Recursive Functions
Journal of the ACM (JACM)
Well-structured transition systems everywhere!
Theoretical Computer Science
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Computation: finite and infinite machines
Computation: finite and infinite machines
Computing with genetic gates, proteins, and membranes
WMC'06 Proceedings of the 7th international conference on Membrane Computing
On the computational power of the mate/bud/drip brane calculus: interleaving vs. maximal parallelism
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Asynchronous p systems and p systems working in the sequential mode
WMC'04 Proceedings of the 5th international conference on Membrane Computing
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
A compositional approach to the stochastic dynamics of gene networks
Transactions on Computational Systems Biology IV
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 5.23 |
We introduce Genetic Systems, a formalism inspired by genetic regulatory networks and suitable for modeling the interactions between the genes and the proteins, acting as regulatory products. The generation of new objects, representing proteins, is driven by genetic gates: a new object is produced when all the activator objects are available in the system, and no inhibitor object is available. Activators are not consumed by the application of such an evolution rule. Objects disappear because of degradation: each object is equipped with a lifetime, and the object decays when such a lifetime expires. We investigate the computational expressiveness of Genetic Systems: we show that they are Turing equivalent by providing encodings of Random Access Machines in Genetic Systems.