Genetic regulation networks: circuits, regulons and attractors

Jacques Demongeot; Julio Aracena; Florence Thuderoz; Thierry-Pascal Baum; Olivier Cohen

doi:10.1016/S1631-0691(03)00069-6

Biological modelling / Biomodélisation

Genetic regulation networks: circuits, regulons and attractors
[Réseaux de régulation génétique : circuits, régulons, attracteurs]

Présenté par : Jacques Ricard

Jacques Demongeot ¹ ; Julio Aracena ¹ ; Florence Thuderoz ¹ ; Thierry-Pascal Baum ¹ ; Olivier Cohen ¹

¹ Institut universitaire de France & CNRS TIMC–IMAG, Faculty of Medicine, 38700 La Tronche, France

Comptes Rendus. Biologies, Volume 326 (2003) no. 2, pp. 171-188.

Résumés

Anglais
Français

We deal in this paper with the concept of genetic regulation network. The genes expression observed through the bio-array imaging allows the geneticist to obtain the intergenic interaction matrix W of the network. The interaction graph G associated to W presents in general interesting features like connected components, gardens of Eden, positive and negative circuits (or loops), and minimal components having 1 positive and 1 negative loop called regulons. Depending on parameters values like the connectivity coefficient $K (W)$ and the mean inhibition weight $I (W)$ , the genetic regulation network can present several dynamical behaviours (fixed configuration, limit cycle of configurations) called attractors, when the observation time increases. We give some examples of such genetic regulation networks and analyse their dynamical properties and their biological consequences.

