Comprehensive analysis of combinatorial regulation using the transcriptional regulatory network of yeast

Fundamental patterns of signal propagation in complex networks

Various disasters stem from minor perturbations, such as the spread of infectious diseases and cascading failure in power grids. Analyzing perturbations is crucial for both theoretical and application fields. Previous researchers have proposed basic propagation patterns for perturbation and explored the impact of basic network motifs on the collective response to these perturbations. However, the current framework is limited in its ability to decouple interactions and, therefore, cannot analyze more complex structures. In this article, we establish an effective, robust, and powerful propagation framework under a general dynamic model. This framework reveals classical and dense network motifs that exert critical acceleration on signal propagation, often reducing orders of magnitude compared with conclusions generated by previous work. Moreover, our framework provides a new approach to understand the fundamental principles of complex systems and the negative feedback mechanism, which is of great significance for researching system controlling and network resilience.

MCPNet: a parallel maximum capacity-based genome-scale gene network construction framework

MOTIVATION

Gene network reconstruction from gene expression profiles is a compute- and data-intensive problem. Numerous methods based on diverse approaches including mutual information, random forests, Bayesian networks, correlation measures, as well as their transforms and filters such as data processing inequality, have been proposed. However, an effective gene network reconstruction method that performs well in all three aspects of computational efficiency, data size scalability, and output quality remains elusive. Simple techniques such as Pearson correlation are fast to compute but ignore indirect interactions, while more robust methods such as Bayesian networks are prohibitively time consuming to apply to tens of thousands of genes.

RESULTS

We developed maximum capacity path (MCP) score, a novel maximum-capacity-path-based metric to quantify the relative strengths of direct and indirect gene-gene interactions. We further present MCPNet, an efficient, parallelized gene network reconstruction software based on MCP score, to reverse engineer networks in unsupervised and ensemble manners. Using synthetic and real Saccharomyces cervisiae datasets as well as real Arabidopsis thaliana datasets, we demonstrate that MCPNet produces better quality networks as measured by AUPRC, is significantly faster than all other gene network reconstruction software, and also scales well to tens of thousands of genes and hundreds of CPU cores. Thus, MCPNet represents a new gene network reconstruction tool that simultaneously achieves quality, performance, and scalability requirements.

AVAILABILITY AND IMPLEMENTATION

Source code freely available for download at https://doi.org/10.5281/zenodo.6499747 and https://github.com/AluruLab/MCPNet, implemented in C++ and supported on Linux.

Global analysis of the yeast knockout phenome

Genome-wide phenotypic screens in the budding yeast Saccharomyces cerevisiae, enabled by its knockout collection, have produced the largest, richest, and most systematic phenotypic description of any organism. However, integrative analyses of this rich data source have been virtually impossible because of the lack of a central data repository and consistent metadata annotations. Here, we describe the aggregation, harmonization, and analysis of ~14,500 yeast knockout screens, which we call Yeast Phenome. Using this unique dataset, we characterized two unknown genes (YHR045W and YGL117W) and showed that tryptophan starvation is a by-product of many chemical treatments. Furthermore, we uncovered an exponential relationship between phenotypic similarity and intergenic distance, which suggests that gene positions in both yeast and human genomes are optimized for function.

Structural controllability of general edge dynamics in complex network

Dynamic processes that occur on the edge of complex networks are relevant to a variety of real-world systems, where states are defined on individual edges, and nodes are active components with information processing capabilities. In traditional studies of edge controllability, all adjacent edge states are assumed to be coupled. In this paper, we release this all-to-all coupling restriction and propose a general edge dynamics model. We give a theoretical framework to study the structural controllability of the general edge dynamics and find that the set of driver nodes for edge controllability is unique and determined by the local information of nodes. Applying our framework to a large number of model and real networks, we find that there exist lower and upper bounds of edge controllability, which are determined by the coupling density, where the coupling density is the proportion of adjacent edge states that are coupled. Then we investigate the proportion of effective coupling in edge controllability and find that homogeneous and relatively sparse networks have a higher proportion, and that the proportion is mainly determined by degree distribution. Finally, we analyze the role of edges in edge controllability and find that it is largely encoded by the coupling density and degree distribution, and are influenced by in- and out-degree correlation.

Programmable regulation of translation by harnessing the CRISPR-Cas13 system

The ability to control protein expression at both the transcriptional and post-transcriptional levels is instrumental for the cell to integrate multiple molecular signals and then reach high operational sophistication. Although challenging, fully artificial regulations at different levels are required for boosting systems and synthetic biology. Here, we report the development of a novel framework to regulate translation by repurposing the CRISPR-Cas13 immune system, which uses an RNA-guided ribonuclease. By exploiting a cell-free expression system for prototyping gene regulatory structures, our results demonstrate that CRISPR-dCas13a ribonucleoproteins (d means catalytically dead) can be programmed to repress or activate translation initiation. The performance assessment of the engineered systems also revealed guide RNA design principles. Moreover, we show that the system can work in vivo. This development complements the ability to regulate transcription with other CRISPR-Cas systems and offers potential applications.

Impact of basic network motifs on the collective response to perturbations

Many collective phenomena such as epidemic spreading and cascading failures in socioeconomic systems on networks are caused by perturbations of the dynamics. How perturbations propagate through networks, impact and disrupt their functions may depend on the network, the type and location of the perturbation as well as the spreading dynamics. Previous work has analyzed the retardation effects of the nodes along the propagation paths, suggesting a few transient propagation "scaling” regimes as a function of the nodes’ degree, but regardless of motifs such as triangles. Yet, empirical networks consist of motifs enabling the proper functioning of the system. Here, we show that basic motifs along the propagation path jointly determine the previously proposed scaling regimes of distance-limited propagation and degree-limited propagation, or even cease their existence. Our results suggest a radical departure from these scaling regimes and provide a deeper understanding of the interplay of self-dynamics, interaction dynamics, and topological properties.

Spreading processes and cascading failures on complex networks are often triggered by external perturbations. The authors uncover the impact of network motifs on the processes of perturbations propagation through networks, and networks’ response dynamics.

Systematic inference of indirect transcriptional regulation by protein kinases and phosphatases

Gene expression is controlled by pathways of regulatory factors often involving the activity of protein kinases on transcription factor proteins. Despite this well established mechanism, the number of well described pathways that include the regulatory role of protein kinases on transcription factors is surprisingly scarce in eukaryotes.

