Polynomial-Time Algorithm for Controllability Test of Boolean Biological Networks
Author Information
Author(s): Koichi Kobayashi, Jun-Ichi Imura, Kunihiko Hiraishi
Primary Institution: Japan Advanced Institute of Science and Technology
Hypothesis
Can a polynomial-time algorithm be developed to determine the controllability of Boolean biological networks?
Conclusion
The proposed polynomial-time algorithm effectively determines the controllability of large-scale Boolean biological networks.
Supporting Evidence
- The algorithm is applicable to Boolean networks with at least 1000 nodes.
- Numerical experiments demonstrate the efficiency of the proposed method.
- The method can be applied to a neurotransmitter signaling pathway model.
Takeaway
This study created a new method to check if we can control certain biological processes using simpler calculations, making it easier to analyze complex networks.
Methodology
The study proposes a polynomial-time algorithm based on an adjacency matrix of a directed graph induced by a Boolean network.
Limitations
The algorithm cannot determine controllability in cases with identical equations or certain complex structures.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website