An algebra-based method for inferring gene regulatory networks.

Area of Science:

• Systems Biology
• Computational Biology
• Bioinformatics

Background:

• Gene regulatory network (GRN) inference is crucial for systems biology, encompassing both network topology and dynamics.
• Existing methods often focus on topology, with less emphasis on inferring network dynamics.
• The underdetermined nature of network inference necessitates incorporating prior knowledge and effective search spaces for dynamic models, while considering data noise.

Purpose of the Study:

• To develop a novel inference algorithm for gene regulatory network (GRN) dynamics.
• To address the need for methods that infer network dynamics, incorporate prior biological knowledge, and are robust to noise.
• To provide an effective description of the search space for dynamic models in GRN inference.

Main Methods:

• Utilizes an algebraic framework of Boolean polynomial dynamical systems (BPDS) for network inference.
• Employs an evolutionary algorithm for local optimization, encoding mathematical models as BPDS.
• Accepts time-series data, including perturbations like knock-out mutants and RNAi experiments.

Main Results:

• The algorithm successfully infers GRN dynamics and topology from simulated and experimental data.
• Demonstrates robustness to significant noise levels in the input data.
• Benchmarking shows high precision and recall in network reconstruction, outperforming other state-of-the-art methods.

Conclusions:

• Boolean polynomial dynamical systems offer a powerful framework for reverse engineering GRNs.
• The BPDS framework provides a rich mathematical structure for the model search space, enhancing computational performance.
• A C++ implementation of the inference method is publicly available with source code.