Cet article porte sur le concept de réseau de régulation génétique. L'expression génique, fournie par l'imagerie bio-array, permet d'obtenir la matrice W d'interaction intergénique du réseau. Le graphe d'interaction G associé à W présente en général des caractéristiques importantes telles que composantes connexes, jardins d'Eden, circuits (ou boucles) positifs et négatifs, ainsi que composants minimaux possédant une boucle négative et une boucle positive, appelés régulons. En fonction des valeurs de certains paramètres, tels que le coefficient de connectivité $K (W)$ et le poids moyen d'inhibition $I (W)$ , le réseau de régulation génétique peut présenter différents comportements dynamiques (configuration fixe ou cycle limite de configurations) appelés attracteurs, lorsque le temps d'observation augmente. Nous donnerons des exemples de tels réseaux et analyserons leurs propriétés dynamiques, ainsi que leurs conséquences biologiques. Dans la partie consacrée à l'acquisition d'images bio-array, nous rappelons rapidement quelles sont leurs caractéristiques en termes de bruit et de signal et nous proposons une méthode (dite de l'emboutissage gaussien) permettant de les standardiser. Ensuite, nous donnons une méthode (dite des corrélations directionnelles) permettant d'extraire, à partir des images de co-expression des gènes, la matrice d'interaction inter-génique W liée à l'activité du réseau étudié. Puis, après description des caractéristiques majeures de son graphe associé G, nous donnons une suite de propositions, lemmes et théorèmes permettant de faire le lien entre la phénotypie observée (configurations fixes ou cycles de configurations au cours du cycle cellulaire des tissus étudiés) et les contraintes qu'elle exerce sur la structure interne de W et donc de G. Les deux résultats majeurs sont que l'existence d'au moins une boucle positive est une condition nécessaire de l'existence de plus d'un attracteur et que, si le nombre N de gènes est suffisamment grand et que $K (W) = 2$ , alors le nombre total $A (W)$ d'attracteurs est de l'ordre de √N et de toute manière inférieur à 2^m, où m est le nombre de boucles positives du réseau de régulation génique. Nous donnons ensuite les exemples des réseaux de régulation contrôlant la floraison d'Arabidopsis thaliana, la gastrulation, la fonction lytique du phage μ et la préséance des bourgeons axillaires de Bidens pilosa, dans lesquels nous retrouvons la mise en œuvre des principales notions introduites dans les parties précédentes de l'article.

Métadonnées

Reçu le : 2002-07-15
Accepté le : 2002-12-04
Publié le : 2003-02-01

PMID

DOI : 10.1016/S1631-0691(03)00069-6

Keywords: genetic regulation network, intergenic interaction matrix, positive loops, regulons, attractors
Mots-clés : réseau de régulation génétique, matrice d'interaction intergénique, boucles positives, régulons, attracteurs

Affiliations des auteurs :

Jacques Demongeot ¹ ; Julio Aracena ¹ ; Florence Thuderoz ¹ ; Thierry-Pascal Baum ¹ ; Olivier Cohen ¹

¹ Institut universitaire de France & CNRS TIMC–IMAG, Faculty of Medicine, 38700 La Tronche, France

@article{CRBIOL_2003__326_2_171_0,
     author = {Jacques Demongeot and Julio Aracena and Florence Thuderoz and Thierry-Pascal Baum and Olivier Cohen},
     title = {Genetic regulation networks: circuits, regulons and attractors},
     journal = {Comptes Rendus. Biologies},
     pages = {171--188},
     publisher = {Elsevier},
     volume = {326},
     number = {2},
     year = {2003},
     doi = {10.1016/S1631-0691(03)00069-6},
     language = {en},
}

TY  - JOUR
AU  - Jacques Demongeot
AU  - Julio Aracena
AU  - Florence Thuderoz
AU  - Thierry-Pascal Baum
AU  - Olivier Cohen
TI  - Genetic regulation networks: circuits, regulons and attractors
JO  - Comptes Rendus. Biologies
PY  - 2003
SP  - 171
EP  - 188
VL  - 326
IS  - 2
PB  - Elsevier
DO  - 10.1016/S1631-0691(03)00069-6
LA  - en
ID  - CRBIOL_2003__326_2_171_0
ER  -

%0 Journal Article
%A Jacques Demongeot
%A Julio Aracena
%A Florence Thuderoz
%A Thierry-Pascal Baum
%A Olivier Cohen
%T Genetic regulation networks: circuits, regulons and attractors
%J Comptes Rendus. Biologies
%D 2003
%P 171-188
%V 326
%N 2
%I Elsevier
%R 10.1016/S1631-0691(03)00069-6
%G en
%F CRBIOL_2003__326_2_171_0

Jacques Demongeot; Julio Aracena; Florence Thuderoz; Thierry-Pascal Baum; Olivier Cohen. Genetic regulation networks: circuits, regulons and attractors. Comptes Rendus. Biologies, Volume 326 (2003) no. 2, pp. 171-188. doi : 10.1016/S1631-0691(03)00069-6. https://comptes-rendus.academie-sciences.fr/biologies/articles/10.1016/S1631-0691(03)00069-6/

Version originale du texte intégral

1 Introduction

During the recent years, the rapid development of the bio-arrays techniques [1] based on isotopic or fluorescent activity of hybridised DNA chips allowed the biologist to give to a grey level peak the signification of an expression rate for the genes studied in the bio-array. If we repeat this acquisition at different times of the cell cycle for different cells of a same tissue, we can calculate correlations between the genes expression rate and hence we are able to make explicit a matrix W called the intergenic interaction matrix, representing the repression and induction influences a gene can exert on other genes.

1.1 The raw data from the bio-array imaging

The first encountered problem with the bio-array image is the noise and we have to low-pass it in order to suppress the high-frequency noise (see Fig. 1). The result of this pre-treatment is a better separation of the isotopic activity peaks, allowing a watershed separation and contouring [2,3]. We can also apply a more accurate segmentation and contouring method called potential-Hamiltonian or ‘Gaussian-stamping’ method. Let us remark that the peaks are about Gaussian, with a weak kurtosis and skewness, allowing in particular the respect of the conservation ‘law’: 2/3 of the activity peak are concentrated into the set of points (x,y) where the Gaussian curvature C(x,y) vanishes, i.e. inside the maximum gradient line, called the characteristic line of the peak. Then it is possible to neglect the part of the peak outside the projection of this line, whose equation is C(x,y)=∂²g/∂x²∂²g/∂y²−(∂²g/∂x∂y)²=0, g(x,y) denoting the grey level function at the pixel of coordinates (x,y).

Fig. 1
(a) Raw data; (b) low-pass filtering; (c) watershed segmenting; (d) contouring.

We are thus led to consider the new height function C(x,y) instead of the function g(x,y) and its level line C(x,y)=0. A new algorithm has been proposed in [1] to obtain automatically the characteristic line and, after, by integrating inside the projection of this line on the (x,y) plane and multiplying by 3/2 the obtained result, to standardize the estimated activity in terms of a bio-image with small squares symbolizing in grey levels the degree of hybridisation of the cDNA's expressing the regulation of a glioma tissue (Fig. 2). From such bio-array images acquired in cells of the same tissue at different times of the cell cycle, we can study the interactions between genes by estimating an interaction matrix.

Fig. 2
‘Gaussian-stamping’ contours (left) and standardized bio-array image (black rectangle right corresponds to the left image).

2 Some rigorous results about the network attractors

2.1 The interaction matrix $W$

The interaction matrix W is similar to the synaptic weight matrix, which rules the relationships between neurons in a neural network. The general coefficient w_ik of such an interaction matrix W is equal to +1 (resp −1, 0) if the gene G_k activates (resp inhibits, does not influence) the gene G_i, the state x_i of the gene G_i being equal to +1 (resp −1), if it is (resp is not) expressed. In the case of small regulatory genetic systems (called operons), the knowledge of such a matrix W permits to make explicit all possible stationary behaviours of the organisms having the corresponding genome. The change of state of gene G_i between t and t+1 obeys a threshold rule: x_i(t+1)=H(∑_k=1,nw_ikx_k(t)−b_i) or $x (t + 1) = H (Wx (t) - b)$ , where H is the sign step function (H(y)=1, if y⩾0 and H(y)=−1, if y<0) and the b_is are threshold values. When t is increasing, the genes states reach a stable set of configurations (a fixed configuration or a cycle of configurations), called attractor of the genetic network dynamics. For example, in the regulatory network that regulates the Arabidopsis thaliana flower morphogenesis, the interaction matrix is a (11,11)-matrix with only 22 non-zero coefficients (see Fig. 3). This matrix presents $P (W) = 4$ positive loops and $A (W) = 4$ attractors (see Section 3.1). Hence it is in general of a great biological interest and relevance to determine matrices having characteristic properties like (i) a minimal number of non-zero coefficients for a given set of attractors (fixed points or cycles) or (ii) a minimal number $P (W)$ of positive loops, controlling the number $A (W)$ of attractors and their stability (cf. [4–9] for the continuous case [10–12] and for the discrete one). In the following, we intend to partly solve the problems taken above by giving necessary and sufficient conditions to obtain properties (i) and (ii). In order to calculate the w_iks, we can either determine the s-directional correlation ρ_ik(s) between the state vector {x_k(t−s)}_t∈C of gene j at time t−s and the state vector {x_i(t)}_t∈C of gene i at time t, t varying during the cell cycle C of length M=|C| and corresponding to observation times of the bio-array images:

ρ_{ik} (s) = (\sum_{t \in C} x_{k} (t - s) x_{i} (t) - \sum_{t \in C} x_{k} (t - s) \sum_{t \in C} x_{i} (t) / M) / σ_{k} (s) σ_{i} (0)

where

σ_{k} (s) = {(\sum_{t \in C} x_{k} {(t - s)}^{2} - {(\sum_{t \in C} x_{k} (t - s))}^{2} / M)}^{1 / 2}

and then take w_ik=sign(∑_s=1,…,mρ_ik(s)/M), if |w_ik|>η, and w_ik=0, if |w_ik|<η, where η is a de-correlation threshold, or identify the system with a Boolean neural network. When it is impossible to so obtain all the coefficients of W (neither from the literature nor from such calculations), it is possible to complete W: we choose randomly the missing coefficients by respecting the connectivity coefficient

K (W) = I / N

, the ratio between the number I of interactions and the number N of genes, and the mean inhibition weight

I (W) = R / I

, the ratio between the number of inhibitions (or repressions) R and

I \cdot K (W)

is in general between 1.5 and 3 and

I (W)

between 1/3 and 2/3 for many known operons or regulatory networks (lactose operon, Cro operon for the phage δ, lysogenic/lytic operon for the phage μ, gastrulation and Arabidopsis thaliana flowering regulatory networks...).

Fig. 3
The lactose operon exhibited by Jacques Monod.

If G is the interaction graph associated to W, then we call connected component C of G each set of genes C such that there is a path between every pair of genes of C along a sequence of arcs of G. A Garden of Eden is a gene receiving no arc, but influencing at least one other gene. A regulon is a connected component of G having exactly one positive (auto-catalysis) and one negative loop, these loops sharing the auto-catalysed node. In the lactose operon (see its G in Fig. 3), $K (W) = 8 / 6$ , $I (W) = 3 / 8$ , $P (W) = 2$ , $A (W) = 2$ (βgal-activated and inactivated states), and G has one connected component and one regulon.

2.2 Some definitions and notations

In the following, we give some definitions about the rigorous mathematical description of the discrete Boolean networks used to describe the genes interaction dynamics, and their associated graph G and matrix W. Then we will present some theoretical results with rigorous proofs only for the first and last results in order to show what kind of reasoning we have to perform and we will refer to [13–16] for complete demonstrations. Let us consider a graph G=(V, E), where V={1,…,n} is the set of nodes and E is the set of arcs. Let $W = (w_{ik})$ be a real (n,n)-matrix. We call G the incidence graph of W, if (k,i), the arc going from k to i, belongs to E, then w_ik≠0. By extension, W will also be called the incidence matrix of G. We will define the sign of an arc (k,i), denoted by sign((k,i)), as the sign of w_ik. Let us denote by Γ⁻(i) (resp Γ⁺(i)) the set of nodes {i₁,i₂,…,i_k(i)} such that (i_j,i) (resp (i,i_j)) belongs to E, for each j=1,…,k(i). We will say that a set of arcs C={e₁,e₂,…,e_r} is a chain if each e_k in C has a node belonging to e_k−1 and the other one belonging to e_k+1. We will say that C is a simple (resp elementary) chain if the arcs (resp nodes) are different. In the sequel we will understand by chain a simple and elementary chain. In the same way we will call C a path if e_k=(i_k,i_k+1) implies e_k+1=(i_k+1,i_k+2), for all k=1,…,r, that is to say the final node of each arc is the beginning node of the next arc in C. The sign of a path or a chain C (denoted by sign(C)) is positive if the number of negative arcs of C is even and negative if this number is odd. A cycle (resp circuit or loop) is defined as a chain (resp path) where each of the two extremities of any arc belongs to two and only two arcs. For simplicity of notation, we will say that a node i belongs to a cycle C if there exists a node j such that (i,j) or (j,i) belongs to C. Every other definition of graph theory used here will be consistent with that in [17,18]. We will call a circuit or cycle C negative (resp positive) if sign(C) is negative (resp positive). Define now a discrete state regulatory network, acting on the set of states {−1,1}, here and subsequently denoted by N, as the 4-uple N=(G, W, b, sign), where G is the incidence graph of W, b is a threshold real vector and the local transition function is given by x_i(t+1)=sign(∑_k=1,…,nw_ikx_k(t)−b_i), $\forall x \in {- 1, 1}^{n}$ , where sign(u)=1 if u⩾0 and sign(u)=−1 otherwise. The sequential iteration consists to update the nodes one by one in a prescribed periodic update I=(i(1),i(2),…,i(n)), where {i(1),i(2),…,i(n)}={1,2,…,n}, that is to say, starting with a given $x (0) = (x_{1} (0), \dots, x_{n} (0))$ in {−1,1}ⁿ, we generate a sequence of iterates:

x_{i (k)} (t) = sign (\sum_{j < k} w_{i (k) i (j)} x_{i (j)} (t) - b_{i (k)} + \sum_{j ⩾ k} w_{i (k) i (j)} x_{i (j)} (t - 1) - b_{i (k)}), \forall k \in {1, \dots, n}

Now, the parallel iteration consists in updating all the nodes synchronously:

x_{i} (t + 1) = sign (\sum_{k = 1, \dots, n} w_{ik} x_{k} (t) - b_{i}), \forall i \in {1, \dots, n}, with x (0) \in {- 1, 1}^{n}

We shall say that x is a fixed point if it is invariant under the application of the complete sequence of updates. Observe that the kind of iteration does not change the set of fixed points, but only change their attraction basins. In the following we will use systematically the parallel iteration.

2.3 Relations between positive and negative cycles, and fixed points

In the sequel, we will assume that the graph G is connected, since otherwise one can apply the results to each of connected components of G. In addition, we will suppose with no loss of generality that |Γ⁻(i)|>0, for all i∈V. Since otherwise, if there exists a node i∈V such that Γ⁻(i) is empty, then we can assume that the arc (i,i) exists in E; in this way the dynamics of both networks are the same. It evidently follows from this property that there exists at least one circuit C in G (possibly a circuit of the form (i,i)). Finally, we suppose that the graph G and the matrix W have a quasi-minimal structure, that is to say, all (j,i), such as i≠j, belong to E (or equivalently w_ij≠0, if i≠j), if there exists $x \in {- 1, 1}^{n}$ , such that:

sign (\sum_{k} w_{ik} x_{k} - b_{i}) \neq sign (\sum_{k \neq j} w_{ik} x_{k} - b_{i})

Hence, we have the following necessary condition to have a quasi-minimal structure:

- \sum_{k} | w_{ik} | < b_{i} ⩽ \sum_{k} | w_{ik} |, \forall i \in 1, \dots, n

The following property will be very useful in the following for characterizing a cycle.

Proposition 1

A cycle C is positive if and only if there exists a vector $x \in {- 1, 1}^{n}$ such that for all (k,i)∈C, sign(w_ik)=x_ix_k or equivalently, for all (k,i)∈C, $x_{i} = sign (w_{ik}) x_{k} (1)$ .

Proof

Let C be a positive cycle and i(0) a fixed node belonging to C. Let us enumerate the nodes belonging to C by i(0),i(1),…,i(j), such that $\forall k = 0, \dots, j, (i (k - 1), i (k))$ or (i(k),i(k−1))∈C (by identifying j and −1). Finally, let us define the vector x as follows:

x_{i (0)} = 1 and x_{i (k)} = sign (w_{i (k) i (k - 1)}) x_{i (k - 1)} if (i (k - 1), i (k)) \in C or

x_{i (k)} = sign (w_{i (k - 1) i (k)}) x_{i (k - 1)} if (i (k), i (k - 1)) \in C, \forall k = 1, \dots, j

Obviously x is satisfying equation (1). Hence –x satisfies equation (1) too. Finally, it is direct that there does not exist another vector

y \notin {x, - x}

that satisfies equation (1).

Let C be now a negative cycle, and let us suppose that equation (1) is true, then ∏_(j,i)∈Csign(w_ij)=∏_jx_j∏_ix_i=(∏_jx_j)², but sign(C)=∏_(j,i)∈Csign(w_ij)<0, which is contradictory.□

Theorem 1

Given N, if all cycles of the incidence graph G are positive, then there exists a vector $x = (x_{1}, \dots, x_{n}) \in {- 1, 1}^{n}$ such that $x$ and $- x = (- x_{1}, \dots, - x_{n})$ are fixed points of N.

Remark

There are two remarkable fixed points having by construction a non-frustration property, that is on each cycle the sign changes of x_is are identical to the sign changes of the arcs. For other possible fixed points, there is at least one cycle for which sign changes are frustrated.

Theorem 2

If all circuits of the incidence graph G are negative, then N has no fixed points.

2.4 Minimal regulatory networks

The previous results allow us to characterize some minimal regulatory networks. The following propositions constitute examples of minimal regulatory networks. They solve in part the inverse problem consisting in the description of W only from the knowledge of a phenotypic x observed from bio-array images.

Proposition 2

Let N having n nodes and n connections, a necessary and sufficient condition of existence of a fixed point $x$ is the existence of a positive circuit. In this case, $x$ and $- x$ are both fixed points. Hence we can characterize the set of minimal Ns having $x$ as fixed point.

Proposition 3

Given a state vector $x$ , the set of minimal networks $N = (G, W, b, sign)$ having $x$ as fixed point is given by the following conditions:

(1) w_ik=α_ikx_ix_k, where α_ik⩾0 and, for all i, there exists k(i) such that α_ik(i)≠0 and
(2) −|α_ik(i)|<b_i⩽|α_ik(i)|.

Proposition 4

Let N with n nodes and n+1 connections, a necessary and sufficient condition for existence of an attractor of all points parallel iterated, is a negative circuit and a positive circuit intersecting.

2.5 Fixed points bounds in regulatory networks

Given N, let C be a positive circuit of N, then by Proposition 1, there exists $x \in {- 1, 1}^{| V (C) |}$ , such that x and −x satisfy the equation: ∀(k,i)∈C, sign(w_ik)=x_ix_k. We denote u(C)∈{−1,1}^|V(C)| the vector defined by: u(C) $= x$ (resp −x), if x_i(0)=1 (resp −1), where i(0)=min{i∣i∈C}.

Lemma 1

Given N and $y$ a fixed vector of N, then for all i∈V, there exists a positive circuit C(i) in G such that for all k in C(i),y_k=u(C(i))_k or for all k in C(i),y_k=−u(C(i))_k.

Theorem 3

If m is the total number of positive circuits of N, then the number of fixed points of N is⩽2^m, and this upper bound is reached if and only if for all circuits C of N there does not exist an arc (k,i) in C^C ending in C (there is no garden of Eden k pending to C).

Remark

We have to notice that the condition concerns the number of circuits and not of cycles, these last being in general very more numerous.

2.6 Asymptotic mean value for the number of fixed configurations (fixed vectors or limit cycles of vectors) in the case K $(W) = 2$

Let us consider now a network N having n nodes and 2n connections such as $K (W) = 2$ . We search for a mean value of the number of fixed configurations, when n is growing to infinity.

Lemma 2

For any graph G having m non-oriented edges, the mean number of oriented edges we can define on G from the non-oriented configuration is equal to 4m/3.

Proof

Let us note 〈o〉 the mean number of oriented edges we can construct from a configuration of m non-oriented edges; then, if exactly k from the m non-oriented edges are decomposed into two oriented opposite connections, we have C_m^m−k2^m−k different ways to dispatch the not double connections into the (m−k) other non-oriented edges; hence we can write: $〈 o 〉 = \sum_{k = 0}^{m} (k + m) C_{m}^{m - k} 2^{m - k} / \sum_{k = 0}^{m} C_{m}^{m - k} 2^{m - k} = 4 m / 3$ .□

Theorem 4

If the network N has n nodes and $K (W)$ n connections, with $K (W) = 2$ , then the expectation of the number of fixed configurations of N is n^1/2, if n is sufficiently large.

Proof

Following [19], if the connections of N are random, and if the mean number c of non-oriented edges per node is equal to 3/2, then the random variables X_i equal to the number of disjoint cycles of length i of N are independent and Poissonnian with parameter λ(i)=2ⁱ⁻¹/i, if n is sufficiently large. From Lemma 2, we are just in this case, because we have 2n=4m/3 connections, hence m=3n/2 and c=m/n=3/2. Then we have, for the mean number 〈f〉 of fixed configurations of N: $〈 f 〉 = \sum_{s = 0}^{n} \sum_{k = s}^{n} \sum_{σ \in Ω (s, k)} A (σ) Π_{σ}$ , where $Ω (s, k) = {σ = (s (1), \dots, s (n)) / s (i) ⩾ 0$ , ∑_i=1ⁿs(i)=s, ∑_i=1ⁿis(i)=k}, Π_σ=P({X_i=s(i),s(i)⩾0,∑_i=1ⁿs(i)=s, ∑_i=1ⁿis(i)=k})=e^−∑λ(i)∏_i=1ⁿλ(i)^s(i)/s(i)! is the probability to have the X_is equal each to s(i), and A(σ) is the mean number of fixed configurations, when each X_is is equal to s(i).

We will now evaluate the expectation A(σ). Each disjoint positive circuit bringing two fixed points (Theorem 3 above), an isolated positive non-circuit cycle bringing also two fixed points and an isolated negative circuit bringing one limit cycle, we can first calculate A(0,σ), the expected number of fixed configurations in the case where we have only disjoint positive circuits, the rest of the nodes depending on these circuits (and hence their states being fixed by the states of the circuit): A(0,σ)=B(0,σ)/D(σ), where B(0,σ)=2^s (number of fixed points of s=∑_i=1ⁿs(i) disjoint positive circuits, from Theorem 3 above)×2^k (number of different signs for each of the k=∑_i=1ⁿis(i)⩽n nodes involved in the s circuits)×[2^s (number of different directions – left or right – for each of the s circuits)/2^s (reduction factor for having only positive circuits)]×N(σ),D(σ)=2^k (number of different directions for each of the k connections)×2^k (number of different signs for each of the k connections)×N(σ), where N(σ) is the number of choices for the s disjoint cycles: N(σ)=C_k^{s(1)1,…,s(n)n}∏_i=1ⁿ(i−1)!^s(i)/2^s. N(σ) just equals the number of choices of k nodes in s(1) subsets of size 1,…,s(n) of size n times the number of choices of different loops (without multiple points) connecting the vertices inside each of these subsets.

In the same way, we can calculate A(1,σ) (resp A(j,σ)) the expected number of attractors of N in the case where we have among the s disjoint cycles 1 (resp j) isolated positive non-circuit cycles (bringing two fixed vectors) or isolated negative circuits (bringing 1 fixed cycle).

We have also:

A (1, σ) = B (1, σ) / D (σ)

where

B (1, σ) = 2^{s - 1} (2^{s - 1} / 2^{s - 1}) N (σ) [2^{k - 1} s (1) (2^{1} 2^{1} 2^{1} + 2^{1} 2^{1} - 2^{1} 2^{1} 2^{1}) / 2^{1} + \dots + 2^{k - i} s (i) (2^{1} 2^{i} 2^{i} + 2^{i} 2^{1} - 2^{1} 2^{i} 2^{1}) / 2^{1} + \dots + 2^{k - n} s (n) (2^{1} 2^{n} 2^{n} + 2^{n} 2^{1} - 2^{1} 2^{n} 2^{1}) / 2^{1}]

where s(i)2¹2ⁱ2ⁱ/2¹ is just the number (2¹) of fixed points of 1 positive cycle (circuit or not) of length i times the number of such configurations s(i)(2ⁱ2ⁱ/2¹), s(i)2ⁱ2¹/2¹ is the number (1) of attractors of 1 isolated negative circuit of length i times the number of such configurations s(i) (2ⁱ2¹/2¹) and −s(i)2¹2ⁱ2¹/2¹ is the number (2¹) of fixed points of 1 positive circuit (already counted in B(0,σ)) times the number of such configurations s(i) (2ⁱ2¹/2¹); 2^s−1 (2^s−1/2^s−1)N(σ)2^k−i is equal to the number of configurations of s−1 positive circuits with s(1) of length 1,…,s(i)−1 of length i,…,s(n) of length n. Then we have: A(2,σ)=B(2,σ)/D(σ), where

B (2, σ) = 2^{s - 2} (2^{s - 2} / 2^{s - 2}) N (σ) [2^{k - 2} s {(1)}^{2} (2^{2} 2^{2} 2^{2} - 2 (2^{2} 2^{2} 2^{1} - 2^{1} 2^{2} 2^{1}) + 2^{2} 2^{1}) / 2^{2} + \dots + 2^{k - i - j} s (i) s (j) (2^{2} 2^{i + j} 2^{i + j} - (2^{2} 2^{i + j} 2^{i} 2^{1} - 2^{1} 2^{i + j} 2^{i} 2^{1}) - (2^{2} 2^{i + j} 2^{j} 2^{1} - 2^{1} 2^{i + j} 2^{j} 2^{1}) + 2^{i + j} 2^{2}) / 2^{2} + \dots + 2^{k - 2 n} s {(n)}^{2} (2^{2} 2^{2 n} 2^{2 n} - 2 (2^{2} 2^{2 n} 2^{n} 2^{2} - 2^{1} 2^{2 n} 2^{n} 2^{2}) + 2^{2 n} 2^{2}) / 2^{2}]

where s(i)s(j)(2²2^i+j2^i+j−(2²2^i+j2ⁱ2²−2¹2^i+j2ⁱ2²)−(2²2^i+j2^j2²−2¹2^i+j2^j2²)+2^i+j2²)/2² is just the number of the fixed configurations of a couple made of positive not circuit cycles or negative circuits, the (s−2) remaining cycles being positive circuits, by paying attention to the fact that the fixed configurations of the couple of a positive not circuit cycle combined with a positive circuit (s(i)s(j)2²2^i+j(2ⁱ+2^j)2²) have been already counted both in B(1,σ) and in B(0,σ) and hence have to be taken away (by using sign−) from the sum s(i)s(j)(2²2^i+j2^i+j+2¹2^i+j2ⁱ2¹+2¹2^i+j2^j2¹+2^i+j2²)/2².

Finally, more generally, we have A(j,σ)=B(j,σ)/D(σ), where

B (j, σ) = 2^{s - j} (2^{s - j} / 2^{s - j}) N (σ) [\sum_{ζ \in I} 2^{k - r (ζ)} [2^{j} 2^{r (ζ)} 2^{r (ζ)} + \sum_{m = 1}^{j} 2^{j - 1} 2^{r (ζ) - i (m)} 2^{r (ζ) - i (m)} (2^{i (m)} 2^{1} - 2^{1} 2^{i (m)} 2^{1}) + \dots + \sum_{ξ = (m (1), \dots, m (v)) \in {1, \dots, n}} v 2^{j - v} 2^{r (ζ) - r (ξ)} 2^{r (ζ) - r (ξ)} (2^{r (ξ)} 2^{v} - v (2^{2} 2^{r (ξ)} 2^{v} - 2^{1} 2^{r (ξ)} 2^{v}) + v (v - 1) (2^{2} 2^{r (ξ)} 2^{v} - 2 \cdot 2^{3} 2^{r (ξ)} 2^{v} + 2^{4} 2^{r (ξ)} 2^{v}) / 2 + \dots + {(- 1)}^{v} 2^{v} 2^{r (ξ)} 2^{v}) + \dots + {(- 1)}^{j} 2^{j} 2^{r (ζ)}] / 2^{j}] = 2^{s - j} (2^{s - j} / 2^{s - j}) N (σ) \sum_{I} \prod_{t = 1}^{j} {(2^{i (t) - 1} - 1 / 2)}^{u (i (t))}

where I={ζ=(i(1),…,i(j))∈{1,…,n}^j| ∀t=1,…,j, the number u(i(t)) of cycles of size i(t) satisfies: 0<u(i(t))⩽s(i(t))}, j=∑_t=1^ju(i(t)), r(ζ)=∑_t=1^ji(t), and 2^j2^r(ζ)2^r(ζ)/2^j is just the number (2^j) of fixed points of j positive cycles (circuits or not) of lengths i(1),…,i(j) multiplied by the number of such configurations of j positive cycles (2^r(ζ)2^{i(1)+⋯+i(j)}/2^j), ∑_m=1^j2^j−12^r(ζ)−i(m)2^r(ζ)−i(m)·(2^i(m)2¹−2¹2^i(m)2¹)/2^j being the number of attractors in a configuration where we have 1 negative circuit of length i(m) among the (j−1) other positive cycles (circuits or not) diminished by the number of the configurations having (j−1) positive non-circuit cycles and (k−j+1) positive circuits (already counted in B(j−1,σ)). The other terms of B(j,σ) correspond to the number of fixed configurations of sub-graphs having (k−j) positive circuits and j either positive non-circuit cycles or negative circuits, diminished by the number of already counted fixed configurations in the B(m,σ)s, for m<j−1, and not yet taken away. We remark to end the calculation of B(j,σ) that:

2^{k - r (ζ)} [\sum_{ξ = (m (1), \dots, m (v)) \in {1, \dots, n}} v 2^{j - v} 2^{r (ζ) - r (ξ)} 2^{r (ζ) - r (ξ)} (2^{r (ξ)} 2^{v} - v (2^{2} 2^{r (ξ)} 2^{v} - 2^{1} 2^{r (ξ)} 2^{v}) + v (v - 1) (2^{2} 2^{r (ξ)} 2^{v} - 2 \cdot 2^{3} 2^{r (ξ)} 2^{v} + 2^{4} 2^{r (ξ)} 2^{v}) / 2 + \dots + {(- 1)}^{v} 2^{v} 2^{r (ξ)} 2^{v})] / 2^{j} = \sum_{ξ = (m (1), \dots, m (v)) \in {1, \dots, n}} v 2^{v} 2^{k} 2^{r (ζ) - r (ξ)} {(1 / 2 - 1)}^{v} = \sum_{ξ = (m (1), \dots, m (v)) \in {1, \dots, n}} v 2^{k} 2^{r (ζ) - r (ξ)} {(- 1)}^{v}

By summing the A(j,σ)s and after the A(σ)Π_σs, 〈f〉 is clearly of the order of n^1/2:

〈 f 〉 = \sum_{s = 0}^{n} \sum_{k = s}^{n} \sum_{σ \in Ω (s, k)} e^{- \sum λ (i)} \prod_{i = 1}^{n} λ {(i)}^{s (i)} / s (i)! \sum_{j = 0}^{n} A (j, σ) = \sum_{s = 0}^{n} \sum_{k = s}^{n} \sum_{σ \in Ω (s, k)} (e^{- \sum λ (i)} / s!) (s! / \prod_{i = 1}^{n} s (i)!) K_{σ}

where

K_{σ} = 2^{s - k} \prod_{i = 1}^{n} λ {(i)}^{s (i)} {(2^{i - 1} - 1 / 2 + 1)}^{s (i)} = \prod_{i = 1}^{n} {(2^{i} / i)}^{s (i)} {(1 + 1 / 2^{i})}^{s (i)} and

\sum_{i = 1}^{n} λ (i) = (\sum_{i = 1}^{n} 2^{i} / i) / 2 = \sum_{i = 1}^{n} \underset{0}{\int^{2}} x^{i - 1} d x / 2 = \underset{0}{\int^{2}} \sum_{i = 1}^{n} x^{i - 1} d x / 2 = \underset{0}{\int^{2}} (x^{n} - 1) / (x - 1) d x / 2 < 2^{n - 1}

Then we have: $〈 f 〉 \sim \sum_{s = 0}^{n} e^{- \sum λ (i)} {(\sum_{i = 1}^{n} λ (i) + \ln n / 2)}^{s} / s! = O (\sqrt{n})$ .□

Remark

Theorem 4 corresponds to the Kaufmann's conjecture [20].

3 Examples of genetic regulation networks

3.1 The flowering regulatory network of Arabidopsis thaliana

If we consider the interaction graph of the flowering regulatory network of Arabidopsis thaliana (Fig. 4, right) [10], then we can easily define from it a Boolean dynamics, Fig. 4 (left) giving an example of attractor with final states (in bold red) different from the initial conditions. The characteristics of the associated interaction matrix W are: $K (W) = 22 / 11 = 2$ , $I (W) = 10 / 22$ , $P (W) = 4$ , $A (W) = 4$ (corresponding to the 4 differentiated tissues of the flower, i.e. sepals, petals, stamens and carpels). W has two connected components and four gardens of Eden. A(W) is well ⩽2⁴ and in fact exactly equal to 2², where 2 is the number of connected components having at least one positive loop. Then we can recall that:

– in 1948, Delbrück [21] conjectured that positive loops in the interaction graph of a regulatory network was a necessary condition for cell differentiation, i.e. for the existence of multiple attractors of the genes expression; this conjecture has been written in a good mathematical context by Thomas in 1980 [22]; we have proved above that the positive loops were related to the observation of multiple attractors, which definitively gives to the positive loops another signification than to the negative ones, more related to the stability of the system (like in the classical Watt regulator, well known in cybernetics, cf. Fig. 5);
– in 1992, Kauffman [20] conjectured that the mean number of attractors for a Boolean genetic network with n genes and with connectivity 2 was of the order of √n (see Theorem 4 above). This conjecture is now supported by real observations: we have about 35 000 genes in the human genome and about 200 different tissues, which can be considered as different attractors of the same dynamics. For Arabidopsis thaliana, there is $A (W) = 4 \approx \sqrt 11$ different tissues [10] and for the Cro operon of the phage $λ, K (W) = 14 / 5 = 2.8$ , $I (W) = 9 / 14$ , $A (W) = 2 \approx \sqrt 5$ (lytic and lysogenic attractors) [23,24], with Boolean [25] or discrete multi-level [26] models.

Fig. 4
Interaction graph of the flowering regulatory network of Arabidopsis thaliana (right) and an attractor of its Boolean dynamics (left).

Fig. 5
The Watt regulator, the prototype of negative regulatory loop in cybernetics.

3.2 The gastrulation regulatory network

If we consider the regulatory network ruling the gastrulation in Drosophila (cf. Fig. 6 and [28]), it is easy to check that $K (W) = 25 / 15$ , $I (W) = 5 / 15$ , $P (W) = 4$ and $A (W) = 2$ (the corresponding cells being the ordinary ectoderm cell and the trapezoidal invagination cell called bottle cell). The regulation graph contains five connected components (among which three are singletons). In this case, the classical Kolmogorov–Rashevski–Turing models of reaction–diffusion [29–31] are well explaining the epigenetic part of the invagination at the start of the gastrulation, but only after the apparition of a new bottle cell presenting an apical constriction due to the change of intracellular balances ATP/ADP and GTP/GDP (whose ratios increase), due to the expression of the kinase (ADK and GDK) genes. This is due to a change of attractor basin by the bottle cell starting the gastrulation process due to the genetic regulation pathway of Fig. 6. This context describing the morphogenesis from genetic and epigenetic forces was called by Waddington a chreode or a morphogenetic landscape (cf. Fig. 7).

Fig. 6
The gastrulation regulatory network (after [27]) (ADK and NDK are respectively the adenylate kinase and the nucleotide diphosphate kinase).

Fig. 7
The Waddington chreode or morphogenetic landscape.

3.3 The phage μ lytic-lysogenic attractor [32]

If we consider the operon governing the expression of the phage μ, we obtain the graph given in Fig. 8. It is interesting to notice that $K (W) = 3 / 2$ , $I (W) = 1$ , $P (W) = 1$ , $A (W) = 2$ (the two corresponding states in the host cell being the lytic and lysogenic ones, like for the Cro operon of the phage λ [24]). There is only one connected component.

3.4 The mnesic ‘opernet’

We will call in the following mnesic ‘opernet’ the system obtained by merging the genetic (operon) and epigenetic parts (metabolic net) of the system ruling the cotyledonary buds growth (cf. [33,34] and Fig. 9).

The genetic part of the mnesic opernet has been modelled by a Boolean system [34]:

– variable P_A (resp P_B) represents pricking treatment (or any other stress action) on the side A (resp B) of the plant and its value is 1 if treatment has been done, and 0 if not;
– variable S_A (resp S_B) represents the discrete part of the operon; we suppose that it contributes to mobilize a morphogenetic cotyledonary material R_A (resp R_B) responsible for the growth of the apex and of the cotyledonary bud A (resp B).

We will suppose in the following that the variable R_A (resp R_B) representing the concentration of R on side A (resp B) is continuous and that its velocity dR_A/dt (resp dR_B/dt) is ruled by a differential system containing a three-switch between the continuous variables T (apex growth metabolites concentration), A and B (cotyledonary buds A and B growth metabolites concentrations on respectively A and B side) (see Fig. 10).

Fig. 10
Interaction graph of the epigenetic part as a continuous differential system.

Graph G of Fig. 9 is such that $K (W) = 16 / 5$ , $I (W) = 10 / 16$ , $P (W) = 3$ , $A (W) = 3$ ; G is connected and contains two regulons.

Then we can write the differential system governing the continuous variables T,A,B,R_A and R_B as follows:

d R_{A} / d t = (σ - kT - 4 kA / 5 - kB / 5) R_{A} - F (R_{A}) (T + 4 A / 5 + B / 5) / (T + A + B) - {wP}_{A} - {wP}_{B} / 2

d R_{B} / d t = (σ - kT - 4 kB / 5 - kA / 5) R_{B} - F (R_{B}) (T + A / 5 + 4 B / 5) / (T + A + B) - {wP}_{B} - {wP}_{A} / 2

d T / d t = (F (R_{A}) + F (R_{B})) T / (T + A + B) - ν T

d A / d t = F (R_{A}) 4 A / 5 (T + A + B) + F (R_{B}) B / 5 (T + A + B) - ν A

d B / d t = F (R_{B}) 4 B / 5 (T + A + B) + F (R_{A}) A / 5 (T + A + B) - ν B

The two first equations correspond to the dynamics of R_A (resp R_B) whose concentration derivative at time tdR_A(t)/dt (resp dR_B(t)/dt) results from an auto-catalytic term σR_A(t) (resp σR_B(t)) diminished by the term (−kT(t)−4kA(t)/5−kB(t)/5) R_A(t) (resp (−kT(t)−4kB(t)/5−kA(t)/5) R_B(t)) expressing the inhibition by T, A and B, plus a production of growth metabolites term denoted by F(R_A(t)) (T(t)+4A(t)/5+B(t))/5)/(T(t)+A(t)+B(t)) (resp F(R_B(t))(T(t)+A(t)/5+4B(t)/5)/(T(t)+A(t)+B(t))), by supposing that the R_A (resp R_B) consumption is competitively inhibited by the bud growth on its side A (resp B) and by the bud growth on the other side and by considering that K_ms and $K_{\min hib}$ s are equal to 1, plus the instantaneous perturbation wP_A(t) from its side A (resp B) and wP_B(t)/2 from the other side B (resp A), the value of P_A(t) (resp P_B(t)) being 1 if the pricking treatment occurs on A (resp B) at time t=t_P, and 0 elsewhere.

