Reaction systems are a formal model based on the regulation mechanisms of facilitation and inhibition between biochemical reactions, which underlie the functioning of living cells. The aim of this paper is to explore the expressive power of reaction systems as a modeling framework, showing how their basic assumptions and properties can be exploited to formalize computer science and biology oriented problems. In this view, we first provide a reaction-based description of an iterative algorithm to solve the Tower of Hanoi puzzle. Then, we show how the regulation of gene expression in the lac operon, involved in the metabolism of lactose in Escherichia coli cells, can be formalized in terms of reaction systems. Finally, we present a method to derive, given a reaction system with n reactions, a functionally equivalent system with n′≤n reactions using simplification methods of boolean expressions. Some final remarks and directions for future research conclude the paper.

An excursion in reaction systems : from computer science to biology / L. Corolli, F. Marini, C. Maj, D. Besozzi, G. Mauri. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - 454(2012 Oct 05), pp. 95-108.

An excursion in reaction systems : from computer science to biology

D. Besozzi;
2012-10-05

Abstract

Reaction systems are a formal model based on the regulation mechanisms of facilitation and inhibition between biochemical reactions, which underlie the functioning of living cells. The aim of this paper is to explore the expressive power of reaction systems as a modeling framework, showing how their basic assumptions and properties can be exploited to formalize computer science and biology oriented problems. In this view, we first provide a reaction-based description of an iterative algorithm to solve the Tower of Hanoi puzzle. Then, we show how the regulation of gene expression in the lac operon, involved in the metabolism of lactose in Escherichia coli cells, can be formalized in terms of reaction systems. Finally, we present a method to derive, given a reaction system with n reactions, a functionally equivalent system with n′≤n reactions using simplification methods of boolean expressions. Some final remarks and directions for future research conclude the paper.
Boolean functions; lac operon; Reaction systems; Simplification methods; Tower of Hanoi
Settore INF/01 - Informatica
Article (author)
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

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: http://hdl.handle.net/2434/203883
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 37
  • ???jsp.display-item.citation.isi??? 29
social impact