Computing with genetic gates, proteins, and membranes

Authors:
Nadia Busi;Claudio Zandron
Affiliations:
Dipartimento di Scienze dell'Informazione, Università di Bologna, Bologna, Italy;Dipartimento di Informatica, Sistemistica e Comunicazione, Università di Milano-Bicocca, Milano, Italy
Venue:
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Year:
2006

Citing 6
Cited 6

Computability of Recursive Functions

Journal of the ACM (JACM)
Computing with membranes

Journal of Computer and System Sciences
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
Computational power of symport/antiport: history, advances, and open problems

WMC'05 Proceedings of the 6th international conference on Membrane Computing

Membrane Computing and Brane Calculi (Some Personal Notes)

Electronic Notes in Theoretical Computer Science (ENTCS)
Membrane computing and brane calculi. Old, new, and future bridges

Theoretical Computer Science
Computing with Genetic Gates

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Computational expressiveness of Genetic Systems

Theoretical Computer Science
Hill kinetics meets P systems: a case study on gene regulatory networks as computing agents in silico and in vivo

WMC'07 Proceedings of the 8th international conference on Membrane computing
On the computational power of genetic gates with interleaving semantics: the power of inhibition and degradation

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce Genetic P systems, a class of P systems with evolution rules inspired by the functioning of the genes. The creation of new objects – representing proteins – is driven by genetic gates: a new object is produced when all the activator objects are present, and no inhibitor object is available. Activator objects are not consumed by the application of such an evolution rule. Objects disappear because of degradation: each object is equipped with a lifetime; when such a lifetime expires, the object decays. Then, we extend the basic model with bind and release rules and repressor rules, that simulate the action of protein channels and the action of substances which connect to other objects to block their use. We provide a universality result for such a class of systems.