Genetic Systems are a formalism inspired by genetic regulatory networks, suitable for modeling the interactions between genes and proteins, acting as regulatory products. The evolution is driven by genetic gates: a new object (representing a protein) is produced when all activator objects are available in the system, and no inhibitor object is present. Activators are not consumed by the application of such a 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 with interleaving semantics (a single action is executed in a computational step): we show that they are Turing equivalent by providing a deterministic encoding of Random Access Machines in Genetic Systems. We also show that the computational power strictly decreases when moving to Genetic Systems where either the degradation or the inhibition mechanism are absent

Busi, N., Zandron, C. (2007). On the computational power of genetic gates with interleaving semantics: The power of inhibition and degradation. In Fundamentals of Computation Theory (pp.173-186). Springer [10.1007/978-3-540-74240-1_16].

On the computational power of genetic gates with interleaving semantics: The power of inhibition and degradation

ZANDRON, CLAUDIO
2007

Abstract

Genetic Systems are a formalism inspired by genetic regulatory networks, suitable for modeling the interactions between genes and proteins, acting as regulatory products. The evolution is driven by genetic gates: a new object (representing a protein) is produced when all activator objects are available in the system, and no inhibitor object is present. Activators are not consumed by the application of such a 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 with interleaving semantics (a single action is executed in a computational step): we show that they are Turing equivalent by providing a deterministic encoding of Random Access Machines in Genetic Systems. We also show that the computational power strictly decreases when moving to Genetic Systems where either the degradation or the inhibition mechanism are absent
paper
computational, power, genetic, gates, interleaving, semantics, inhibition, degradation
English
International Symposium on Fundamentals of Computation Theory
2007
Fundamentals of Computation Theory
978-3-540-74239
2007
LNCS 4639
173
186
none
Busi, N., Zandron, C. (2007). On the computational power of genetic gates with interleaving semantics: The power of inhibition and degradation. In Fundamentals of Computation Theory (pp.173-186). Springer [10.1007/978-3-540-74240-1_16].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/12821
Citazioni
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 2
Social impact