Algorithms for analysis and control of Boolean networks
From MaRDI portal
Publication:1660104
DOI10.1007/978-3-319-91938-6_1zbMATH Open1392.92026OpenAlexW2804890714MaRDI QIDQ1660104FDOQ1660104
Authors: Tatsuya Akutsu
Publication date: 15 August 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-91938-6_1
Recommendations
- Algorithms for Inference, Analysis and Control of Boolean Networks
- Algorithms for analysis, inference, and control of Boolean networks
- Singleton and 2-periodic attractors of sign-definite Boolean networks
- An O(1.787 n )-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
- An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
Cited In (19)
- Optimal control algorithms for switched Boolean network
- On spectral techniques in analysis of Boolean networks
- Attractors in Boolean networks: a tutorial
- Control Flow Analysis of Generalised Boolean Networks
- An O(1.787 n )-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
- Towards the existential control of Boolean networks: a preliminary report
- An efficient approach of attractor calculation for large-scale Boolean gene regulatory networks
- P\(_-\)UNSAT approach of attractor calculation for Boolean gene regulatory networks
- Impulse Control: Boolean Programming and Numerical Algorithms
- Title not available (Why is that?)
- SAT-based algorithm for finding cycles in a Boolean network
- Discrimination of attractors with noisy nodes in Boolean networks
- Control of Boolean networks: hardness results and algorithms for tree structured networks
- Singleton and 2-periodic attractors of sign-definite Boolean networks
- Algorithms for Inference, Analysis and Control of Boolean Networks
- Algorithms for analysis, inference, and control of Boolean networks
- An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
- Algorithms for singleton attractor detection in planar and nonplanar AND/OR Boolean networks
- On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors
This page was built for publication: Algorithms for analysis and control of Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1660104)