Evolution of Boolean networks under selection for a robust response to external inputs yields an extensive neutral...

Area of Science:

• Computational Biology
• Systems Biology
• Evolutionary Computation

Background:

• Boolean networks are simplified models of gene regulatory networks.
• Understanding how these networks evolve robustness and responsiveness is key to deciphering biological complexity.

Purpose of the Study:

• To investigate the evolution of Boolean networks under selection for both robustness and input responsiveness.
• To analyze the impact of different update functions (canalizing vs. threshold) on evolutionary dynamics.
• To characterize the fitness landscapes of these evolving networks.

Main Methods:

• Simulations of Boolean network evolution with mutations affecting network structure and update functions.
• Selection criteria included simultaneous optimization for robust attractors and input-induced attractor switching.
• Comparison of fitness landscapes using canalizing and threshold update functions.

Main Results:

• A plateau with maximum fitness was observed across all studied conditions, indicating multiple network genotypes can perform the same function.
• Structurally different networks capable of the same task are connected by neutral evolutionary paths.
• A correlation was found between attractor length and mutational robustness.
• An exceptionally long memory of the initial evolutionary stages was detected.

Conclusions:

• The evolution of Boolean networks exhibits significant neutrality, allowing diverse structures to converge on similar functional outcomes.
• The choice of update functions influences the properties of the fitness landscape and evolutionary trajectories.
• Boolean network evolution demonstrates a trade-off between attractor length and mutational robustness, with implications for understanding biological system stability and adaptation.