Analysis and characterization of asynchronous state transition graphs using extremal states.

Area of Science:

• Systems Biology
• Computational Biology
• Network Science

Background:

• Biological regulatory networks are modeled as state transition graphs.
• Analyzing these graphs provides system insights but is computationally expensive due to exponential size.
• Efficient analysis methods are crucial for understanding large biological networks.

Purpose of the Study:

• To develop a method for describing asynchronous state transition graphs of Thomas networks using only extremal states.
• To compare dynamical properties between multivalued and Boolean networks.
• To advance network reduction and model refinement techniques.

Main Methods:

• Analysis of subgraphs induced by extremal states.
• Comparison of asynchronous state transition graphs for multivalued and Boolean networks.
• Investigation of dynamical property conservation between different model granularities.

Main Results:

• A complete description of an asynchronous state transition graph can be achieved by analyzing a subgraph of extremal states.
• The study provides insights into the relationship between multivalued and Boolean network dynamics.
• The proposed method facilitates understanding dynamical property conservation.

Conclusions:

• Extremal state analysis offers a powerful reduction technique for biological network models.
• Comparing different model granularities is essential for effective network reduction and refinement.
• This work contributes to more efficient and meaningful analysis of biological regulatory networks.