Semi-tensor product based long-run behavior estimation of generalized asynchronous Boolean networks with time delays

Area of Science:

• Systems Biology
• Computational Biology
• Network Dynamics

Background:

• Boolean networks are models for gene regulatory networks.
• Time delays and asynchronous updates are crucial for biological realism.
• Understanding long-term behavior (attractors and basins) is key to predicting system stability and function.

Purpose of the Study:

• To develop methods for estimating the long-run behavior of generalized asynchronous Boolean networks with time delays.
• To characterize the evolutionary trends of attractors and their basins in such networks.
• To provide necessary and sufficient conditions for identifying delayed fixed points and limit cycles.

Main Methods:

• Remapping the network dynamics into an equivalent augmented system using algebraic state-space representation.
• Constructing a transition table for the augmented system.
• Defining and identifying delayed fixed points and delayed limit cycles based on the augmented system and transition table.
• Analyzing state transition diagrams and basin overlaps.

Main Results:

• Established necessary and sufficient conditions for the existence of delayed fixed points and delayed limit cycles.
• Developed methods for finding basins of attraction for these delayed states.
• Provided conditions for eliminating overlap between different basins.
• Demonstrated the approach using a model of the lac operon in E. coli.

Conclusions:

• The proposed algebraic state-space approach effectively characterizes the long-run behavior of asynchronous Boolean networks with time delays.
• The findings offer a robust framework for analyzing complex biological regulatory systems.
• The method provides insights into attractor dynamics and basin structures crucial for understanding system robustness and evolutionary trends.