Neutral forces acting on intragenomic variability shape the Escherichia coli regulatory network topology

Differences in evolutionary accessibility determine which equally effective regulatory motif evolves to generate pulses

Transcriptional regulatory networks (TRNs) are enriched for certain "motifs." Motif usage is commonly interpreted in adaptationist terms, i.e., that the optimal motif evolves. But certain motifs can also evolve more easily than others. Here, we computationally evolved TRNs to produce a pulse of an effector protein. Two well-known motifs, type 1 incoherent feed-forward loops (I1FFLs) and negative feedback loops (NFBLs), evolved as the primary solutions. The relative rates at which these two motifs evolve depend on selection conditions, but under all conditions, either motif achieves similar performance. I1FFLs generally evolve more often than NFBLs. Selection for a tall pulse favors NFBLs, while selection for a fast response favors I1FFLs. I1FFLs are more evolutionarily accessible early on, before the effector protein evolves high expression; when NFBLs subsequently evolve, they tend to do so from a conjugated I1FFL-NFBL genotype. In the empirical S. cerevisiae TRN, output genes of NFBLs had higher expression levels than those of I1FFLs. These results suggest that evolutionary accessibility, and not relative functionality, shapes which motifs evolve in TRNs, and does so as a function of the expression levels of particular genes.

On the specificity of gene regulatory networks: How does network co-option affect subsequent evolution?

The process of multicellular organismal development hinges upon the specificity of developmental programs: for different parts of the organism to form unique features, processes must exist to specify each part. This specificity is thought to be hardwired into gene regulatory networks, which activate cohorts of genes in particular tissues at particular times during development. However, the evolution of gene regulatory networks sometimes occurs by mechanisms that sacrifice specificity. One such mechanism is network co-option, in which existing gene networks are redeployed in new developmental contexts. While network co-option may offer an efficient mechanism for generating novel phenotypes, losses of tissue specificity at redeployed network genes could restrict the ability of the affected traits to evolve independently. At present, there has not been a detailed discussion regarding how tissue specificity of network genes might be altered due to gene network co-option at its initiation, as well as how trait independence can be retained or restored after network co-option. A lack of clarity about network co-option makes it more difficult to speculate on the long-term evolutionary implications of this mechanism. In this review, we will discuss the possible initial outcomes of network co-option, outline the mechanisms by which networks may retain or subsequently regain specificity after network co-option, and comment on some of the possible evolutionary consequences of network co-option. We place special emphasis on the need to consider selectively-neutral outcomes of network co-option to improve our understanding of the role of this mechanism in trait evolution.

Feed-forward regulation adaptively evolves via dynamics rather than topology when there is intrinsic noise

In transcriptional regulatory networks (TRNs), a canonical 3-node feed-forward loop (FFL) is hypothesized to evolve to filter out short spurious signals. We test this adaptive hypothesis against a novel null evolutionary model. Our mutational model captures the intrinsically high prevalence of weak affinity transcription factor binding sites. We also capture stochasticity and delays in gene expression that distort external signals and intrinsically generate noise. Functional FFLs evolve readily under selection for the hypothesized function but not in negative controls. Interestingly, a 4-node “diamond” motif also emerges as a short spurious signal filter. The diamond uses expression dynamics rather than path length to provide fast and slow pathways. When there is no idealized external spurious signal to filter out, but only internally generated noise, only the diamond and not the FFL evolves. While our results support the adaptive hypothesis, we also show that non-adaptive factors, including the intrinsic expression dynamics, matter.

Feed‐forward loops (FFLs) can filter out noise, but whether their overrepresentation in GRNs reflects adaptive evolution for this function is debated. Here, the authors develop a null model of regulatory evolution and find that FFLs evolve readily under selection for the noise filtering function.

Making sense of transcription networks

When transcription regulatory networks are compared among distantly related eukaryotes, a number of striking similarities are observed: a larger-than-expected number of genes, extensive overlapping connections, and an apparently high degree of functional redundancy. It is often assumed that the complexity of these networks represents optimized solutions, precisely sculpted by natural selection; their common features are often asserted to be adaptive. Here, we discuss support for an alternative hypothesis: the common structural features of transcription networks arise from evolutionary trajectories of "least resistance"--that is, the relative ease with which certain types of network structures are formed during their evolution.

The influence of promoter architectures and regulatory motifs on gene expression in Escherichia coli

The ability to regulate gene expression is of central importance for the adaptability of living organisms to changes in their external and internal environment. At the transcriptional level, binding of transcription factors (TFs) in the promoter region can modulate the transcription rate, hence making TFs central players in gene regulation. For some model organisms, information about the locations and identities of discovered TF binding sites have been collected in continually updated databases, such as RegulonDB for the well-studied case of E. coli. In order to reveal the general principles behind the binding-site arrangement and function of these regulatory architectures we propose a random promoter architecture model that preserves the overall abundance of binding sites to identify overrepresented binding site configurations. This model is analogous to the random network model used in the study of genetic network motifs, where regulatory motifs are identified through their overrepresentation with respect to a “randomly connected” genetic network. Using our model we identify TF pairs which coregulate operons in an overrepresented fashion, or individual TFs which act at multiple binding sites per promoter by, for example, cooperative binding, DNA looping, or through multiple binding domains. We furthermore explore the relationship between promoter architecture and gene expression, using three different genome-wide protein copy number censuses. Perhaps surprisingly, we find no systematic correlation between the number of activator and repressor binding sites regulating a gene and the level of gene expression. A position-weight-matrix model used to estimate the binding affinity of RNA polymerase (RNAP) to the promoters of activated and repressed genes suggests that this lack of correlation might in part be due to differences in basal transcription levels, with repressed genes having a higher basal activity level. This quantitative catalogue relating promoter architecture and function provides a first step towards genome-wide predictive models of regulatory function.

Evolution after whole-genome duplication: a network perspective

Gene duplication plays an important role in the evolution of genomes and interactomes. Elucidating how evolution after gene duplication interplays at the sequence and network level is of great interest. In this work, we analyze a data set of gene pairs that arose through whole-genome duplication (WGD) in yeast. All these pairs have the same duplication time, making them ideal for evolutionary investigation. We investigated the interplay between evolution after WGD at the sequence and network levels and correlated these two levels of divergence with gene expression and fitness data. We find that molecular interactions involving WGD genes evolve at rates that are three orders of magnitude slower than the rates of evolution of the corresponding sequences. Furthermore, we find that divergence of WGD pairs correlates strongly with gene expression and fitness data. Because of the role of gene duplication in determining redundancy in biological systems and particularly at the network level, we investigated the role of interaction networks in elucidating the evolutionary fate of duplicated genes. We find that gene neighborhoods in interaction networks provide a mechanism for inferring these fates, and we developed an algorithm for achieving this task. Further epistasis analysis of WGD pairs categorized by their inferred evolutionary fates demonstrated the utility of these techniques. Finally, we find that WGD pairs and other pairs of paralogous genes of small-scale duplication origin share similar properties, giving good support for generalizing our results from WGD pairs to evolution after gene duplication in general.

Boosting forward-time population genetic simulators through genotype compression

BACKGROUND

Forward-time population genetic simulations play a central role in deriving and testing evolutionary hypotheses. Such simulations may be data-intensive, depending on the settings to the various parameters controlling them. In particular, for certain settings, the data footprint may quickly exceed the memory of a single compute node.

RESULTS

We develop a novel and general method for addressing the memory issue inherent in forward-time simulations by compressing and decompressing, in real-time, active and ancestral genotypes, while carefully accounting for the time overhead. We propose a general graph data structure for compressing the genotype space explored during a simulation run, along with efficient algorithms for constructing and updating compressed genotypes which support both mutation and recombination. We tested the performance of our method in very large-scale simulations. Results show that our method not only scales well, but that it also overcomes memory issues that would cripple existing tools.

CONCLUSIONS

As evolutionary analyses are being increasingly performed on genomes, pathways, and networks, particularly in the era of systems biology, scaling population genetic simulators to handle large-scale simulations is crucial. We believe our method offers a significant step in that direction. Further, the techniques we provide are generic and can be integrated with existing population genetic simulators to boost their performance in terms of memory usage.