[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

On the Computational Power of Genetic Gates with Interleaving Semantics: The Power of Inhibition and Degradation

  • Conference paper
Fundamentals of Computation Theory (FCT 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4639))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Blossey, R., Cardelli, L., Phillips, A.: A Compositional Approach to the Stochastic Dynamics of Gene Networks. In: Priami, C., Cardelli, L., Emmott, S. (eds.) Transactions on Computational Systems Biology IV. LNCS (LNBI), vol. 3939. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Busi, N., Pinna, G.M.: A Causal Semantics for Contextual P/T nets. In: Proc. ICTCS 1995, pp. 311–325. World Scientific, Singapore (1995)

    Google Scholar 

  3. Busi, N.: On the Computational Power of the Mate/Bud/Drip Brane Calculus: Interleaving vs. Maximal Parallelism. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Busi, N., Zandron, C.: Computing with Genetic Gates, Proteins and Membranes. In: Hoogeboom, H.J., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2006. LNCS, vol. 4361. Springer, Heidelberg (2006)

    Google Scholar 

  5. Busi, N., Zandron, C.: On the computational power of Genetic Gates with interleaving semantics: The power of inhibition and degradation, www.cs.unibo.it/%7Ebusi/FCT07long.pdf

  6. Busi, N., Zandron, C.: Computing with Genetic Gates. In: Proc. Third Conference on Computability in Europe. Computation and Logic in the Real World (CiE 2007). LNCS, vol. 4497. Springer, Heidelberg 2007 (to appear)

    Google Scholar 

  7. Cardelli, L.: Brane Calculi - Interactions of Biological Membranes. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol. 3082, pp. 257–280. Springer, Heidelberg (2005)

    Google Scholar 

  8. De Jong, H.: Modeling and Simulation of Genetic Regulatory Systems: A Literature Review. Journal of Computatonal Biology 9, 67–103 (2002)

    Article  Google Scholar 

  9. Finkel, A., Schnoebelen, Ph.: Well-Structured Transition Systems Everywhere! Theoretical Computer Science 256, 63–92 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Freund, R.: Asynchronous P Systems and P Systems Working in the Sequential Mode. In: Mauri, G., Păun, G., Pérez-Jiménez, M.J., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 36–62. Springer, Heidelberg (2005)

    Google Scholar 

  11. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)

    MATH  Google Scholar 

  12. Montanari, U., Rossi, F.: Contextual Nets. Acta Inform. 32(6), 545–596 (1995)

    MATH  MathSciNet  Google Scholar 

  13. Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  14. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New computing paradigms. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  15. Reisig, W.: Petri nets: An Introduction. In: EATCS Monographs in Computer Science, Springer, Heidelberg (1985)

    Google Scholar 

  16. Shepherdson, J.C., Sturgis, J.E.: Computability of Recursive Functions. Journal of the ACM 10, 217–255 (1963)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell’Informazione, Università di Bologna, Mura A. Zamboni 7, I-40127 Bologna, Italy

    Nadia Busi

  2. DISCo, Università di Milano-Bicocca, via Bicocca degli Arcimboldi 8, I-20126, Milano, Italy

    Claudio Zandron

Authors
  1. Nadia Busi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Claudio Zandron
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Erzsébet Csuhaj-Varjú Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Busi, N., Zandron, C. (2007). On the Computational Power of Genetic Gates with Interleaving Semantics: The Power of Inhibition and Degradation. In: Csuhaj-Varjú, E., Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 2007. Lecture Notes in Computer Science, vol 4639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74240-1_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74240-1_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74239-5

  • Online ISBN: 978-3-540-74240-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation