• Aucun résultat trouvé

[PDF] Top 20 Topological fixed points in Boolean networks

Has 10000 "Topological fixed points in Boolean networks" found on our website. Below are the top 20 most common "Topological fixed points in Boolean networks".

Topological fixed points in Boolean networks

Topological fixed points in Boolean networks

... Boolean networks have been applied in many area, especially for modeling gene networks (see, for instance, the work of Kau ffman [4, 5] and Thomas [7, ...the fixed points of F ... Voir le document complet

6

Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory

Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory

... information. In particular, the network coding solvability problem tries to determine whether a certain network situation, with a given set of sources, destinations, and messages, is solvable, ...shown in ... Voir le document complet

23

Fixed points in conjunctive networks and maximal independent sets in graph contractions

Fixed points in conjunctive networks and maximal independent sets in graph contractions

... of fixed points in a conjunctive boolean network with G as interaction ...sets in G and the maximum number of maximal independent sets among all the graphs obtained from G by ... Voir le document complet

29

A fixed point theorem for Boolean networks expressed in terms of forbidden subnetworks

A fixed point theorem for Boolean networks expressed in terms of forbidden subnetworks

... one. Boolean networks have many applications. In particular, from the seminal works of Kauffman (1969) and Thomas (1973), they are extensively used to model gene ...networks. In most ... Voir le document complet

17

Maximum number of fixed points in AND–OR–NOT networks

Maximum number of fixed points in AND–OR–NOT networks

... Boolean networks have applications in many areas, including circuit theory, computer science and social systems ...[4,8,25]. In particular, from the seminal works or Kauffman [13,14] and ... Voir le document complet

30

Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability

Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability

... information. In particular, the network coding solvability problem tries to determine whether a certain network situation, with a given set of sources, destinations, and messages, is solvable, ...shown in ... Voir le document complet

36

From kernels in directed graphs to fixed points and negative cycles in Boolean networks

From kernels in directed graphs to fixed points and negative cycles in Boolean networks

... are Boolean networks such that each component is a conjunction of its (positive or negative) ...[21] in the context of game theory (see also [2, 1]), enter into play. In this article, by ... Voir le document complet

22

Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks

Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks

... x in {0, 1} n , then f has a unique fixed point . In this paper, we generalize Shih-Dong’s theorem using, as main tool, the subnetworks of f , that is, the networks obtained from f by fixing ... Voir le document complet

41

Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks

Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks

... circumference in the lower bound In this section, we prove that if a digraph G has many vertex-disjoint short cycles, then we can construct a monotone Boolean network with interaction graph G and ... Voir le document complet

25

Local negative circuits and fixed points in Boolean networks

Local negative circuits and fixed points in Boolean networks

... one fixed point? As main result, we settle this problem under the additional condition that, for all x ∈ {0, 1} n , the out-degree of each vertex of G F (x) is at most ...words: Boolean network, Interaction ... Voir le document complet

20

Fixing monotone Boolean networks asynchronously

Fixing monotone Boolean networks asynchronously

... interested in networks f which can be fixed in polynomial time, ...interested in families F which can be fixed in polynomial ...given in [15], where it is shown ... Voir le document complet

22

Sequential Reprogramming of Boolean Networks Made Practical

Sequential Reprogramming of Boolean Networks Made Practical

... using Boolean networks [18,7,16], all perturbations are done at once, and the system is left to stabilize itself towards the desired target ...different points in time opens alternative ... Voir le document complet

18

A reduction method for noisy Boolean networks

A reduction method for noisy Boolean networks

... data points lo ated in main probability levels are given in Table 5 for the six samples and the two onditional probabilities α and β ...greater in the omplex regime than in the haoti ... Voir le document complet

49

Isomorphic Boolean networks and dense interaction graphs

Isomorphic Boolean networks and dense interaction graphs

... results in this direction (see [1] for a review). In most cases, the studied dynamical properties are invariant by isomorphism: number of fixed or periodic points, number and size of limit ... Voir le document complet

14

Most Permissive Semantics of Boolean Networks

Most Permissive Semantics of Boolean Networks

... lead to a loss of capability to reach apoptotic attractors. Analysis with MPBNs reports the exact same reachable attractors, thus predicting the same as with fully asynchronous BNs. B.2.2 T-cell differentiation model by ... Voir le document complet

26

Asynchronous simulation of Boolean networks by monotone Boolean networks

Asynchronous simulation of Boolean networks by monotone Boolean networks

... n-component Boolean network without negative loop can be embedded in the asynchronous graph of a 2n-component monotone Boolean network, in such a way that fixed points and ... Voir le document complet

11

Concurrency in Boolean networks

Concurrency in Boolean networks

... gene networks and cellular signalling pathways. In these practi- cal applications, it is usual to assess the accordance of a BN with the concrete modeled system by checking if the observed behaviours are ... Voir le document complet

36

Uncovering operational interactions in genetic networks using asynchronous boolean dynamics

Uncovering operational interactions in genetic networks using asynchronous boolean dynamics

... regulatory networks (microarrays, fluorescence markers, electrophoretic mobility shift assays, ...discrete networks provide a measure of the robustness of a system ...fluctuations in the environment. ... Voir le document complet

33

A Topological Criterion for Filtering Information in Complex Brain Networks

A Topological Criterion for Filtering Information in Complex Brain Networks

... corresponding to the density that maximizes J, converges to k = 3 for large network sizes (n = 16834). (c) Optimal density values maximizing group- averaged J profiles for different brain networks. Imaging ... Voir le document complet

19

Topological relationships between spatio-temporal history of moving points in a primitive space

Topological relationships between spatio-temporal history of moving points in a primitive space

... Geomatics Unit / University of Liège P.Hallot@ulg.ac.be Due to the improvement of data acquisition techniques, we have now to manage a huge amount of spatio-temporal information. To do so, it is necessary to develop ... Voir le document complet

2

Show all 10000 documents...