Motifs emerge from function in model gene regulatory networks

Abstract

Gene regulatory networks arise in all living cells, allowing the control of gene expression patterns. The study of their topology has revealed that certain subgraphs of interactions or "motifs" appear at anomalously high frequencies. We ask here whether this phenomenon may emerge because of the functions carried out by these networks. Given a framework for describing regulatory interactions and dynamics, we consider in the space of all regulatory networks those that have a prescribed function. Monte Carlo sampling is then used to determine how these functional networks lead to specific motif statistics in the interactions. In the case where the regulatory networks are constrained to exhibit multi-stability, we find a high frequency of gene pairs that are mutually inhibitory and self-activating. In contrast, networks constrained to have periodic gene expression patterns (mimicking for instance the cell cycle) have a high frequency of bifan-like motifs involving four genes with at least one activating and one inhibitory interaction.

10 pages, 5 figures

Cited by in corpus (17)

• Quantifying randomness in real networks
• Evolution of bow-tie architectures in biology
• Emergence of cooperative bistability and robustness of gene regulatory networks
• Mutation Rules and the Evolution of Sparseness and Modularity in Biological Systems
• Evolution enhances mutational robustness and suppresses the emergence of a new phenotype: A new computational approach for studying evolution
• Weighted hypersoft configuration model
• Boolean networks with veto functions
• Edge usage, motifs and regulatory logic for cell cycling genetic networks
• Core regulatory network motif underlies the ocellar complex patterning in Drosophila melanogaster
• Ageing of complex networks
• Stable developmental patterns of gene expression without morphogen gradients
• Stability of pattern formation in systems with dynamic source regions
• Coherent organization in gene regulation: a study on six networks
• Boolean constraint satisfaction problems for reaction networks
• Observement as Universal Measurement
• On the Role of Triadic Substructures in Complex Networks
• Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem