Zobrazeno 1 - 10
of 61
pro vyhledávání: '"Paulevé, Loic"'
A crucial question in analyzing a concurrent system is to determine its long-run behaviour, and in particular, whether there are irreversible choices in its evolution, leading into parts of the reachability space from which there is no return to othe
Externí odkaz:
http://arxiv.org/abs/2409.01079
Autor:
Tonello, Elisa, Paulevé, Loïc
We investigate how elimination of variables can affect the asymptotic dynamics and phenotype control of Boolean networks. In particular, we look at the impact on minimal trap spaces, and identify a structural condition that guarantees their preservat
Externí odkaz:
http://arxiv.org/abs/2406.02304
Boolean networks are extensively applied as models of complex dynamical systems, aiming at capturing essential features related to causality and synchronicity of the state changes of components along time. Dynamics of Boolean networks result from the
Externí odkaz:
http://arxiv.org/abs/2404.03553
The tool mpbn offers a Python programming interface for an easy interactive editing of Boolean networks and the efficient computation of elementary properties of their dynamics, including fixed points, trap spaces, and reachability properties under t
Externí odkaz:
http://arxiv.org/abs/2403.06255
Minimal trap spaces (MTSs) capture subspaces in which the Boolean dynamics is trapped, whatever the update mode. They correspond to the attractors of the most permissive mode. Due to their versatility, the computation of MTSs has recently gained trac
Externí odkaz:
http://arxiv.org/abs/2305.02442
Autor:
Tonello, Elisa, Paulevé, Loïc
Publikováno v:
CMSB 2023: Computational Methods in Systems Biology, pp. 202-219. Springer Nature
Identification of attractors, that is, stable states and sustained oscillations, is an important step in the analysis of Boolean models and exploration of potential variants. We describe an approach to the search for asynchronous cyclic attractors of
Externí odkaz:
http://arxiv.org/abs/2305.01327
Publikováno v:
SIAM Journal on Discrete Mathematics, Vol. 38, Iss. 4 (2024)
A Boolean network (BN) is a discrete dynamical system defined by a Boolean function that maps to the domain itself. A trap space of a BN is a generalization of a fixed point, which is defined as the sub-hypercubes closed by the function of the BN. A
Externí odkaz:
http://arxiv.org/abs/2212.12756
Publikováno v:
EPTCS 370, 2022, pp. 178-193
A crucial question in analyzing a concurrent system is to determine its long-run behaviour, and in particular, whether there are irreversible choices in its evolution, leading into parts of the reachability space from which there is no return to othe
Externí odkaz:
http://arxiv.org/abs/2209.10323
Autor:
Paulevé, Loïc
Publikováno v:
Peer Community Journal, 2023
Boolean networks (BNs) are discrete dynamical systems with applications to the modeling of cellular behaviors. In this paper, we demonstrate how the software BoNesis can be employed to exhaustively identify combinations of perturbations which enforce
Externí odkaz:
http://arxiv.org/abs/2207.13307
Autor:
Roncalli, Théo, Paulevé, Loïc
In systems biology, Boolean networks (BNs) aim at modeling the qualitative dynamics of quantitative biological systems. Contrary to their (a)synchronous interpretations, the Most Permissive (MP) interpretation guarantees capturing all the trajectorie
Externí odkaz:
http://arxiv.org/abs/2206.12729