Artefacts in statistical analyses of network motifs: general framework and application to metabolic networks

Exploring Emergent Properties in Enzymatic Reaction Networks: Design and Control of Dynamic Functional Systems

The intricate and complex features of enzymatic reaction networks (ERNs) play a key role in the emergence and sustenance of life. Constructing such networks in vitro enables stepwise build up in complexity and introduces the opportunity to control enzymatic activity using physicochemical stimuli. Rational design and modulation of network motifs enable the engineering of artificial systems with emergent functionalities. Such functional systems are useful for a variety of reasons such as creating new-to-nature dynamic materials, producing value-added chemicals, constructing metabolic modules for synthetic cells, and even enabling molecular computation. In this review, we offer insights into the chemical characteristics of ERNs while also delving into their potential applications and associated challenges.

Local topological features of robust supply networks

The design of robust supply and distribution systems is one of the fundamental challenges at the interface of network science and logistics. Given the multitude of performance criteria, real-world constraints, and external influences acting upon such a system, even formulating an appropriate research question to address this topic is non-trivial. Here we present an abstraction of a supply and distribution system leading to a minimal model, which only retains stylized facts of the systemic function and, in this way, allows us to investigate the generic properties of robust supply networks. On this level of abstraction, a supply and distribution system is the strategic use of transportation to eliminate mismatches between production patterns (i.e., the amounts of goods produced at each production site of a company) and demand patterns (i.e., the amount of goods consumed at each location). When creating networks based on this paradigm and furthermore requiring the robustness of the system with respect to the loss of transportation routes (edge of the network) we see that robust networks are built from specific sets of subgraphs, while vulnerable networks display a markedly different subgraph composition. Our findings confirm a long-standing hypothesis in the field of network science, namely, that network motifs-statistically over-represented small subgraphs-are informative about the robust functioning of a network. Also, our findings offer a blueprint for enhancing the robustness of real-world supply and distribution systems.

SUPPLEMENTARY INFORMATION

The online version contains supplementary material available at 10.1007/s41109-022-00470-2.

The economy of chromosomal distances in bacterial gene regulation

In the transcriptional regulatory network (TRN) of a bacterium, the nodes are genes and a directed edge represents the action of a transcription factor (TF), encoded by the source gene, on the target gene. It is a condensed representation of a large number of biological observations and facts. Nonrandom features of the network are structural evidence of requirements for a reliable systemic function. For the bacterium Escherichia coli we here investigate the (Euclidean) distances covered by the edges in the TRN when its nodes are embedded in the real space of the circular chromosome. Our work is motivated by 'wiring economy' research in Computational Neuroscience and starts from two contradictory hypotheses: (1) TFs are predominantly employed for long-distance regulation, while local regulation is exerted by chromosomal structure, locally coordinated by the action of structural proteins. Hence long distances should often occur. (2) A large distance between the regulator gene and its target requires a higher expression level of the regulator gene due to longer reaching times and ensuing increased degradation (proteolysis) of the TF and hence will be evolutionarily reduced. Our analysis supports the latter hypothesis.

Testing biological network motif significance with exponential random graph models

Analysis of the structure of biological networks often uses statistical tests to establish the over-representation of motifs, which are thought to be important building blocks of such networks, related to their biological functions. However, there is disagreement as to the statistical significance of these motifs, and there are potential problems with standard methods for estimating this significance. Exponential random graph models (ERGMs) are a class of statistical model that can overcome some of the shortcomings of commonly used methods for testing the statistical significance of motifs. ERGMs were first introduced into the bioinformatics literature over 10 years ago but have had limited application to biological networks, possibly due to the practical difficulty of estimating model parameters. Advances in estimation algorithms now afford analysis of much larger networks in practical time. We illustrate the application of ERGM to both an undirected protein-protein interaction (PPI) network and directed gene regulatory networks. ERGM models indicate over-representation of triangles in the PPI network, and confirm results from previous research as to over-representation of transitive triangles (feed-forward loop) in an E. coli and a yeast regulatory network. We also confirm, using ERGMs, previous research showing that under-representation of the cyclic triangle (feedback loop) can be explained as a consequence of other topological features.

SUPPLEMENTARY INFORMATION

The online version contains supplementary material available at 10.1007/s41109-021-00434-y.

Two classes of functional connectivity in dynamical processes in networks

