Design of Probabilistic Boolean Networks Based on Network Structure and Steady-State Probabilities

Area of Science:

• Systems Biology
• Synthetic Biology
• Computational Biology

Background:

• Probabilistic Boolean networks (PBNs) are crucial for modeling complex biological systems.
• Determining PBNs from network structure and steady-state properties is a challenging inverse problem.
• Existing methods for Boolean networks (BNs) do not fully address the probabilistic aspects.

Purpose of the Study:

• To propose a novel solution method for finding PBNs based on network structure and desired steady-state properties.
• To address the inverse problem of PBN construction in systems and synthetic biology.
• To provide a computationally tractable approach for PBN inference.

Main Methods:

• A matrix-based representation for PBNs is utilized.
• The method calculates Boolean functions, probabilities of function selection, and candidate function counts.
• The approach is designed to handle the increased complexity compared to standard Boolean networks.

Main Results:

• A new method for solving the PBN inverse problem is presented.
• Numerical examples demonstrate the effectiveness of the proposed solution.
• The method successfully infers PBNs with specified steady-state behaviors.

Conclusions:

• The proposed matrix-based method offers an effective solution for inferring PBNs.
• This work advances the capability to model biological networks with probabilistic dynamics.
• The findings have implications for the design and analysis of synthetic biological systems.