Results 31 to 40 of about 6,955,412 (269)

On Identification of Boolean Control Networks

open access: yesSIAM Journal on Control and Optimization, 2022
A new analytical framework consisting of two phenomena: single sample and multiple samples, is proposed to deal with 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   +3 more sources

Modular Random Boolean Networks [PDF]

open access: yesArtificial Life, 2011
Random Boolean networks (RBNs) have been a popular model of genetic regulatory networks for more than four decades. However, most RBN studies have been made with random topologies, while real regulatory networks have been found to be modular. In this work, we extend classical RBNs to define modular RBNs.
Rodrigo Poblanno-Balp, Carlos Gershenson
openaire   +4 more sources

On Fundamental Bounds on Failure Identifiability by Boolean Network Tomography

open access: yesIEEE/ACM Transactions on Networking, 2020
Boolean network tomography is a powerful tool to infer the state (working/failed) of individual nodes from path-level measurements obtained by edge-nodes.
N. Bartolini   +5 more
semanticscholar   +1 more source

Systematic review of brucellosis in the Middle East: disease frequency in ruminants and humans and risk factors for human infection [PDF]

open access: yes, 2007
This paper considers the problem of finding global states incoming to a specified global state in a Boolean network, which may be useful for pre-processing of finding a sequence of control actions for a Boolean network and for identifying the basin of ...
Abo-Shehada, M N   +4 more
core   +2 more sources

Synchronizing Boolean Networks Asynchronously

open access: yesSSRN Electronic Journal, 2022
The {\em asynchronous automaton} associated with a Boolean network $f:\{0,1\}^n\to\{0,1\}^n$, considered in many applications, 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 either switching the $i$th component if $f_i(x)\neq x_i$ or doing ...
Julio Aracena   +2 more
openaire   +3 more sources

BoolFilter: an R package for estimation and identification of partially-observed Boolean dynamical systems

open access: yesBMC Bioinformatics, 2017
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

On the Lyapunov Exponent of Monotone Boolean Networks

open access: yesMathematics, 2020
Boolean networks are discrete dynamical systems comprised of coupled Boolean functions. An important parameter that characterizes such systems is the Lyapunov exponent, which measures the state stability of the system to small perturbations.
Ilya Shmulevich
doaj   +1 more source

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

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
We are interested in fixed points in Boolean networks, $\textit{i.e.}$ functions $f$ from $\{0,1\}^n$ to itself. We define the subnetworks of $f$ as the restrictions of $f$ to the hypercubes contained in $\{0,1\}^n$, and we exhibit a class $\mathcal{F ...
Adrien Richard
doaj   +1 more source

Boolean Network Modeling in Systems Pharmacology

open access: yesJournal of Pharmacokinetics and Pharmacodynamics, 2018
Quantitative systems pharmacology (QSP) is an emerging discipline that aims to discover how drugs modulate the dynamics of biological components in molecular and cellular networks and the impact of those perturbations on human pathophysiology.
P. Bloomingdale   +3 more
semanticscholar   +1 more source

On Fixable Families of Boolean Networks [PDF]

open access: yes, 2018
The asynchronous dynamics associated with a Boolean network $f : \{0,1\}^n \to \{0,1\}^n$ is a finite deterministic automaton considered in many applications. The set of states is $\{0,1\}^n$, the alphabet is $[n]$, and the action of letter $i$ on a state $x$ consists in either switching the $i$th component if $f_i(x)\neq x_i$ or doing nothing ...
Maximilien Gadouleau, Adrien Richard
openaire   +2 more sources

Home - About - Disclaimer - Privacy