Results 21 to 30 of about 4,684,489 (303)
A parallel attractor-finding algorithm based on Boolean satisfiability for genetic regulatory networks. [PDF]
In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network.
Wensheng Guo +4 more
doaj +1 more source
An Evaluation of Methods for Inferring Boolean Networks from Time-Series Data. [PDF]
Regulatory networks play a central role in cellular behavior and decision making. Learning these regulatory networks is a major task in biology, and devising computational methods and mathematical models for this task is a major endeavor in ...
Natalie Berestovsky, Luay Nakhleh
doaj +1 more source
Review and assessment of Boolean approaches for inference of gene regulatory networks
Boolean descriptions of gene regulatory networks can provide an insight into interactions between genes. Boolean networks hold predictive power, are easy to understand, and can be used to simulate the observed networks in different scenarios.We review ...
Žiga Pušnik +3 more
doaj +1 more source
Boolean Networks as Modeling Framework [PDF]
In a network, the components of a given system are represented as nodes, the interactions are abstracted as links between the nodes. Boolean networks refer to a class of dynamics on networks, in fact it is the simplest possible dynamics where each node has a value 0 or 1.
Florian eGreil, Florian eGreil
openaire +4 more sources
On Identification of Boolean Control Networks
A new analytical framework consisting of two phenomena, a single sample and multiple samples, is proposed to formulate the identification problem of Boolean control networks (BCNs) systematically and comprehensively. Under this framework, the existing works on identification can be categorized as special cases of these two phenomena.
Biao Wang 0003 +2 more
openaire +5 more sources
Synchronizing Boolean Networks Asynchronously
The asynchronous automaton associated with a Boolean network f:{0,1}n->{0,1}n is the finite deterministic automaton where the set of states is {0,1}n, the alphabet is [n] and the action of letter i on a state x consists in switching the i-th component if fi(x)=xi+1 or doing nothing otherwise.
Julio Aracena +2 more
openaire +4 more sources
Boolean network model predicts knockout mutant phenotypes of fission yeast. [PDF]
Boolean networks (ornetworks of switches) are extremely simple mathematical models of biochemical signaling networks. Under certain circumstances, Boolean networks, despite their simplicity, are capable of predicting dynamical activation patterns of gene
Maria I Davidich, Stefan Bornholdt
doaj +1 more source
Evolving sensitivity balances Boolean networks [PDF]
We investigate the sensitivity of Boolean Networks (BNs) to mutations. We are interested in Boolean Networks as a model of Gene Regulatory Networks (GRNs). We adopt Ribeiro and Kauffman’s Ergodic Set and use it to study the long term dynamics of a BN. We
Turner, Matthew S. +9 more
core +2 more sources
Boolean random networks: phase transition and connectivity [PDF]
openIn this thesis I introduce some random network models, with a particular focus on boolean random networks. After having provided the necessary theoretical background, several results related to two topics concerning boolean networks are discussed ...
SPISSO, GIOVANNI
core
Background Gene regulatory networks govern the function of key cellular processes, such as control of the cell cycle, response to stress, DNA repair mechanisms, and more.
Levi D. Mcclenny +2 more
doaj +1 more source