To address this, PhosTF was developed to infer functional regulatory interactions and pathways in both simulated and real biological networks, based on linear cyclic causal models with latent variables. GeneNetWeaverPhos, an extension of GeneNetWeaver, was developed to allow the simulation of perturbations in known networks that included the activity of protein kinases and phosphatases on gene regulation. Over 2000 genome-wide gene expression profiles, where the loss or gain of regulatory genes could be observed to perturb gene regulation, were then used to infer the existence of regulatory interactions, and their mode of regulation in the budding yeast Saccharomyces cerevisiae.

Despite the additional complexity, our inference performed comparably to the best methods that inferred transcription factor regulation assessed in the DREAM4 challenge on similar simulated networks. Inference on integrated genome-scale data sets for yeast identified ∼ 8800 protein kinase/phosphatase-transcription factor interactions and ∼ 6500 interactions among protein kinases and/or phosphatases. Both types of regulatory predictions captured statistically significant numbers of known interactions of their type. Surprisingly, kinases and phosphatases regulated transcription factors by a negative mode or regulation (deactivation) in over 70% of the predictions.

Additional insights into the organization of transcriptional regulatory modules based on a 3D model of the Saccharomyces cerevisiae genome

Objectives

Transcriptional regulatory modules are usually modelled via a network, in which nodes correspond to genes and edges correspond to regulatory associations between them. In the model yeast Saccharomyces cerevisiae, the topological properties of such a network are well-described (distribution of degrees, hierarchical levels, organization in network motifs, etc.). To go further on this, our aim was to search for additional information resulting from the new combination of classical representations of transcriptional regulatory networks with more realistic models of the spatial organization of S. cerevisiae genome in the nucleus.

Results

