An efficient approach of attractor calculation for large-scale Boolean gene regulatory networks
From MaRDI portal
Publication:727138
DOI10.1016/j.jtbi.2016.08.006zbMath1352.92061OpenAlexW2512927444WikidataQ50595597 ScholiaQ50595597MaRDI QIDQ727138
Publication date: 6 December 2016
Published in: Journal of Theoretical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jtbi.2016.08.006
Related Items (5)
Robust stability of interactional genetic regulatory networks with reaction-diffusion terms ⋮ Bifurcation and Turing instability for genetic regulatory networks with diffusion ⋮ P\(_-\)UNSAT approach of attractor calculation for Boolean gene regulatory networks ⋮ Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells ⋮ Robust stability of delayed Markovian switching genetic regulatory networks with reaction-diffusion terms
Cites Work
- Effects of alternative connectivity on behavior of randomly constructed Boolean networks
- Reduction of Boolean network models
- The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in \textit{Drosophila melanogaster}
- A survey of kernel and spectral methods for clustering
- Improving the efficiency of attractor cycle identification in Boolean networks
- Dimension reduction of large sparse AND-NOT network models
- An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks
- Dynamical modeling and analysis of large cellular regulatory networks
- A Reduction Method for Boolean Network Models Proven to Conserve Attractors
- Aggregation Algorithm Towards Large-Scale Boolean Network Analysis
This page was built for publication: An efficient approach of attractor calculation for large-scale Boolean gene regulatory networks
