Continuous genetic networks (Q5940987): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0167-8191(00)00083-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2022313562 / rank | |||
Normal rank |
Latest revision as of 10:46, 30 July 2024
scientific article; zbMATH DE number 1635142
Language | Label | Description | Also known as |
---|---|---|---|
English | Continuous genetic networks |
scientific article; zbMATH DE number 1635142 |
Statements
Continuous genetic networks (English)
0 references
20 August 2001
0 references
We show how random Boolean networks, a well-known model of the interaction among genes within a living cell, can be generalized by relaxing the Boolean approximation, therefore defining a class of continuous genetic networks, and by explicitly describing gene--chemical interactions. It is also shown that population growth can be modelled by describing in detail the interactions among a limited number of genes, while the effects of the remaining genes are represented by a collective variable. The model can describe specific metabolic systems, as shown by the case of a microorganism able to degrade aromatic compounds, and it can also be used to study the generic properties of genetic networks. For this purpose, theoretical and simulation results are given in the case where all the genes are arranged on a 2-D regular square topology, with connections among neighbouring sites, which represents a cellular-automata like model. Parallel simulation on a MIMD machine shows a good speed-up, thus confirming that these models are amenable to efficient parallel implementation.
0 references
random Boolean networks
0 references