Solvability and Normalization of General Singular Boolean Networks via Admissible and Normal Initial State Sets

Area of Science:

• Computational Biology
• Systems Biology
• Network Science

Background:

• Singular Boolean networks (SBNs) are crucial for modeling complex biological systems.
• Existing methods for SBN analysis often impose restrictive conditions.
• Understanding solvability and normalization is key to SBN applications.

Purpose of the Study:

• To develop a novel perspective on SBN solvability and normalization using admissible and normal initial state sets.
• To remove restrictive conditions present in existing literature for SBN analysis.
• To provide analytical methods for computing initial state sets and establishing normalization conditions.

Main Methods:

• Construction of the SBN state transition matrix using a new operator.
• Introduction and definition of admissible and normal initial state sets for SBNs.
• Conversion of solvability and uniqueness problems into computations of these initial state sets.

Main Results:

• Analytical formulas derived for computing admissible and normal initial state sets.
• Solvability and uniqueness problems are addressed by computing these sets.
• A novel necessary and sufficient condition for SBN normalization is established, removing prior limitations.

Conclusions:

• The proposed approach offers a more general framework for SBN analysis.
• The new methods simplify the study of solvability and normalization in SBNs.
• This work advances the theoretical understanding and practical application of SBNs.