Influence maximization in Boolean networks.

Area of Science:

• Systems Biology
• Network Science
• Computational Biology

Background:

• Boolean networks model complex biological systems like gene regulation.
• Identifying minimal control sets is vital for targeted interventions.
• Previous methods lacked efficiency for large-scale networks.

Purpose of the Study:

• To develop an efficient method for finding minimal driver sets in Boolean networks.
• To apply this method to gene regulatory networks for identifying therapeutic targets.
• To assess the size of these driver sets in various biological networks.

Main Methods:

• Adapted influence maximization algorithms from social network analysis.
• Validated the approach on small, well-characterized gene regulatory networks using brute-force analysis.
• Systematically applied the method to a large collection of gene regulatory networks.

Main Results:

• The developed method effectively identifies minimal driver sets.
• Validation on small networks confirmed the method's accuracy.
• Analysis of large networks revealed that minimal driver sets comprise less than 20% of nodes in approximately 65% of cases.

Conclusions:

• The proposed method offers an efficient solution for identifying critical nodes in Boolean networks.
• Findings suggest that targeted control of biological pathways may require manipulating a relatively small fraction of key components.
• This approach has significant implications for drug discovery and systems biology research.