Logical reduction of biological networks to their most determinative components
From MaRDI portal
Publication:517994
DOI10.1007/s11538-016-0193-xzbMath1361.92029OpenAlexW2465989476WikidataQ41438545 ScholiaQ41438545MaRDI QIDQ517994
Mihaela T. Matache, Valentin Matache
Publication date: 28 March 2017
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc4993808
sensitivitymutual informationnetwork reductionnumerical simulationslinear operatorsBoolean networksbiological information theory
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Entropy analysis of Boolean network reduction according to the determinative power of nodes ⋮ The number of fixed points of AND-OR networks with chain topology
Uses Software
Cites Work
- Unnamed Item
- Identification of all steady states in large networks by logical analysis
- Deconstruction and dynamical robustness of regulatory networks: application to the yeast cell cycle networks
- Dynamics of influenza virus and human host interactions during infection and replication cycle
- Nested canalyzing depth and network stability
- Evolution of a population of random Boolean networks
- Reduction of Boolean network models
- Dynamical phase transition in a neural network model with noise: An exact solution
- Measures of statistical complexity: why?
- The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in \textit{Drosophila melanogaster}
- Dimension reduction of large sparse AND-NOT network models
- A Reduction Method for Boolean Network Models Proven to Conserve Attractors
- Canalizing Boolean Functions Maximize Mutual Information
- Elements of Information Theory
This page was built for publication: Logical reduction of biological networks to their most determinative components