The equations for the apex and cotyledonary buds growth metabolites concentrations just express that their production comes from R_A and R_B, with a competitive inhibition by the other sources of growth, plus a linear degradation term.

We suppose now for interpreting a minima the experimental results given in Tables 1 and 2 of [33] that F is an allosteric function of order 4 having two successive inflection points (involving that the protein catalysing the production of apex and buds growth metabolites has four catalytic subunits) as allowed by the Monod–Wyman–Changeux equation (see [35] and Fig. 11).

Fig. 11
Allosteric function F, which presents two successive inflection points.

If the value of F′ verifies F(r)−rF′(0)<0 and ν<F(r)/r−F′(r)<2 (krF′(r))^1/2−ν, then the differential system above possesses at most 16 stationary states, whose 0 is a stable focus, two (respectively (r,0,σr/(ν+kr)) and (0,r,σr/(ν+kr)) are unstable focuses surrounded by limit cycles α and β, and C(r,r,2σr/(ν+kr)) is an attractor (either stable focus, or limit cycle) as shown in Fig. 12, by supposing known the dynamics of the inhibitory three-switch [36] between T, A and B.

Fig. 12
Experimental perturbations in the state space (R_A,R_B,T).

More generally, if we have an inhibitory n-switch between the A_i's verifying:

d A_{i} / d t = {KA}_{i} / \sum_{j = 1, \dots, n} A_{j} - ν A_{i}

then the stationary states A_i=k=K/ν, A_j=0, for j≠i are stable and the stationary states having m>1 metabolites equal to k=K/mv>0 and the other vanishing are unstable. It is easily to check this property on the Jacobian matrix of the differential system above [37] whose unique eigenvalue λ=−ν<0 in the first case and, in the second case, whose spectrum has the general eigenvalue λ=−ν+ν(m−1)/m−rν/m−r²ν/m−⋯−r^m−1ν/m, where r is one of the mth root of the unity. Then λ=−(ν/m)(1+r+r²+⋯+r^m−1)=0, if r=e^i2π/m, which implies the non-stability.

The possible configurations of experimental perturbations as reported in Table 1 below and in Tables 1 and 2 of [33] give different trajectories after perturbations, as explained in the following. If n_A (resp n_B) represents the number of seedlings beginning to elongate on the side of bud A (resp B), then g=(n_A−n_B)/n, where n=n_A+n_B, is an asymmetry growth index.

Pricking treatment	g	Domination
(1) Non-pricked control	0.02	A = B
(2) 4A with decapitation at onset daylight (dod)	0.35±0.02	A<B
(3) 4A with decapitation at midday (dm)	0.08±0.15	A=B
(4) 1A (dod)	0.01	A=B
(5) 4B (dod)	−0.35	A>B
(6) 1A (1 h) 4B (dod)	0.39	A<B
(7) 2A (dod)	0.06	A=B
(8) 2A (1 h) 2A/2B (dod)	0.32	A<B
(9) 2A (1 h) 2A/2B (3 h) 2A/2B (dod)	0.05	A=B
(10) 2A (1 h) 2A/2B (3 h) 2A/2B (5 h) 2A/2B (dod)	0.34	A<B

We can make in Fig. 12 above the following observations.

We have then shown only by using the qualitative description of both the genetic (after pricking or any stress) and epigenetic forces exerted on the opernet that all the simulated behaviours described above qualitatively fitted the observed phenomenology (Table 1 above and Tables 1 and 2 of [33]).

4 Conclusion

An important first conclusion we have to make explicit in this paper concerns the relationship between the number F of fixed points and the number S of interaction circuits of the interaction matrix W: the problem is in fact to find the best upper bound for F for a given interaction matrix W. This question is related to the famous 16th Hilbert's problem, whose one of the aim is to give an efficient upper bound for the number of limit cycles of a polynomial differential system. Let us summarize the role of the architecture of positive and negative circuits of W on the occurrence of multiple stationary behaviours, as obtained above: if the number of nodes and the number of arcs are the same, there is only one isolated interaction circuit (S=1) in W and either this circuit is negative and the lowest bound (0) for F is reached, or this circuit is positive and the upper bound (2¹) for F is reached. If the number of nodes is n and the number of arcs is n+1, there is two interaction circuits (S=2) with the following structure: if both circuits are negative, F=0; if there is a positive circuit and a negative circuit disjoint, F=0; if there is a positive circuit intersecting a negative circuit, F=1; if there is a positive circuit intersecting a positive circuit, F=1; if there is two disjoint positive circuits, F=2². If, more generally, the number S of interaction circuits of W is m, then: if all circuits are negative, F=0; if all circuits are positive, 2⩽F⩽2^m and if all circuits are positive and disjoint, F=2^m. An interesting open problem is now to make exhaustive the determination of F and S and in particular to find the circumstances (related to the circuits structure) in which we can relate the number of intersecting and isolated circuits to F. A conjecture we could make is that F=2^c, where c is the number of not-singleton connected components of the interaction graph G having at least one positive loop: it holds for the lactose, Arabidopsis, phage μ and gastrulation regulatory systems. The approach for solving this open problem could consist in finding coherent relationships between analogous properties discovered independently for continuous and Boolean versions of regulatory networks [4–9].

The second conclusion concerns the practical use of the presented results; a geneticist can for example exploit the minimality results in the following sense: we have shown in the paper that it would be possible to characterize the minimal interaction matrices having certain state vectors as fixed points. The determination of these matrices is not unique, but permits to focus on a certain important equivalence class to which the expected matrix has to belong. This considerably restricts the choice of the possible interaction matrices compatible with observed fixed points, when it is impossible to directly get from experiments all interaction coefficients, but when it is only possible to observe the phenomenology of fixed points or limit cycles. This corresponds in genetics to the observation of stationary expression behaviours (for example from bio-array imaging) without experimental measure of the inhibitory and activatory coefficients of repressors and promoters. The possibility to obtain (even in an equivalence class) a sketch of the interaction matrix permits to construct (by randomising in a Bayesian way the unknown coefficients of $W$ ) more complicated interaction matrices, then to test if they still have the observed states as fixed points and finally keep or reject definitively the so-tested matrices and propose further experimental strategies refining the knowledge about the interaction structure of a genetic regulatory network and then answer crucial biological questions like the relationship between genetic expression and recombination [16,38–40] (the crossing-over and translocations break points seeming correlated with the ubiquitory genes expression sites) or the relative parts taken by genetic and epigenetic forces in morphogenesis (embryogenesis or tumorogenesis). The last (but not the least) application of the interaction matrices introduced above is the ability to calculate the barycentre between two matrices by using classical (spectral or L₂) distances between matrices, then we could build phylogenic trees among a set of species avoiding the complex problems coming from the non-unicity of L₁ (Hamming or Manhattan) barycentres met in the sequence based phylogenic trees. The interaction based phylogenic trees could reflect more the genomic function than the genomic anatomy hence could explain more deeply the evolution trends.

Acknowledgements

We have done this work thanks to the support of the National Network for Technology Research RNTS ‘Technologies for Health’ from the French Ministry of Research.

Bibliographie

[1] J. Demongeot; J.-P. Françoise; M. Richard; F. Senegas; T.P. Baum A differential geometry approach for biomedical image processing, C. R. Biologies, Volume 325 (2002), pp. 367-374

[2] J. Demongeot, M. Richard, New segmenting and matching algorithms as tools for modeling and comparing medical images, Imacs 2000, EPFL, Lausanne, 2000, CD 127

[3] J. Mattes; M. Richard; J. Demongeot Tree representation for image matching and object recognition, Lect. Notes Comput. Sci., Volume 1568 (1999), pp. 298-309

[4] E. Plahte; T. Mestl; S.W. Omholt Feedback loops, stability and multi-stationarity in dynamical systems, J. Biol. Syst., Volume 3 (1995), pp. 409-414

[5] J. Demongeot Multi-stationarity and cell differentiation, J. Biol. Syst., Volume 6 (1998), pp. 1-2

[6] E.H. Snoussi Necessary condition for multi-stationarity and stable periodicity, J. Biol. Syst., Volume 6 (1998), pp. 3-10

[7] J.-L. Gouzé Positive and negative circuits in dynamical systems, J. Biol. Syst., Volume 6 (1998), pp. 11-16

[8] O. Cinquin; J. Demongeot Positive and negative feedback: striking a balance between necessary antagonists, J. Theoret. Biol., Volume 216 (2002), pp. 239-246

[9] O. Cinquin; J. Demongeot Positive and negative feedback: mending the ways of sloppy systems, C. R. Biologies, Volume 325 (2002), pp. 1085-1095

[10] L. Mendoza; E.R. Alvarez-Buylla Dynamics of the genetic regulatory network for Arabidopsis thaliana flower morphogenesis, J. Theoret. Biol., Volume 193 (1998), pp. 307-319

[11] E.H. Snoussi; R. Thomas Logical identification of all steady states: the concept of feedback loop characteristic states, Bull. Math. Biol., Volume 55 (1993), pp. 973-991

[12] J. Demongeot; M. Kaufman; R. Thomas Interaction matrices, regulation circuits and memory, C. R. Acad. Sci. Paris, Ser. III, Volume 323 (2000), pp. 69-80

[13] J. Demongeot; J. Aracena; S. Ben Lamine; M.-A. Mermet; O. Cohen Hot spots in chromosomal breakage: from description to etiology (D. Sankoff; J.H. Nadeau, eds.), Comparative Genomics, Kluwer, Amsterdam, 2000, pp. 71-85

[14] J. Demongeot; J. Aracena; S. Ben Lamine; S. Meignen; A. Tonnelier; R. Thomas Dynamical systems and biological regulations (E. Goles; S. Martinez, eds.), Complex Systems, Kluwer, Amsterdam, 2000, pp. 107-151

[15] J. Aracena, J. Demongeot, E. Goles, Fixed points and maximal independent sets on AND-OR networks, Discrete Appl. Math. (in press)

[16] J. Aracena; S. Ben Lamine; M.-A. Mermet; O. Cohen; J. Demongeot Mathematical modelling in genetic networks: relationships between the genetic expression and both chromosomic breakage and positive circuits (N. Bourbakis, ed.), BIBE 2000, IEEE, Piscataway, 2000, pp. 141-149

[17] C. Berge Graphes et Hypergraphes, Dunod, Paris, 1974

[18] E. Goles; S. Martinez Neural and Automata Networks, Maths. Appl. Ser., 58, Kluwer, Amsterdam, 1991

[19] B. Bollobas Random Graphs, Academic Press, London, 1985

[20] S. Kauffman The Origins of Order, Oxford University Press, Oxford, UK, 1993

[21] R. Thomas On the relation between the logical structure of systems and their ability to generate multiple steady states or sustained oscillations, Springer Ser. Synerget., Volume 9 (1980), pp. 1-23

[22] M. Delbrück Discussion, Unités biologiques douées de continuité génétique, Colloques internationaux CNRS, Volume 8 (1949), pp. 33-35

[23] R. Thomas; D. Thieffry; M. Kaufman Dynamical behavior of biological regulatory networks. I. Biological role and logical analysis of feedback loops, Bull. Math. Biol., Volume 57 (1995), pp. 328-339

[24] D. Thieffry; M. Colet; R. Thomas Formalization of regulatory networks: a logical method and its automatization, Math. Model. Sci. Comput., Volume 2 (1993), pp. 144-151

[25] R. Thomas; R. D'Ari Biological Feedback, CRC Press, Boca Raton, 1990

[26] F. Plouraboué; H. Atlan; G. Weisbuch; J.-P. Nadal A network model of the coupling of ion channels with secondary messenger in cell signaling, Network Computation in Neural Networks Systems, Volume 3 (1992), pp. 393-406

[27] J. Aracena, Modèles mathématiques discrets associés à des systèmes biologiques. Application aux réseaux de régulation génétique, PhD thesis, U. Chile & UJF, Santiago, Chile, & Grenoble, France, 2001

[28] M. Leptin Gastrulation in Drosophila: the logic and the cellular mechanisms, EMBO J., Volume 18 (1999), pp. 3187-3192

[29] N. Rashevsky Mathematical Biophysics, Cambridge United Press, London, 1948

[30] A. Turing The mathematical basis of morphogenesis, Phil. Trans. Ro. Soc. B, Volume 237 (1952), pp. 37-47

[31] A.N. Kolmogorov; I. Petrowski; N. Piscounov Étude de l'équation de la diffusion avec croissance de la quantité de matière et son application à un problème biologique, Mosc. Univ. Bull. Math., Volume 1 (1937), pp. 1-25

[32] F. Thuderoz DEA Report, UJF, Grenoble, France, 2000

[33] M. Thellier; L. Le Sceller; V. Norris; M.C. Verdus; C. Ripoll Long-distance transport, storage and recall of morphogenetic information in plants. The existence of a sort of primitive plant ‘memory’, C. R. Acad. Sci. Paris, Ser. III, Volume 323 (2000), pp. 81-91

[34] J. Demongeot; M. Thellier; R. Thomas A mathematical model for storage and recall functions in plants, C. R. Acad. Sci. Paris, Ser. III, Volume 323 (2000), pp. 93-97

[35] J. Demongeot; M. Laurent Sigmoidicity in allosteric models, Math. Biosci., Volume 67 (1983), pp. 1-17

[36] R. Thomas La logique des systèmes vivants, Bull. Cl. Sci. Acad. R. Belg., Volume 74 (1988), pp. 432-442

[37] O. Cinquin, J. Demongeot, Inhibitory n-switch dynamics and applications, Math. Biosci. (in preparation)

[38] O. Cohen; M.A. Mermet; J. Demongeot HC Forum^®: a web site based on an international human cytogenetic data base, Nuclear Acids Research, Volume 29 (2001), pp. 305-307

[39] O. Cohen; C. Cans; M. Cuillel; J.-L. Gilardi; H. Roth; M.A. Mermet; P. Jalbert; J. Demongeot Cartographic study: breakpoints in 1574 families carrying human reciprocal translocations, Hum. Genet., Volume 97 (1996), pp. 659-667

[40] O. Cohen; C. Cans; M.-A. Mermet; J. Demongeot; P. Jalbert Viability thresholds for partial trisomies and monosomies. A study of 1159 viable unbalanced reciprocal translocations, Hum. Genet., Volume 93 (1994), pp. 188-194

Commentaires - Politique

1 Introduction

1.1 The raw data from the bio-array imaging

2 Some rigorous results about the network attractors

2.1 The interaction matrix W

2.2 Some definitions and notations

2.3 Relations between positive and negative cycles, and fixed points

Proposition 1

Proof

Theorem 1

Remark

Theorem 2

2.4 Minimal regulatory networks

Proposition 2

Proposition 3

Proposition 4

2.5 Fixed points bounds in regulatory networks

Lemma 1

Theorem 3

Remark

2.6 Asymptotic mean value for the number of fixed configurations (fixed vectors or limit cycles of vectors) in the case K(W)=2

Lemma 2

Proof

Theorem 4

Proof

Remark

3 Examples of genetic regulation networks

3.1 The flowering regulatory network of Arabidopsis thaliana

3.2 The gastrulation regulatory network

3.3 The phage μ lytic-lysogenic attractor [32]

3.4 The mnesic ‘opernet’

4 Conclusion

Acknowledgements

2.1 The interaction matrix $W$

2.6 Asymptotic mean value for the number of fixed configurations (fixed vectors or limit cycles of vectors) in the case K $(W) = 2$