P\(_-\)UNSAT approach of attractor calculation for Boolean gene regulatory networks
From MaRDI portal
Publication:1642530
DOI10.1016/j.jtbi.2018.03.037zbMath1397.92250OpenAlexW2794960257WikidataQ88235662 ScholiaQ88235662MaRDI QIDQ1642530
Publication date: 15 June 2018
Published in: Journal of Theoretical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jtbi.2018.03.037
Related Items (2)
Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells ⋮ Topological Equivalence Classification of Balanced Linearly Separable Boolean Functions on n-Dimensional Hypercube
Cites Work
- Unnamed Item
- An efficient approach of attractor calculation for large-scale Boolean gene regulatory networks
- 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
- 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
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
This page was built for publication: P\(_-\)UNSAT approach of attractor calculation for Boolean gene regulatory networks