A novel constrained genetic algorithm-based Boolean network inference method from steady-state gene expression data.

Area of Science:

• Systems Biology
• Computational Biology
• Bioinformatics

Background:

• Inferring gene regulatory network (GRN) structure and dynamics from steady-state gene expression data is a significant challenge.
• Existing methods using Boolean or differential equation models are often inefficient for large-scale networks.

Purpose of the Study:

• To develop an accurate and efficient method for inferring large-scale GRN structure and dynamics using steady-state gene expression data.
• Introduce the constrained genetic algorithm-based Boolean network inference (CGA-BNI) method.

Main Methods:

• The CGA-BNI method employs a Boolean canalyzing update rule scheme for coarse-grained dynamics.
• It identifies path consistency-based constraints using wild-type and mutant expression data.
• A heuristic mutation operation and parallel evaluation are used for efficiency.

Main Results:

• CGA-BNI accurately predicts both the structure and dynamics of GRNs.
• The method demonstrated superior performance compared to four existing approaches in simulations.
• It successfully identified networks with attractors closely matching steady-state expressions.

Conclusions:

• CGA-BNI is a promising tool for accurate GRN inference, particularly when high precision is required.
• The method provides a robust approach for analyzing complex gene regulatory systems.
• Source code and data are publicly available for reproducibility.