Recursive Self-Composite Approach Toward Structural Understanding of Boolean Networks

Area of Science:

• Systems Biology
• Computational Biology
• Network Science

Background:

• Boolean networks are common for studying biological network dynamics like steady-states and cycles.
• Dynamic properties of network structures themselves have been under-explored.

Purpose of the Study:

• To systematically reveal core network structures in Boolean networks.
• To develop methods for analyzing dynamic properties of network structures.

Main Methods:

• Recursive self-composition of logic update rules to identify cyclic structures.
• Development of leaping and filling algorithms to manage computational complexity during self-composition.
• Analysis of network structures in example biological systems.

Main Results:

• All Boolean update rules exhibit repeated cyclic logic structures.
• Identified 'kernel states' where converged logic leads to consistent states.
• Established an upper bound for state cycle periods based on logic cycle length.
• Leaping and filling algorithms prevent string explosions in self-composition.

Conclusions:

• The study reveals inherent cyclic structures within Boolean networks.
• The proposed algorithms offer an efficient approach to analyze complex biological network dynamics.
• Demonstrated the utility of the methods on real-world biological networks like T-cell receptor and cancer networks.