The relationship between network structure and dynamics is one of the most extensively investigated problems in the theory of complex systems of recent years. Understanding this relationship is of relevance to a range of disciplines-from neuroscience to geomorphology. A major strategy of investigating this relationship is the quantitative comparison of a representation of network architecture (structural connectivity, SC) with a (network) representation of the dynamics (functional connectivity, FC). Here, we show that one can distinguish two classes of functional connectivity-one based on simultaneous activity (co-activity) of nodes, the other based on sequential activity of nodes. We delineate these two classes in different categories of dynamical processes-excitations, regular and chaotic oscillators-and provide examples for SC/FC correlations of both classes in each of these models. We expand the theoretical view of the SC/FC relationships, with conceptual instances of the SC and the two classes of FC for various application scenarios in geomorphology, ecology, systems biology, neuroscience and socio-ecological systems. Seeing the organisation of dynamical processes in a network either as governed by co-activity or by sequential activity allows us to bring some order in the myriad of observations relating structure and function of complex networks.

Opportunities at the Interface of Network Science and Metabolic Modeling

Metabolism plays a central role in cell physiology because it provides the molecular machinery for growth. At the genome-scale, metabolism is made up of thousands of reactions interacting with one another. Untangling this complexity is key to understand how cells respond to genetic, environmental, or therapeutic perturbations. Here we discuss the roles of two complementary strategies for the analysis of genome-scale metabolic models: Flux Balance Analysis (FBA) and network science. While FBA estimates metabolic flux on the basis of an optimization principle, network approaches reveal emergent properties of the global metabolic connectivity. We highlight how the integration of both approaches promises to deliver insights on the structure and function of metabolic systems with wide-ranging implications in discovery science, precision medicine and industrial biotechnology.

Function, dynamics and evolution of network motif modules in integrated gene regulatory networks of worm and plant

Gene regulatory networks (GRNs) consist of different molecular interactions that closely work together to establish proper gene expression in time and space. Especially in higher eukaryotes, many questions remain on how these interactions collectively coordinate gene regulation. We study high quality GRNs consisting of undirected protein–protein, genetic and homologous interactions, and directed protein–DNA, regulatory and miRNA–mRNA interactions in the worm Caenorhabditis elegans and the plant Arabidopsis thaliana. Our data-integration framework integrates interactions in composite network motifs, clusters these in biologically relevant, higher-order topological network motif modules, overlays these with gene expression profiles and discovers novel connections between modules and regulators. Similar modules exist in the integrated GRNs of worm and plant. We show how experimental or computational methodologies underlying a certain data type impact network topology. Through phylogenetic decomposition, we found that proteins of worm and plant tend to functionally interact with proteins of a similar age, while at the regulatory level TFs favor same age, but also older target genes. Despite some influence of the duplication mode difference, we also observe at the motif and module level for both species a preference for age homogeneity for undirected and age heterogeneity for directed interactions. This leads to a model where novel genes are added together to the GRNs in a specific biological functional context, regulated by one or more TFs that also target older genes in the GRNs. Overall, we detected topological, functional and evolutionary properties of GRNs that are potentially universal in all species.

The origin of motif families in food webs

Food webs have been found to exhibit remarkable "motif profiles", patterns in the relative prevalences of all possible three-species subgraphs, and this has been related to ecosystem properties such as stability and robustness. Analysing 46 food webs of various kinds, we find that most food webs fall into one of two distinct motif families. The separation between the families is well predicted by a global measure of hierarchical order in directed networks-trophic coherence. We find that trophic coherence is also a good predictor for the extent of omnivory, defined as the tendency of species to feed on multiple trophic levels. We compare our results to a network assembly model that admits tunable trophic coherence via a single free parameter. The model is able to generate food webs in either of the two families by varying this parameter, and correctly classifies almost all the food webs in our database. This is in contrast with the two most popular food web models, the generalized cascade and niche models, which can only generate food webs within a single motif family. Our findings suggest the importance of trophic coherence in modelling local preying patterns in food webs.

Conservation of Species- and Trait-Based Modeling Network Interactions in Extremely Acidic Microbial Community Assembly

Understanding microbial interactions is essential to decipher the mechanisms of community assembly and their effects on ecosystem functioning, however, the conservation of species- and trait-based network interactions along environmental gradient remains largely unknown. Here, by using the network-based analyses with three paralleled data sets derived from 16S rRNA gene pyrosequencing, functional microarray, and predicted metagenome, we test our hypothesis that the network interactions of traits are more conserved than those of taxonomic measures, with significantly lower variation of network characteristics along the environmental gradient in acid mine drainage. The results showed that although the overall network characteristics remained similar, the structural variation was significantly lower at trait levels. The higher conserved individual node topological properties at trait level rather than at species level indicated that the responses of diverse traits remained relatively consistent even though different species played key roles under different environmental conditions. Additionally, the randomization tests revealed that it could not reject the null hypothesis that species-based correlations were random, while the tests suggested that correlation patterns of traits were non-random. Furthermore, relationships between trait-based network characteristics and environmental properties implied that trait-based networks might be more useful in reflecting the variation of ecosystem function. Taken together, our results suggest that deterministic trait-based community assembly results in greater conservation of network interaction, which may ensure ecosystem function across environmental regimes, emphasizing the potential importance of measuring the complexity and conservation of network interaction in evaluating the ecosystem stability and functioning.

Effect of database drift on network topology and enrichment analyses: a case study for RegulonDB

RegulonDB is a database storing the biological information behind the transcriptional regulatory network (TRN) of the bacterium Escherichia coli. It is one of the key bioinformatics resources for Systems Biology investigations of bacterial gene regulation. Like most biological databases, the content drifts with time, both due to the accumulation of new information and due to refinements in the underlying biological concepts. Conclusions based on previous database versions may no longer hold. Here, we study the change of some topological properties of the TRN of E. coli, as provided by RegulonDB across 16 versions, as well as a simple index, digital control strength, quantifying the match between gene expression profiles and the transcriptional regulatory networks. While many of network characteristics change dramatically across the different versions, the digital control strength remains rather robust and in tune with previous results for this index. Our study shows that: (i) results derived from network topology should, when possible, be studied across a range of database versions, before detailed biological conclusions are derived, and (ii) resorting to simple indices, when interpreting high-throughput data from a network perspective, may help achieving a robustness of the findings against variation of the underlying biological information. Database URL: www.regulondb.ccg.unam.mx.

Habitat variability does not generally promote metabolic network modularity in flies and mammals

The evolution of species habitat range is an important topic over a wide range of research fields. In higher organisms, habitat range evolution is generally associated with genetic events such as gene duplication. However, the specific factors that determine habitat variability remain unclear at higher levels of biological organization (e.g., biochemical networks). One widely accepted hypothesis developed from both theoretical and empirical analyses is that habitat variability promotes network modularity; however, this relationship has not yet been directly tested in higher organisms. Therefore, I investigated the relationship between habitat variability and metabolic network modularity using compound and enzymatic networks in flies and mammals. Contrary to expectation, there was no clear positive correlation between habitat variability and network modularity. As an exception, the network modularity increased with habitat variability in the enzymatic networks of flies. However, the observed association was likely an artifact, and the frequency of gene duplication appears to be the main factor contributing to network modularity. These findings raise the question of whether or not there is a general mechanism for habitat range expansion at a higher level (i.e., above the gene scale). This study suggests that the currently widely accepted hypothesis for habitat variability should be reconsidered.

Sampling Motif-Constrained Ensembles of Networks

The statistical significance of network properties is conditioned on null models which satisfy specified properties but that are otherwise random. Exponential random graph models are a principled theoretical framework to generate such constrained ensembles, but which often fail in practice, either due to model inconsistency or due to the impossibility to sample networks from them. These problems affect the important case of networks with prescribed clustering coefficient or number of small connected subgraphs (motifs). In this Letter we use the Wang-Landau method to obtain a multicanonical sampling that overcomes both these problems. We sample, in polynomial time, networks with arbitrary degree sequences from ensembles with imposed motifs counts. Applying this method to social networks, we investigate the relation between transitivity and homophily, and we quantify the correlation between different types of motifs, finding that single motifs can explain up to 60% of the variation of motif profiles.

Network simulation reveals significant contribution of network motifs to the age-dependency of yeast protein-protein interaction networks

Advances in proteomic technologies combined with sophisticated computing and modeling methods have generated an unprecedented amount of high-throughput data for system-scale analysis. As a result, the study of protein-protein interaction (PPI) networks has garnered much attention in recent years. One of the most fundamental problems in studying PPI networks is to understand how their architecture originated and evolved to their current state. By investigating how proteins of different ages are connected in the yeast PPI networks, one can deduce their expansion procedure in evolution and how the ancient primitive network expanded and evolved. Studies have shown that proteins are often connected to other proteins of a similar age, suggesting a high degree of age preference between interacting proteins. Though several theories have been proposed to explain this phenomenon, none of them considered protein-clusters as a contributing factor. Here we first investigate the age-dependency of the proteins from the perspective of network motifs. Our analysis confirms that proteins of the same age groups tend to form interacting network motifs; furthermore, those proteins within motifs tend to be within protein complexes and the interactions among them largely contribute to the observed age preference in the yeast PPI networks. In light of these results, we describe a new modeling approach, based on "network motifs", whereby topologically connected protein clusters in the network are treated as single evolutionary units. Instead of modeling single proteins, our approach models the connections and evolutionary relationships of multiple related protein clusters or "network motifs" that are collectively integrated into an existing PPI network. Through simulation studies, we found that the "network motif" modeling approach can capture yeast PPI network properties better than if individual proteins were considered to be the simplest evolutionary units. Our approach provides a fresh perspective on modeling the evolution of yeast PPI networks, specifically that PPI networks may have a much higher age-dependency of interaction density than had been previously envisioned.