Taking advantage of independent studies with high-quality datasets, i.e. lists of target genes for specific transcription factors and chromosome positions in a three dimensional space representing the nucleus, particular spatial co-localizations of genes that shared common regulatory mechanisms were searched. All transcriptional modules of S. cerevisiae, as described in the latest release of the YEASTRACT database were analyzed and significant biases toward co-localization for a few sets of target genes were observed. To help other researchers to reproduce such analysis with any list of genes of their interest, an interactive web tool called 3D-Scere (https://3d-scere.ijm.fr/) is provided.

Supplementary Information

The online version contains supplementary material available at 10.1186/s13104-022-05940-5.

Generation of Realistic Gene Regulatory Networks by Enriching for Feed-Forward Loops

The regulatory relationships between genes and proteins in a cell form a gene regulatory network (GRN) that controls the cellular response to changes in the environment. A number of inference methods to reverse engineer the original GRN from large-scale expression data have recently been developed. However, the absence of ground-truth GRNs when evaluating the performance makes realistic simulations of GRNs necessary. One aspect of this is that local network motif analysis of real GRNs indicates that the feed-forward loop (FFL) is significantly enriched. To simulate this properly, we developed a novel motif-based preferential attachment algorithm, FFLatt, which outperformed the popular GeneNetWeaver network generation tool in reproducing the FFL motif occurrence observed in literature-based biological GRNs. It also preserves important topological properties such as scale-free topology, sparsity, and average in/out-degree per node. We conclude that FFLatt is well-suited as a network generation module for a benchmarking framework with the aim to provide fair and robust performance evaluation of GRN inference methods.

EnGRaiN: a supervised ensemble learning method for recovery of large-scale gene regulatory networks

MOTIVATION

Reconstruction of genome-scale networks from gene expression data is an actively studied problem. A wide range of methods that differ between the types of interactions they uncover with varying trade-offs between sensitivity and specificity have been proposed. To leverage benefits of multiple such methods, ensemble network methods that combine predictions from resulting networks have been developed, promising results better than or as good as the individual networks. Perhaps owing to the difficulty in obtaining accurate training examples, these ensemble methods hitherto are unsupervised.

RESULTS

In this article, we introduce EnGRaiN, the first supervised ensemble learning method to construct gene networks. The supervision for training is provided by small training datasets of true edge connections (positives) and edges known to be absent (negatives) among gene pairs. We demonstrate the effectiveness of EnGRaiN using simulated datasets as well as a curated collection of Arabidopsis thaliana datasets we created from microarray datasets available from public repositories. EnGRaiN shows better results not only in terms of receiver operating characteristic and PR characteristics for both real and simulated datasets compared with unsupervised methods for ensemble network construction, but also generates networks that can be mined for elucidating complex biological interactions.

AVAILABILITY AND IMPLEMENTATION

EnGRaiN software and the datasets used in the study are publicly available at the github repository: https://github.com/AluruLab/EnGRaiN.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

On the effects of the modularity of gene regulatory networks on phenotypic variability and its association with robustness

Biological adaptations depend on natural selection sorting out those individuals that exhibit characters fit to their environment. Selection, in turn, depends on the phenotypic variation present in a population. Thus, evolutionary outcomes depend, to a certain extent, on the kind of variation that organisms can produce through random genetic perturbation, that is, their phenotypic variability. Moreover, the properties of developmental mechanisms that produce the organisms affect their phenotypic variability. Two of these properties are modularity and robustness. Modularity is the degree to which interactions occur mostly within groups of the system's elements and scarcely between elements in different groups. Robustness is the propensity of a system to endure perturbations while preserving its phenotype. In this paper, we used a model of gene regulatory networks (GRNs) to study the relationship between modularity and robustness in developmental processes and how modularity affects the variation that random genetic mutations produce in the expression patterns of GRNs. Our results show that modularity and robustness are correlated in multifunctional GRNs and that selection for one of these properties affects the other as well. We contend that these observations may help to understand why modularity and robustness are widespread in biological systems. Additionally, we found that modular networks tend to produce new expression patterns with subtle changes localized in the expression of a few groups of genes. This effect in the phenotypic variability of modular GRNs may bear important consequences for adaptive evolution: it may help to adjust the expression of one group of genes at a time, with few alterations on other previously evolved expression patterns.

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.

Cis-Regulatory Logic Produces Gene-Expression Noise Describing Phenotypic Heterogeneity in Bacteria

Gene transcriptional process is random. It occurs in bursts and follows single-molecular kinetics. Intermittent bursts are measured based on their frequency and size. They influence temporal fluctuations in the abundance of total mRNA and proteins by generating distinct transcriptional variations referred to as “noise”. Noisy expression induces uncertainty because the association between transcriptional variation and the extent of gene expression fluctuation is ambiguous. The promoter architecture and remote interference of different cis-regulatory elements are the crucial determinants of noise, which is reflected in phenotypic heterogeneity. An alternative perspective considers that cellular parameters dictating genome-wide transcriptional kinetics follow a universal pattern. Research on noise and systematic perturbations of promoter sequences reinforces that both gene-specific and genome-wide regulation occur across species ranging from bacteria and yeast to animal cells. Thus, deciphering gene-expression noise is essential across different genomics applications. Amidst the mounting conflict, it is imperative to reconsider the scope, progression, and rational construction of diversified viewpoints underlying the origin of the noise. Here, we have established an indication connecting noise, gene expression variations, and bacterial phenotypic variability. This review will enhance the understanding of gene-expression noise in various scientific contexts and applications.

Paths through the Yeast Regulatory Network in Different Physiological States

We analyse paths through the regulatory networks that control gene-expression patterns in Yeast, in five different physiological states: cell cycle, DNA damage, stress response, diauxic shift, and sporulation. The network in each state is specified as a directed graph, containing different sets of edges connecting pairs selected from a combined set of 1475 nodes. Each network contains some nodes that have no parents, and others that have no children. We call these, respectively, 'source' and 'sink' nodes. For each network we enumerate paths between source and sink nodes. In a previous paper [1], we defined, extracted and compared the neighbourhoods of each transcription factor in different physiological states, and how the system reconfigures itself. Here we compare the usage of nodes and edges by different networks, and how they are assembled into paths. The picture that emerges is that the networks are not disjoint but show substantial sharing of nodes and edges; however, they assemble these materials into different sets of paths. Four of the networks, other than the cell-cycle network, contain paths between only a small fraction (< 13%) of possible source-sink pairs. Although the cell-cycle network is not an outlier in terms of total number of nodes and edges, and number of sink nodes, it is very much an outlier in having a greater proportion of source-to-sink paths than the other networks.

Neighbourhoods in the yeast regulatory network in different physiological states

MOTIVATION

The gene expression regulatory network in yeast controls the selective implementation of the information contained in the genome sequence. We seek to understand how, in different physiological states, the network reconfigures itself to produce a different proteome.

RESULTS

This article analyses this reconfiguration, focussing on changes in the local structure of the network. In particular, we define, extract and compare the 1-neighbourhoods of each transcription factor, where a 1-neighbourhood of a node in a network is the minimal subgraph of the network containing all nodes connected to the central node by an edge. We report the similarities and differences in the topologies and connectivities of these neighbourhoods in five physiological states for which data are available: cell cycle, DNA damage, stress response, diauxic shift and sporulation. Based on our analysis, it seems apt to regard the components of the regulatory network as 'software', and the responses to changes in state, 'reprogramming'.

Widespread Exaptation of L1 Transposons for Transcription Factor Binding in Breast Cancer

L1 transposons occupy 17% of the human genome and are widely exapted for the regulation of human genes, particularly in breast cancer, where we have previously shown abundant cancer-specific transcription factor (TF) binding sites within the L1PA2 subfamily. In the current study, we performed a comprehensive analysis of TF binding activities in primate-specific L1 subfamilies and identified pervasive exaptation events amongst these evolutionarily related L1 transposons. By motif scanning, we predicted diverse and abundant TF binding potentials within the L1 transposons. We confirmed substantial TF binding activities in the L1 subfamilies using TF binding sites consolidated from an extensive collection of publicly available ChIP-seq datasets. Young L1 subfamilies (L1HS, L1PA2 and L1PA3) contributed abundant TF binding sites in MCF7 cells, primarily via their 5' UTR. This is expected as the L1 5' UTR hosts cis-regulatory elements that are crucial for L1 replication and mobilisation. Interestingly, the ancient L1 subfamilies, where 5' truncation was common, displayed comparable TF binding capacity through their 3' ends, suggesting an alternative exaptation mechanism in L1 transposons that was previously unnoticed. Overall, primate-specific L1 transposons were extensively exapted for TF binding in MCF7 breast cancer cells and are likely prominent genetic players modulating breast cancer transcriptional regulation.

MeSCoT: The tool for quantitative trait simulation through the mechanistic modelling of genes' regulatory interactions

This work represents a novel mechanistic approach to simulate and study genomic networks with accompanying regulatory interactions and complex mechanisms of quantitative trait formation. The approach implemented in MeSCoT software is conceptually based on the omnigenic genetic model of quantitative (complex) trait, and closely imitates the basic in vivo mechanisms of quantitative trait realization. The software provides a framework to study molecular mechanisms of gene-by-gene and gene-by-environment interactions underlying quantitative trait’s realization and allows detailed mechanistic studies of impact of genetic and phenotypic variance on gene regulation. MeSCoT performs a detailed simulation of genes’ regulatory interactions for variable genomic architectures and generates complete set of transcriptional and translational data together with simulated quantitative trait values. Such data provide opportunities to study, for example, verification of novel statistical methods aiming to integrate intermediate phenotypes together with final phenotype in quantitative genetic analyses or to investigate novel approaches for exploiting gene-by-gene and gene-by-environment interactions.

Control of tipping points in stochastic mutualistic complex networks

Nonlinear stochastic complex networks in ecological systems can exhibit tipping points. They can signify extinction from a survival state and, conversely, a recovery transition from extinction to survival. We investigate a control method that delays the extinction and advances the recovery by controlling the decay rate of pollinators of diverse rankings in a pollinators-plants stochastic mutualistic complex network. Our investigation is grounded on empirical networks occurring in natural habitats. We also address how the control method is affected by both environmental and demographic noises. By comparing the empirical network with the random and scale-free networks, we also study the influence of the topological structure on the control effect. Finally, we carry out a theoretical analysis using a reduced dimensional model. A remarkable result of this work is that the introduction of pollinator species in the habitat, which is immune to environmental deterioration and that is in mutualistic relationship with the collapsed ones, definitely helps in promoting the recovery. This has implications for managing ecological systems.

New insights on key genes involved in drought stress response of barley: gene networks reconstruction, hub, and promoter analysis

Background

Barley (Hordeum vulgare L.) is one of the most important cereals worldwide. Although this crop is drought-tolerant, water deficiency negatively affects its growth and production. To detect key genes involved in drought tolerance in barley, a reconstruction of the related gene network and discovery of the hub genes would help. Here, drought-responsive genes in barley were collected through analysis of the available microarray datasets (− 5 ≥ Fold change ≥ 5, adjusted p value ≤ 0.05). Protein-protein interaction (PPI) networks were reconstructed.

Results

The hub genes were identified by Cytoscape software using three Cyto-hubba algorithms (Degree, Closeness, and MNC), leading to the identification of 17 and 16 non-redundant genes at vegetative and reproductive stages, respectively. These genes consist of some transcription factors such as HvVp1, HvERF4, HvFUS3, HvCBF6, DRF1.3, HvNAC6, HvCO5, and HvWRKY42, which belong to AP2, NAC, Zinc-finger, and WRKY families. In addition, the expression pattern of four hub genes was compared between the two studied cultivars, i.e., “Yousef” (drought-tolerant) and “Morocco” (susceptible). The results of real-time PCR revealed that the expression patterns corresponded well with those determined by the microarray. Also, promoter analysis revealed that some TF families, including AP2, NAC, Trihelix, MYB, and one modular (composed of two HD-ZIP TFs), had a binding site in 85% of promoters of the drought-responsive genes and of the hub genes in barley.

Conclusions

The identified hub genes, especially those from AP2 and NAC families, might be among key TFs that regulate drought-stress response in barley and are suggested as promising candidate genes for further functional analysis.

Underpinning miRNA-miRNA co-functional interaction patterns in the metabolism of Oryza sativa by genome-scale network analysis

MicroRNA (miRNA) is a class of non-coding small RNAs, which post-transcriptionally regulate a large number of genes and are now known to be important regulators in a wide variety of biological processes including metabolism. Thus, for better understanding these complex biological networks, and to derive their significance and inter-dependency, a systems biology approach enables us to explore and draw vital insights into these molecular network architectures. In this study, we aimed to understand the significance of synergistic miRNA-miRNA interactions in rice by constructing and analysing metabolic networks. The construction of the network involves target gene prediction of experimentally verified miRNAs of rice and then appending associated metabolic pathways to the network. A genome-scale miRNA-miRNA co-functional network (MFSN) is constructed based on co-regulatory interactions among the miRNAs and common target genes by applying transformational procedures. The analysis of the extracted MFSN modules identifies co-regulated target genes that are associated with corresponding interconnected metabolic pathways such as VALDEG-PWY (L-valine degradation I pathway was found to be targeted by multiple miRNA families, such as osa-miR812, osa-miR818, osa-miR821, and osa-miR5799 families while another pathway that was found to be associated with multiple miRNA families was PWY-6952 (glycerophosphodiester degradation pathway), PWY-6952 was found to be targeted by osa-miR812, osa-miR11344 and osa-miR5801 families. Such extensive study will help in systematically elucidating the regulatory networks in metabolism of rice, which in turn can be utilised to devise strategies for crop improvement and novel cultivar development.

Assessing regulatory features of the current transcriptional network of Saccharomyces cerevisiae

The capacity of living cells to adapt to different environmental, sometimes adverse, conditions is achieved through differential gene expression, which in turn is controlled by a highly complex transcriptional network. We recovered the full network of transcriptional regulatory associations currently known for Saccharomyces cerevisiae, as gathered in the latest release of the YEASTRACT database. We assessed topological features of this network filtered by the kind of supporting evidence and of previously published networks. It appears that in-degree distribution, as well as motif enrichment evolve as the yeast transcriptional network is being completed. Overall, our analyses challenged some results previously published and confirmed others. These analyses further pointed towards the paucity of experimental evidence to support theories and, more generally, towards the partial knowledge of the complete network.

Inference of gene regulatory networks based on nonlinear ordinary differential equations

Motivation

Gene regulatory networks (GRNs) capture the regulatory interactions between genes, resulting from the fundamental biological process of transcription and translation. In some cases, the topology of GRNs is not known, and has to be inferred from gene expression data. Most of the existing GRNs reconstruction algorithms are either applied to time-series data or steady-state data. Although time-series data include more information about the system dynamics, steady-state data imply stability of the underlying regulatory networks.

Results

In this article, we propose a method for inferring GRNs from time-series and steady-state data jointly. We make use of a non-linear ordinary differential equations framework to model dynamic gene regulation and an importance measurement strategy to infer all putative regulatory links efficiently. The proposed method is evaluated extensively on the artificial DREAM4 dataset and two real gene expression datasets of yeast and Escherichia coli. Based on public benchmark datasets, the proposed method outperforms other popular inference algorithms in terms of overall score. By comparing the performance on the datasets with different scales, the results show that our method still keeps good robustness and accuracy at a low computational complexity.

Availability and implementation

The proposed method is written in the Python language, and is available at: https://github.com/lab319/GRNs_nonlinear_ODEs

Supplementary information

Supplementary data are available at Bioinformatics online.

Association of the Sp1 binding site and -1997 promoter variations in COL1A1 with osteoporosis risk: The application of meta-analysis and bioinformatics approaches offers a new perspective for future research

As a complex disease, osteoporosis is influenced by several genetic markers. Many studies have examined the link between the Sp1 binding site +1245 G > T (rs1800012) and -1997 G > T (rs1107946) variations in the COL1A1 gene with osteoporosis risk. However, the findings of these studies have been contradictory; therefore, we performed a meta-analysis to aggregate additional information and obtain increased statistical power to more efficiently estimate this correlation. A meta-analysis was conducted with studies published between 1991-2020 that were identified by a systematic electronic search of the Scopus and Clarivate Analytics databases. Studies with bone mineral density (BMD) data and complete genotypes of the single-nucleotide variations (SNVs) for the overall and postmenopausal female population were included in this meta-analysis and analyzed using the R metaphor package. A relationship between rs1800012 and significantly decreased BMD values at the lumbar spine and femoral neck was found in individuals carrying the "ss" versus the "SS" genotype in the overall population according to a random effects model (p < 0.0001). Similar results were also found in the postmenopausal female population (p = 0.003 and 0.0002, respectively). Such findings might be an indication of increased osteoporosis risk in both studied groups in individuals with the "ss" genotype. Although no association was identified between the -1997 G > T and low BMD in the overall population, those individuals with the "GT" genotype showed a higher level of BMD than those with "GG" in the subgroup analysis (p = 0.007). To determine which transcription factor (TF) might bind to the -1997 G > T in COL1A1, 45 TFs were identified based on bioinformatics predictions. According to the GSE35958 microarray dataset, 16 of 45 TFs showed differential expression profiles in osteoporotic human mesenchymal stem cells relative to normal samples from elderly donors. By identifying candidate TFs for the -1997 G > T site, our study offers a new perspective for future research.

Identifying Transcription Factor Combinations to Modulate Circadian Rhythms by Leveraging Virtual Knockouts on Transcription Networks

The mammalian circadian systems consist of indigenous, self-sustained 24-h rhythm generators. They comprise many genes, molecules, and regulators. To decode their systematic controls, a robust computational approach was employed. It integrates transcription-factor-occupancy and time-series gene-expression data as input. The model equations were constructed and solved to determine the transcriptional regulatory logics in the mouse transcriptome network. This hypothesizes to explore the underlying mechanisms of combinatorial transcriptional regulations for circadian rhythms in mouse. We reconstructed the quantitative transcriptional-regulatory networks for circadian gene regulation at a dynamic scale. Transcriptional-simulations with virtually knocked-out mutants were performed to estimate their influence on networks. The potential transcriptional-regulators-combinations modulating the circadian rhythms were identified. Of them, CLOCK/CRY1 double knockout preserves the highest modulating capacity. Our quantitative framework offers a quick, robust, and physiologically relevant way to characterize the druggable targets to modulate the circadian rhythms at a dynamic scale effectively.

A modified Ising model of Barabási-Albert network with gene-type spins

The central question of systems biology is to understand how individual components of a biological system such as genes or proteins cooperate in emerging phenotypes resulting in the evolution of diseases. As living cells are open systems in quasi-steady state type equilibrium in continuous exchange with their environment, computational techniques that have been successfully applied in statistical thermodynamics to describe phase transitions may provide new insights to the emerging behavior of biological systems. Here we systematically evaluate the translation of computational techniques from solid-state physics to network models that closely resemble biological networks and develop specific translational rules to tackle problems unique to living systems. We focus on logic models exhibiting only two states in each network node. Motivated by the apparent asymmetry between biological states where an entity exhibits boolean states i.e. is active or inactive, we present an adaptation of symmetric Ising model towards an asymmetric one fitting to living systems here referred to as the modified Ising model with gene-type spins. We analyze phase transitions by Monte Carlo simulations and propose a mean-field solution of a modified Ising model of a network type that closely resembles a real-world network, the Barabási–Albert model of scale-free networks. We show that asymmetric Ising models show similarities to symmetric Ising models with the external field and undergoes a discontinuous phase transition of the first-order and exhibits hysteresis. The simulation setup presented herein can be directly used for any biological network connectivity dataset and is also applicable for other networks that exhibit similar states of activity. The method proposed here is a general statistical method to deal with non-linear large scale models arising in the context of biological systems and is scalable to any network size.

Target control based on edge dynamics in complex networks

In the past decade, the study of the dynamics of complex networks has been a focus of research. In particular, the controllability of complex networks based on the nodal dynamics has received strong attention. As a result, significant theories have been formulated in network control. Target control theory is one of the most important results among these theories. This theory addresses how to select as few input nodes as possible to control the chosen target nodes in a nodal linear dynamic system. However, the research on how to control the target edges in switchboard dynamics, which is a dynamical process defined on the edges, has been lacking. This shortcoming has motivated us to give an effective control scheme for the target edges. Here, we propose the k-travel algorithm to approximately calculate the minimum number of driven edges and driver nodes for a directed tree-like network. For general cases, we put forward a greedy algorithm TEC to approximately calculate the minimum number of driven edges and driver nodes. Analytic calculations show that networks with large assortativity coefficient as well as small average shortest path are efficient in random target edge control, and networks with small clustering coefficient are efficient in local target edge control.

Bayesian Data Fusion of Gene Expression and Histone Modification Profiles for Inference of Gene Regulatory Network

Accurately reconstructing gene regulatory networks (GRNs) from high-throughput gene expression data has been a major challenge in systems biology for decades. Many approaches have been proposed to solve this problem. However, there is still much room for the improvement of GRN inference. Integrating data from different sources is a promising strategy. Epigenetic modifications have a close relationship with gene regulation. Hence, epigenetic data such as histone modification profiles can provide useful information for uncovering regulatory interactions between genes. In this paper, we propose a method to integrate epigenetic data into the inference of GRNs. In particular, a dynamic Bayesian network (DBN) is employed to infer gene regulations from time-series gene expression data. Epigenetic data (histone modification profiles here) are integrated into the prior probability distribution of the Bayesian model. Our method has been validated on both synthetic and real datasets. Experimental results show that the integration of epigenetic data can significantly improve the performance of GRN inference. As more epigenetic datasets become available, our method would be useful for elucidating the gene regulatory mechanisms driving various cellular activities. The source code and testing datasets are available at https://github.com/Zheng-Lab/MetaGRN/tree/master/histonePrior.

Identifying genuine protein-protein interactions within communities of gene co-expression networks using a deconvolution method

Direct relationships between biological molecules connected in a gene co-expression network tend to reflect real biological activities such as gene regulation, protein-protein interactions (PPIs), and metabolisation. As correlation-based networks contain numerous indirect connections, those direct relationships are always 'hidden' in them. Compared with the global network, network communities imply more biological significance on predicting protein function, detecting protein complexes and studying network evolution. Therefore, identifying direct relationships in communities is a pervasive and important topic in the biological sciences. Unfortunately, this field has not been well studied. A major thrust of this study is to apply a deconvolution algorithm on communities stemming from different gene co-expression networks, which are constructed by fixing different thresholds for robustness analysis. Using the fifth Dialogue on Reverse Engineering Assessment and Methods challenge (DREAM5) framework, the authors demonstrate that nearly all new communities extracted from a 'deconvolution filter' contain more genuine PPIs than before deconvolution.

Reusable building blocks in biological systems

One of the most widely recognized features of biological systems is their modularity. The modules that constitute biological systems are said to be redeployed and combined across several conditions, thus acting as building blocks. In this work, we analyse to what extent are these building blocks reusable as compared with those found in randomized versions of a system. We develop a notion of decompositions of systems into phenotypic building blocks, which allows them to overlap while maximizing the number of times a building block is reused across several conditions. Different biological systems present building blocks whose reusability ranges from single use (e.g. condition specific) to constitutive, although their average reusability is not always higher than random equivalents of the system. These decompositions reveal a distinct distribution of building block sizes in real biological systems. This distribution stems, in part, from the peculiar usage pattern of the elements of biological systems, and constitutes a new angle to study the evolution of modularity.

Controllability limit of edge dynamics in complex networks

Edge dynamics is relevant to various real-world systems with complex network topological features. An edge dynamical system is controllable if it can be driven from any initial state to any desired state in finite time with appropriate control inputs. Here a framework is proposed to study the impact of correlation between in- and out-degrees on controlling the edge dynamics in complex networks. We use the maximum matching and direct acquisition methods to determine the controllability limit, i.e., the limit of acceptable change of the edge controllability by adjusting the degree correlation only. Applying the framework to plenty complex networks, we find that the controllability limits are ubiquitous in model and real networks. Arbitrary edge controllability in between the limits can be achieved by properly adjusting the degree correlation. Moreover, a nonsmooth phenomenon occurs in the upper limits, and exponential and power-law scaling behaviors are widespread in the approach or separation speed between the upper and lower limits.

Irrelevance of linear controllability to nonlinear dynamical networks

There has been tremendous development in linear controllability of complex networks. Real-world systems are fundamentally nonlinear. Is linear controllability relevant to nonlinear dynamical networks? We identify a common trait underlying both types of control: the nodal "importance". For nonlinear and linear control, the importance is determined, respectively, by physical/biological considerations and the probability for a node to be in the minimum driver set. We study empirical mutualistic networks and a gene regulatory network, for which the nonlinear nodal importance can be quantified by the ability of individual nodes to restore the system from the aftermath of a tipping-point transition. We find that the nodal importance ranking for nonlinear and linear control exhibits opposite trends: for the former large-degree nodes are more important but for the latter, the importance scale is tilted towards the small-degree nodes, suggesting strongly the irrelevance of linear controllability to these systems. The recent claim of successful application of linear controllability to Caenorhabditis elegans connectome is examined and discussed.

TIGRNCRN: Trustful inference of gene regulatory network using clustering and refining the network

In this study, in order to deal with the noise and uncertainty in gene expression data, learning networks, especially Bayesian networks, that have the ability to use prior knowledge, were used to infer gene regulatory network. Learning networks are methods that have the structure of the network and a learning process to obtain relationships. One of the methods which have been used for measuring the relationship between genes is the correlation metrics, but the high correlated genes not necessarily mean that they have causal effect on each other. Studies on common methods in inference of gene regulatory networks are yet to pay attention to their biological importance and as such, predictions by these methods are less accurate in terms of biological significance. Hence, in the proposed method, genes with high correlation were identified in one cluster using clustering, and the existence of edge between the genes in the cluster was prevented. Finally, after the Bayesian network modeling, based on knowledge gained from clustering, the refining phase and improving regulatory interactions using biological correlation were done. In order to show the efficiency, the proposed method has been compared with several common methods in this area including GENIE3 and BMALR. The results of the evaluation indicate that the proposed method recognized regulatory relations in Bayesian modeling process well, due to using of biological knowledge which is hidden in the data collection, and is able to recognize gene regulatory networks align with important methods in this field.

Share and share alike: the role of Tra1 from the SAGA and NuA4 coactivator complexes

SAGA and NuA4 are coactivator complexes required for transcription on chromatin. Although they contain different enzymatic and biochemical activities, both contain the large Tra1 subunit. Recent electron microscopy studies have resolved the complete structure of Tra1 and its integration in SAGA/NuA4, providing important insight into Tra1 function.

Gene Regulatory Networks: A Primer in Biological Processes and Statistical Modelling

Modelling gene regulatory networks requires not only a thorough understanding of the biological system depicted, but also the ability to accurately represent this system from a mathematical perspective. Throughout this chapter, we aim to familiarize the reader with the biological processes and molecular factors at play in the process of gene expression regulation. We first describe the different interactions controlling each step of the expression process, from transcription to mRNA and protein decay. In the second section, we provide statistical tools to accurately represent this biological complexity in the form of mathematical models. Among other considerations, we discuss the topological properties of biological networks, the application of deterministic and stochastic frameworks, and the quantitative modelling of regulation. We particularly focus on the use of such models for the simulation of expression data that can serve as a benchmark for the testing of network inference algorithms.

GNC-app: A new Cytoscape app to rate gene networks biological coherence using gene-gene indirect relationships

MOTIVATION

Gene networks are currently considered a powerful tool to model biological processes in the Bioinformatics field. A number of approaches to infer gene networks and various software tools to handle them in a visual simplified way have been developed recently. However, there is still a need to assess the inferred networks in order to prove their relevance.

RESULTS

In this paper, we present the new GNC-app for Cytoscape. GNC-app implements the GNC methodology for assessing the biological coherence of gene association networks and integrates it into Cytoscape. Implemented de novo, GNC-app significantly improves the performance of the original algorithm in order to be able to analyse large gene networks more efficiently. It has also been integrated in Cytoscape to increase the tool accessibility for non-technical users and facilitate the visual analysis of the results. This integration allows the user to analyse not only the global biological coherence of the network, but also the biological coherence at the gene-gene relationship level. It also allows the user to leverage Cytoscape capabilities as well as its rich ecosystem of apps to perform further analyses and visualizations of the network using such data.

AVAILABILITY

The GNC-app is freely available at the official Cytoscape app store: http://apps.cytoscape.org/apps/gnc.

Identification of regulatory modules in genome scale transcription regulatory networks

Background

In gene regulatory networks, transcription factors often function as co-regulators to synergistically induce or inhibit expression of their target genes. However, most existing module-finding algorithms can only identify densely connected genes but not co-regulators in regulatory networks.

Methods

We have developed a new computational method, CoReg, to identify transcription co-regulators in large-scale regulatory networks. CoReg calculates gene similarities based on number of common neighbors of any two genes. Using simulated and real networks, we compared the performance of different similarity indices and existing module-finding algorithms and we found CoReg outperforms other published methods in identifying co-regulatory genes. We applied CoReg to a large-scale network of Arabidopsis with more than 2.8 million edges and we analyzed more than 2,300 published gene expression profiles to charaterize co-expression patterns of gene moduled identified by CoReg.

Results

We identified three types of modules in the Arabidopsis network: regulator modules, target modules and intermediate modules. Regulator modules include genes with more than 90% edges as out-going edges; Target modules include genes with more than 90% edges as incoming edges. Other modules are classified as intermediate modules. We found that genes in target modules tend to be highly co-expressed under abiotic stress conditions, suggesting this network struture is robust against perturbation.

Conclusions

Our analysis shows that the CoReg is an accurate method in identifying co-regulatory genes in large-scale networks. We provide CoReg as an R package, which can be applied in finding co-regulators in any organisms with genome-scale regulatory network data.

Electronic supplementary material

The online version of this article (10.1186/s12918-017-0493-2) contains supplementary material, which is available to authorized users.

Structure of the Transcriptional Regulatory Network Correlates with Regulatory Divergence in Drosophila

Transcriptional control of gene expression is regulated by biochemical interactions between cis-regulatory DNA sequences and trans-acting factors that form complex regulatory networks. Genetic changes affecting both cis- and trans-acting sequences in these networks have been shown to alter patterns of gene expression as well as higher-order organismal phenotypes. Here, we investigate how the structure of these regulatory networks relates to patterns of polymorphism and divergence in gene expression. To do this, we compared a transcriptional regulatory network inferred for Drosophila melanogaster to differences in gene regulation observed between two strains of D. melanogaster as well as between two pairs of closely related species: Drosophila sechellia and Drosophila simulans, and D. simulans and D. melanogaster. We found that the number of transcription factors predicted to directly regulate a gene ("in-degree") was negatively correlated with divergence in both gene expression (mRNA abundance) and cis-regulation. This observation suggests that the number of transcription factors directly regulating a gene's expression affects the conservation of cis-regulation and gene expression over evolutionary time. We also tested the hypothesis that transcription factors regulating more target genes (higher "out-degree") are less likely to evolve changes in their cis-regulation and expression (presumably due to increased pleiotropy), but found little support for this predicted relationship. Taken together, these data show how the architecture of regulatory networks can influence regulatory evolution.

An efficient algorithm for finding all possible input nodes for controlling complex networks

Understanding structural controllability of a complex network requires to identify a Minimum Input nodes Set (MIS) of the network. Finding an MIS is known to be equivalent to computing a maximum matching of the network, where the unmatched nodes constitute an MIS. However, maximum matching is often not unique for a network, and finding all possible input nodes, the union of all MISs, may provide deep insights to the controllability of the network. Here we present an efficient enumerative algorithm for the problem. The main idea is to modify a maximum matching algorithm to make it efficient for finding all possible input nodes by computing only one MIS. The algorithm can also output a set of substituting nodes for each input node in the MIS, so that any node in the set can replace the latter. We rigorously proved the correctness of the new algorithm and evaluated its performance on synthetic and large real networks. The experimental results showed that the new algorithm ran several orders of magnitude faster than an existing method on large real networks.

Universal framework for edge controllability of complex networks

Dynamical processes occurring on the edges in complex networks are relevant to a variety of real-world situations. Despite recent advances, a framework for edge controllability is still required for complex networks of arbitrary structure and interaction strength. Generalizing a previously introduced class of processes for edge dynamics, the switchboard dynamics, and exploit- ing the exact controllability theory, we develop a universal framework in which the controllability of any node is exclusively determined by its local weighted structure. This framework enables us to identify a unique set of critical nodes for control, to derive analytic formulas and articulate efficient algorithms to determine the exact upper and lower controllability bounds, and to evaluate strongly structural controllability of any given network. Applying our framework to a large number of model and real-world networks, we find that the interaction strength plays a more significant role in edge controllability than the network structure does, due to a vast range between the bounds determined mainly by the interaction strength. Moreover, transcriptional regulatory networks and electronic circuits are much more strongly structurally controllable (SSC) than other types of real-world networks, directed networks are more SSC than undirected networks, and sparse networks are typically more SSC than dense networks.

Analysis of Organization of the Interactome Using Dominating Sets: A Case Study on Cell Cycle Interaction Networks

In this study, a minimum dominating set based approach was developed and implemented as a Cytoscape plugin to identify critical and redundant proteins in a protein interaction network. We focused on the investigation of the properties associated with critical proteins in the context of the analysis of interaction networks specific to cell cycle in both yeast and human. A total of 132 yeast genes and 129 human proteins have been identified as critical nodes while 950 in yeast and 980 in human have been categorized as redundant nodes. A clear distinction between critical and redundant proteins was observed when examining their topological parameters including betweenness centrality, suggesting a central role of critical proteins in the control of a network. The significant differences in terms of gene coexpression and functional similarity were observed between the two sets of proteins in yeast. Critical proteins were found to be enriched with essential genes in both networks and have a more deleterious effect on the network integrity than their redundant counterparts. Furthermore, we obtained statistically significant enrichments of proteins that govern human diseases including cancer-related and virus-targeted genes in the corresponding set of critical proteins.

Robustness of controlling edge dynamics in complex networks against node failure

The robustness of controlling complex networks is significant in network science. In this paper, we focus on evaluating and analyzing the robustness of controlling edge dynamics in complex networks against node failure. Using three categories of all nodes to quantify the robustness, we find that the percentages of the three types of nodes are mainly related to the degree distribution of networks. The simulation results of model networks and analytic calculations show that the sparse inhomogeneous networks, which emerge in many real complex networks, have strong control robustness from the point of the number of ordinary nodes, but the strong positive correlation between in and out degrees reduces the control robustness. Evaluation of real-world networks indicates that most of them have few or no critical nodes, that is, they do not need to increase driver nodes to maintain control for most of node failures. Then an adding circuit-link strategy is proposed to optimize the robustness of edge controllability.

Detecting Cooperativity between Transcription Factors Based on Functional Coherence and Similarity of Their Target Gene Sets

In eukaryotic cells, transcriptional regulation of gene expression is usually achieved by cooperative transcription factors (TFs). Therefore, knowing cooperative TFs is the first step toward uncovering the molecular mechanisms of gene expression regulation. Many algorithms based on different rationales have been proposed to predict cooperative TF pairs in yeast. Although various types of rationales have been used in the existing algorithms, functional coherence is not yet used. This prompts us to develop a new algorithm based on functional coherence and similarity of the target gene sets to identify cooperative TF pairs in yeast. The proposed algorithm predicted 40 cooperative TF pairs. Among them, three (Pdc2-Thi2, Hot1-Msn1 and Leu3-Met28) are novel predictions, which have not been predicted by any existing algorithms. Strikingly, two (Pdc2-Thi2 and Hot1-Msn1) of the three novel predictions have been experimentally validated, demonstrating the power of the proposed algorithm. Moreover, we show that the predictions of the proposed algorithm are more biologically meaningful than the predictions of 17 existing algorithms under four evaluation indices. In summary, our study suggests that new algorithms based on novel rationales are worthy of developing for detecting previously unidentifiable cooperative TF pairs.

Attack Vulnerability of Network Controllability

Controllability of complex networks has attracted much attention, and understanding the robustness of network controllability against potential attacks and failures is of practical significance. In this paper, we systematically investigate the attack vulnerability of network controllability for the canonical model networks as well as the real-world networks subject to attacks on nodes and edges. The attack strategies are selected based on degree and betweenness centralities calculated for either the initial network or the current network during the removal, among which random failure is as a comparison. It is found that the node-based strategies are often more harmful to the network controllability than the edge-based ones, and so are the recalculated strategies than their counterparts. The Barabási-Albert scale-free model, which has a highly biased structure, proves to be the most vulnerable of the tested model networks. In contrast, the Erdős-Rényi random model, which lacks structural bias, exhibits much better robustness to both node-based and edge-based attacks. We also survey the control robustness of 25 real-world networks, and the numerical results show that most real networks are control robust to random node failures, which has not been observed in the model networks. And the recalculated betweenness-based strategy is the most efficient way to harm the controllability of real-world networks. Besides, we find that the edge degree is not a good quantity to measure the importance of an edge in terms of network controllability.

Noncommutative Biology: Sequential Regulation of Complex Networks

Single-cell variability in gene expression is important for generating distinct cell types, but it is unclear how cells use the same set of regulatory molecules to specifically control similarly regulated genes. While combinatorial binding of transcription factors at promoters has been proposed as a solution for cell-type specific gene expression, we found that such models resulted in substantial information bottlenecks. We sought to understand the consequences of adopting sequential logic wherein the time-ordering of factors informs the final outcome. We showed that with noncommutative control, it is possible to independently control targets that would otherwise be activated simultaneously using combinatorial logic. Consequently, sequential logic overcomes the information bottleneck inherent in complex networks. We derived scaling laws for two noncommutative models of regulation, motivated by phosphorylation/neural networks and chromosome folding, respectively, and showed that they scale super-exponentially in the number of regulators. We also showed that specificity in control is robust to the loss of a regulator. Lastly, we connected these theoretical results to real biological networks that demonstrate specificity in the context of promiscuity. These results show that achieving a desired outcome often necessitates roundabout steps.

DNA is the blueprint of life. Yet the order in which a cell follows these instructions makes it capable of generating thousands of different fates. How this information is extracted from underlying gene regulatory networks is unclear, especially given that biological networks are highly interconnected, and that the number of signaling pathways is relatively small (approximately 5–10). The conventional approach for increasing the information capacity of a limited set of regulators is to use them in combination. Surprisingly, combinatorial logic does not increase the diversity of target configurations or cell fates, but instead causes information bottlenecks. A different approach, called sequential logic, uses noncommutative sequences of a small set of regulators to drive networks to a large number of novel configurations. If certain targets are first protected, then even promiscuous regulators can activate specific subsets of lineage-specific targets. In this paper we show how sequential logic outperforms combinatorial logic, and argue that noncommutative sequences underlie a number of cases of biological regulation, e.g. how a small number of signaling pathways generates a large diversity of cell types in development. In addition to explaining biological networks, sequential logic may be a general experimental design strategy in synthetic and single-cell biology.

YCRD: Yeast Combinatorial Regulation Database

In eukaryotes, the precise transcriptional control of gene expression is typically achieved through combinatorial regulation using cooperative transcription factors (TFs). Therefore, a database which provides regulatory associations between cooperative TFs and their target genes is helpful for biologists to study the molecular mechanisms of transcriptional regulation of gene expression. Because there is no such kind of databases in the public domain, this prompts us to construct a database, called Yeast Combinatorial Regulation Database (YCRD), which deposits 434,197 regulatory associations between 2535 cooperative TF pairs and 6243 genes. The comprehensive collection of more than 2500 cooperative TF pairs was retrieved from 17 existing algorithms in the literature. The target genes of a cooperative TF pair (e.g. TF1-TF2) are defined as the common target genes of TF1 and TF2, where a TF’s experimentally validated target genes were downloaded from YEASTRACT database. In YCRD, users can (i) search the target genes of a cooperative TF pair of interest, (ii) search the cooperative TF pairs which regulate a gene of interest and (iii) identify important cooperative TF pairs which regulate a given set of genes. We believe that YCRD will be a valuable resource for yeast biologists to study combinatorial regulation of gene expression. YCRD is available at http://cosbi.ee.ncku.edu.tw/YCRD/ or http://cosbi2.ee.ncku.edu.tw/YCRD/.

CoopTFD: a repository for predicted yeast cooperative transcription factor pairs

In eukaryotic cells, transcriptional regulation of gene expression is usually accomplished by cooperative Transcription Factors (TFs). Therefore, knowing cooperative TFs is helpful for uncovering the mechanisms of transcriptional regulation. In yeast, many cooperative TF pairs have been predicted by various algorithms in the literature. However, until now, there is still no database which collects the predicted yeast cooperative TFs from existing algorithms. This prompts us to construct Cooperative Transcription Factors Database (CoopTFD), which has a comprehensive collection of 2622 predicted cooperative TF pairs (PCTFPs) in yeast from 17 existing algorithms. For each PCTFP, our database also provides five types of validation information: (i) the algorithms which predict this PCTFP, (ii) the publications which experimentally show that this PCTFP has physical or genetic interactions, (iii) the publications which experimentally study the biological roles of both TFs of this PCTFP, (iv) the common Gene Ontology (GO) terms of this PCTFP and (v) the common target genes of this PCTFP. Based on the provided validation information, users can judge the biological plausibility of a PCTFP of interest. We believe that CoopTFD will be a valuable resource for yeast biologists to study the combinatorial regulation of gene expression controlled by cooperative TFs.

Database URL:http://cosbi.ee.ncku.edu.tw/CoopTFD/ or http://cosbi2.ee.ncku.edu.tw/CoopTFD/

Investigating the Combinatory Effects of Biological Networks on Gene Co-expression

Co-expressed genes often share similar functions, and gene co-expression networks have been widely used in studying the functionality of gene modules. Previous analysis indicated that genes are more likely to be co-expressed if they are either regulated by the same transcription factors, forming protein complexes or sharing similar topological properties in protein-protein interaction networks. Here, we reconstructed transcriptional regulatory and protein-protein networks for Saccharomyces cerevisiae using well-established databases, and we evaluated their co-expression activities using publically available gene expression data. Based on our network-dependent analysis, we found that genes that were co-regulated in the transcription regulatory networks and shared similar neighbors in the protein-protein networks were more likely to be co-expressed. Moreover, their biological functions were closely related.

Data-based Reconstruction of Gene Regulatory Networks of Fungal Pathogens

In the emerging field of systems biology of fungal infection, one of the central roles belongs to the modeling of gene regulatory networks (GRNs). Utilizing omics-data, GRNs can be predicted by mathematical modeling. Here, we review current advances of data-based reconstruction of both small-scale and large-scale GRNs for human pathogenic fungi. The advantage of large-scale genome-wide modeling is the possibility to predict central (hub) genes and thereby indicate potential biomarkers and drug targets. In contrast, small-scale GRN models provide hypotheses on the mode of gene regulatory interactions, which have to be validated experimentally. Due to the lack of sufficient quantity and quality of both experimental data and prior knowledge about regulator–target gene relations, the genome-wide modeling still remains problematic for fungal pathogens. While a first genome-wide GRN model has already been published for Candida albicans, the feasibility of such modeling for Aspergillus fumigatus is evaluated in the present article. Based on this evaluation, opinions are drawn on future directions of GRN modeling of fungal pathogens. The crucial point of genome-wide GRN modeling is the experimental evidence, both used for inferring the networks (omics ‘first-hand’ data as well as literature data used as prior knowledge) and for validation and evaluation of the inferred network models.