Motif-based success scores in coauthorship networks are highly sensitive to author name disambiguation

Following the work of Krumov et al. [Eur. Phys. J. B 84, 535 (2011)] we revisit the question whether the usage of large citation datasets allows for the quantitative assessment of social (by means of coauthorship of publications) influence on the progression of science. Applying a more comprehensive and well-curated dataset containing the publications in the journals of the American Physical Society during the whole 20th century we find that the measure chosen in the original study, a score based on small induced subgraphs, has to be used with caution, since the obtained results are highly sensitive to the exact implementation of the author disambiguation task.

Network representations and methods for the analysis of chemical and biochemical pathways

Systems biologists increasingly use network representations to investigate biochemical pathways and their dynamic behaviours. In this critical review, we discuss four commonly used network representations of chemical and biochemical pathways. We illustrate how some of these representations reduce network complexity but result in the ambiguous representation of biochemical pathways. We also examine the current theoretical approaches available to investigate the dynamic behaviour of chemical and biochemical networks. Finally, we describe how the critical chemical and biochemical pathways responsible for emergent dynamic behaviour can be identified using network mining and functional mapping approaches.

Extracting labeled topological patterns from samples of networks

An advanced graph theoretical approach is introduced that enables a higher level of functional interpretation of samples of directed networks with identical fixed pairwise different vertex labels that are drawn from a particular population. Compared to the analysis of single networks, their investigation promises to yield more detailed information about the represented system. Often patterns of directed edges in sample element networks are too intractable for a direct evaluation and interpretation. The new approach addresses the problem of simplifying topological information and characterizes such a sample of networks by finding its locatable characteristic topological patterns. These patterns, essentially sample-specific network motifs with vertex labeling, might represent the essence of the intricate topological information contained in all sample element networks and provides as well a means of differentiating network samples. Central to the accurateness of this approach is the null model and its properties, which is needed to assign significance to topological patterns. As a proof of principle the proposed approach has been applied to the analysis of networks that represent brain connectivity before and during painful stimulation in patients with major depression and in healthy subjects. The accomplished reduction of topological information enables a cautious functional interpretation of the altered neuronal processing of pain in both groups.

Motifs in triadic random graphs based on Steiner triple systems

Conventionally, pairwise relationships between nodes are considered to be the fundamental building blocks of complex networks. However, over the last decade, the overabundance of certain subnetwork patterns, i.e., the so-called motifs, has attracted much attention. It has been hypothesized that these motifs, instead of links, serve as the building blocks of network structures. Although the relation between a network's topology and the general properties of the system, such as its function, its robustness against perturbations, or its efficiency in spreading information, is the central theme of network science, there is still a lack of sound generative models needed for testing the functional role of subgraph motifs. Our work aims to overcome this limitation. We employ the framework of exponential random graph models (ERGMs) to define models based on triadic substructures. The fact that only a small portion of triads can actually be set independently poses a challenge for the formulation of such models. To overcome this obstacle, we use Steiner triple systems (STSs). These are partitions of sets of nodes into pair-disjoint triads, which thus can be specified independently. Combining the concepts of ERGMs and STSs, we suggest generative models capable of generating ensembles of networks with nontrivial triadic Z-score profiles. Further, we discover inevitable correlations between the abundance of triad patterns, which occur solely for statistical reasons and need to be taken into account when discussing the functional implications of motif statistics. Moreover, we calculate the degree distributions of our triadic random graphs analytically.

QuateXelero: an accelerated exact network motif detection algorithm

Finding motifs in biological, social, technological, and other types of networks has become a widespread method to gain more knowledge about these networks’ structure and function. However, this task is very computationally demanding, because it is highly associated with the graph isomorphism which is an NP problem (not known to belong to P or NP-complete subsets yet). Accordingly, this research is endeavoring to decrease the need to call NAUTY isomorphism detection method, which is the most time-consuming step in many existing algorithms. The work provides an extremely fast motif detection algorithm called QuateXelero, which has a Quaternary Tree data structure in the heart. The proposed algorithm is based on the well-known ESU (FANMOD) motif detection algorithm. The results of experiments on some standard model networks approve the overal superiority of the proposed algorithm, namely QuateXelero, compared with two of the fastest existing algorithms, G-Tries and Kavosh. QuateXelero is especially fastest in constructing the central data structure of the algorithm from scratch based on the input network.