Estimating coarse gene network structure from large-scale gene perturbation data

Cancer and Chaos and the Complex Network Model of a Multicellular Organism

In the search of theoretical models describing cancer, one of promising directions is chaos. It is connected to ideas of "genome chaos" and "life on the edge of chaos", but they profoundly differ in the meaning of the term "chaos". To build any coherent models, notions used by both ideas should be firstly brought closer. The hypothesis "life on the edge of chaos" using deterministic chaos has been radically deepened developed in recent years by the discovery of half-chaos. This new view requires a deeper interpretation within the range of the cell and the organism. It has impacts on understanding "chaos" in the term "genome chaos". This study intends to present such an interpretation on the basis of which such searches will be easier and closer to intuition. We interpret genome chaos as deterministic chaos in a large module of half-chaotic network modeling the cell. We observed such chaotic modules in simulations of evolution controlled by weaker variant of natural selection. We also discuss differences between free and somatic cells in modeling their disturbance using half-chaotic networks.

Comodularity and detection of co-communities

This paper introduces the notion of comodularity, to cocluster observations of bipartite networks into co-communities. The task of coclustering is to group together nodes of one type with nodes of another type, according to the interactions that are the most similar. The measure of comodularity is introduced to assess the strength of co-communities, as well as to arrange the representation of nodes and clusters for visualization, and to define an objective function for optimization. We demonstrate the usefulness of our proposed methodology on simulated data, and with examples from genomics and consumer-product reviews.

scLink: Inferring Sparse Gene Co-expression Networks from Single-cell Expression Data

A system-level understanding of the regulation and coordination mechanisms of gene expression is essential for studying the complexity of biological processes in health and disease. With the rapid development of single-cell RNA sequencing technologies, it is now possible to investigate gene interactions in a cell type-specific manner. Here we propose the scLink method, which uses statistical network modeling to understand the co-expression relationships among genes and construct sparse gene co-expression networks from single-cell gene expression data. We use both simulation and real data studies to demonstrate the advantages of scLink and its ability to improve single-cell gene network analysis. The scLink R package is available at https://github.com/Vivianstats/scLink.

When pain gets stuck: the evolution of pain chronification and treatment resistance

It is well-recognized that, despite similar pain characteristics, some people with chronic pain recover, whereas others do not. In this review, we discuss possible contributions and interactions of biological, social, and psychological perturbations that underlie the evolution of treatment-resistant chronic pain. Behavior and brain are intimately implicated in the production and maintenance of perception. Our understandings of potential mechanisms that produce or exacerbate persistent pain remain relatively unclear. We provide an overview of these interactions and how differences in relative contribution of dimensions such as stress, age, genetics, environment, and immune responsivity may produce different risk profiles for disease development, pain severity, and chronicity. We propose the concept of "stickiness" as a soubriquet for capturing the multiple influences on the persistence of pain and pain behavior, and their stubborn resistance to therapeutic intervention. We then focus on the neurobiology of reward and aversion to address how alterations in synaptic complexity, neural networks, and systems (eg, opioidergic and dopaminergic) may contribute to pain stickiness. Finally, we propose an integration of the neurobiological with what is known about environmental and social demands on pain behavior and explore treatment approaches based on the nature of the individual's vulnerability to or protection from allostatic load.

An integrated approach to infer cross-talks between intracellular protein transport and signaling pathways

Background

The endomembrane system, known as secretory pathway, is responsible for the synthesis and transport of protein molecules in cells. Therefore, genes involved in the secretory pathway are essential for the cellular development and function. Recent scientific investigations show that ER and Golgi apparatus may provide a convenient drug target for cancer therapy. On the other hand, it is known that abundantly expressed genes in different cellular organelles share interconnected pathways and co-regulate each other activities. The cross-talks among these genes play an important role in signaling pathways, associated to the regulation of intracellular protein transport.

Results

In the present study, we device an integrated approach to understand these complex interactions. We analyze gene perturbation expression profiles, reconstruct a directed gene interaction network and decipher the regulatory interactions among genes involved in protein transport signaling. In particular, we focus on expression signatures of genes involved in the secretory pathway of MCF7 breast cancer cell line. Furthermore, network biology analysis delineates these gene-centric cross-talks at the level of specific modules/sub-networks, corresponding to different signaling pathways.

Conclusions

We elucidate the regulatory connections between genes constituting signaling pathways such as PI3K-Akt, Ras, Rap1, calcium, JAK-STAT, EFGR and FGFR signaling. Interestingly, we determine some key regulatory cross-talks between signaling pathways (PI3K-Akt signaling and Ras signaling pathway) and intracellular protein transport.

Electronic supplementary material

The online version of this article (10.1186/s12859-018-2036-2) contains supplementary material, which is available to authorized users.

A full bayesian approach for boolean genetic network inference

Boolean networks are a simple but efficient model for describing gene regulatory systems. A number of algorithms have been proposed to infer Boolean networks. However, these methods do not take full consideration of the effects of noise and model uncertainty. In this paper, we propose a full Bayesian approach to infer Boolean genetic networks. Markov chain Monte Carlo algorithms are used to obtain the posterior samples of both the network structure and the related parameters. In addition to regular link addition and removal moves, which can guarantee the irreducibility of the Markov chain for traversing the whole network space, carefully constructed mixture proposals are used to improve the Markov chain Monte Carlo convergence. Both simulations and a real application on cell-cycle data show that our method is more powerful than existing methods for the inference of both the topology and logic relations of the Boolean network from observed data.

Essential gene identification and drug target prioritization in Leishmania species

Leishmaniasis is one of the neglected tropical diseases (NTDs), mainly affecting impoverished communities and having varied ranges of pathogenicity according to the diverse spectrum of clinical manifestations. It is endemic in many countries and poses major challenges to healthcare systems in developing countries. Despite the fact that most of the current mono and combination therapies are found to be failures, clear perception of gene essentiality for parasite survival are now desideratum to identify potential biochemical targets through selection. Here we used the metabolic network of L. major, to perform a comprehensive set of in silico deletion mutants and have systematically recognized a clearly defined set of essential proteins by combining several essential criteria. In this paper we summarize the efforts to prioritize potential drug targets up to a five-fold enrichment compared with a random selection.

A bayesian framework that integrates heterogeneous data for inferring gene regulatory networks

Reconstruction of gene regulatory networks (GRNs) from experimental data is a fundamental challenge in systems biology. A number of computational approaches have been developed to infer GRNs from mRNA expression profiles. However, expression profiles alone are proving to be insufficient for inferring GRN topologies with reasonable accuracy. Recently, it has been shown that integration of external data sources (such as gene and protein sequence information, gene ontology data, protein-protein interactions) with mRNA expression profiles may increase the reliability of the inference process. Here, I propose a new approach that incorporates transcription factor binding sites (TFBS) and physical protein interactions (PPI) among transcription factors (TFs) in a Bayesian variable selection (BVS) algorithm which can infer GRNs from mRNA expression profiles subjected to genetic perturbations. Using real experimental data, I show that the integration of TFBS and PPI data with mRNA expression profiles leads to significantly more accurate networks than those inferred from expression profiles alone. Additionally, the performance of the proposed algorithm is compared with a series of least absolute shrinkage and selection operator (LASSO) regression-based network inference methods that can also incorporate prior knowledge in the inference framework. The results of this comparison suggest that BVS can outperform LASSO regression-based method in some circumstances.

Fisher's geometrical model emerges as a property of complex integrated phenotypic networks

Models relating phenotype space to fitness (phenotype-fitness landscapes) have seen important developments recently. They can roughly be divided into mechanistic models (e.g., metabolic networks) and more heuristic models like Fisher's geometrical model. Each has its own drawbacks, but both yield testable predictions on how the context (genomic background or environment) affects the distribution of mutation effects on fitness and thus adaptation. Both have received some empirical validation. This article aims at bridging the gap between these approaches. A derivation of the Fisher model "from first principles" is proposed, where the basic assumptions emerge from a more general model, inspired by mechanistic networks. I start from a general phenotypic network relating unspecified phenotypic traits and fitness. A limited set of qualitative assumptions is then imposed, mostly corresponding to known features of phenotypic networks: a large set of traits is pleiotropically affected by mutations and determines a much smaller set of traits under optimizing selection. Otherwise, the model remains fairly general regarding the phenotypic processes involved or the distribution of mutation effects affecting the network. A statistical treatment and a local approximation close to a fitness optimum yield a landscape that is effectively the isotropic Fisher model or its extension with a single dominant phenotypic direction. The fit of the resulting alternative distributions is illustrated in an empirical data set. These results bear implications on the validity of Fisher's model's assumptions and on which features of mutation fitness effects may vary (or not) across genomic or environmental contexts.

Algorithmic Perspectives of Network Transitive Reduction Problems and their Applications to Synthesis and Analysis of Biological Networks

In this survey paper, we will present a number of core algorithmic questions concerning several transitive reduction problems on network that have applications in network synthesis and analysis involving cellular processes. Our starting point will be the so-called minimum equivalent digraph problem, a classic computational problem in combinatorial algorithms. We will subsequently consider a few non-trivial extensions or generalizations of this problem motivated by applications in systems biology. We will then discuss the applications of these algorithmic methodologies in the context of three major biological research questions: synthesizing and simplifying signal transduction networks, analyzing disease networks, and measuring redundancy of biological networks.

Imputing gene expression from selectively reduced probe sets

Measuring complete gene expression profiles for a large number of experiments is costly. We propose an approach in which a small subset of probes is selected based on a preliminary set of full expression profiles. In subsequent experiments, only the subset is measured, and the missing values are imputed. We develop several algorithms to simultaneously select probes and impute missing values, and demonstrate that these probe selection for imputation (PSI) algorithms can successfully reconstruct missing gene expression values in a wide variety of applications, as evaluated using multiple metrics of biological importance. We analyze the performance of PSI methods under varying conditions, provide guidelines for choosing the optimal method based on the experimental setting, and indicate how to estimate imputation accuracy. Finally, we apply our approach to a large-scale study of immune system variation.

Causality, mediation and time: a dynamic viewpoint

Time dynamics are often ignored in causal modelling. Clearly, causality must operate in time and we show how this corresponds to a mechanistic, or system, understanding of causality. The established counterfactual definitions of direct and indirect effects depend on an ability to manipulate the mediator which may not hold in practice, and we argue that a mechanistic view may be better. Graphical representations based on local independence graphs and dynamic path analysis are used to facilitate communication as well as providing an overview of the dynamic relations 'at a glance'. The relationship between causality as understood in a mechanistic and in an interventionist sense is discussed. An example using data from the Swiss HIV Cohort Study is presented.

A review of spatial computational models for multi-cellular systems, with regard to intestinal crypts and colorectal cancer development

Colon rectal cancers (CRC) are the result of sequences of mutations which lead the intestinal tissue to develop in a carcinoma following a "progression" of observable phenotypes. The actual modeling and simulation of the key biological structures involved in this process is of interest to biologists and physicians and, at the same time, it poses significant challenges from the mathematics and computer science viewpoints. In this report we give an overview of some mathematical models for cell sorting (a basic phenomenon that underlies several dynamical processes in an organism), intestinal crypt dynamics and related problems and open questions. In particular, major attention is devoted to the survey of so-called in-lattice (or grid) models and off-lattice (off-grid) models. The current work is the groundwork for future research on semi-automated hypotheses formation and testing about the behavior of the various actors taking part in the adenoma-carcinoma progression, from regulatory processes to cell-cell signaling pathways.

A review of spatial computational models for multi-cellular systems, with regard to intestinal crypts and colorectal cancer development

Colon rectal cancers (CRC) are the result of sequences of mutations which lead the intestinal tissue to develop in a carcinoma following a "progression" of observable phenotypes. The actual modeling and simulation of the key biological structures involved in this process is of interest to biologists and physicians and, at the same time, it poses significant challenges from the mathematics and computer science viewpoints. In this report we give an overview of some mathematical models for cell sorting (a basic phenomenon that underlies several dynamical processes in an organism), intestinal crypt dynamics and related problems and open questions. In particular, major attention is devoted to the survey of so-called in-lattice (or grid) models and off-lattice (off-grid) models. The current work is the groundwork for future research on semi-automated hypotheses formation and testing about the behavior of the various actors taking part in the adenoma-carcinoma progression, from regulatory processes to cell-cell signaling pathways.

AN INTEGRATED COMPREHENSIVE WORKBENCH FOR INFERRING GENETIC NETWORKS: VOYAGENE

We propose an integrated, comprehensive network-inferring system for genetic interactions, named VoyaGene, which can analyze experimentally observed expression profiles by using and combining the following five independent inferring models: Clustering, Threshold-Test, Bayesian, multi-level digraph and S-system models. Since VoyaGene also has effective tools for visualizing the inferred results, researchers may evaluate the combination of appropriate inferring models, and can construct a genetic network to an accuracy that is beyond the reach of a single inferring model. Through the use of VoyaGene, the present study demonstrates the effectiveness of combining different inferring models.

Fitting Boolean networks from steady state perturbation data

Gene perturbation experiments are commonly used for the reconstruction of gene regulatory networks. Typical experimental methodology imposes persistent changes on the network. The resulting data must therefore be interpreted as a steady state from an altered gene regulatory network, rather than a direct observation of the original network. In this article an implicit modeling methodology is proposed in which the unperturbed network of interest is scored by first modeling the persistent perturbation, then predicting the steady state, which may then be compared to the observed data. This results in a many-to-one inverse problem, so a computational Bayesian approach is used to assess model uncertainty. The methodology is first demonstrated on a number of synthetic networks. It is shown that the Bayesian approach correctly assigns high posterior probability to the network structure and steady state behavior. Further, it is demonstrated that where uncertainty of model features is indicated, the uncertainty may be accurately resolved with further perturbation experiments. The methodology is then applied to the modeling of a gene regulatory network using perturbation data from nine genes which have been shown to respond synergistically to known oncogenic mutations. A hypothetical model emerges which conforms to reported regulatory properties of these genes. Furthermore, the Bayesian methodology is shown to be consistent in the sense that multiple randomized applications of the fitting algorithm converge to an approximately common posterior density on the space of models. Such consistency is generally not feasible for algorithms which report only single models. We conclude that fully Bayesian methods, coupled with models which accurately account for experimental constraints, are a suitable tool for the inference of gene regulatory networks, in terms of accuracy, estimation of model uncertainty, and experimental design.

Computationally efficient measure of topological redundancy of biological and social networks

It is well known that biological and social interaction networks have a varying degree of redundancy, though a consensus of the precise cause of this is so far lacking. In this paper, we introduce a topological redundancy measure for labeled directed networks that is formal, computationally efficient, and applicable to a variety of directed networks such as cellular signaling, and metabolic and social interaction networks. We demonstrate the computational efficiency of our measure by computing its value and statistical significance on a number of biological and social networks with up to several thousands of nodes and edges. Our results suggest a number of interesting observations: (1) Social networks are more redundant that their biological counterparts, (2) transcriptional networks are less redundant than signaling networks, (3) the topological redundancy of the C. elegans metabolic network is largely due to its inclusion of currency metabolites, and (4) the redundancy of signaling networks is highly (negatively) correlated with the monotonicity of their dynamics.

An approach to inferring transcriptional regulation among genes from large-scale expression data

The use of DNA microarrays opens up the possibility of measuring the expression levels of thousands of genes simultaneously under different conditions. Time-course experiments allow researchers to study the dynamics of gene interactions. The inference of genetic networks from such measures can give important insights for the understanding of a variety of biological problems. Most of the existing methods for genetic network reconstruction require many experimental data points, or can only be applied to the reconstruction of small subnetworks. Here we present a method that reduces the dimensionality of the dataset and then extracts the significant dynamic correlations among genes. The method requires a number of points achievable in common time-course experiments.

Learning about gene regulatory networks from gene deletion experiments

Gene regulatory networks are a major focus of interest in molecular biology. A crucial question is how complex regulatory systems are encoded and controlled by the genome. Three recent publications have raised the question of what can be learned about gene regulatory networks from microarray experiments on gene deletion mutants. Using this indirect approach, topological features such as connectivity and modularity have been studied.

Selection of statistical thresholds in graphical models

Reconstruction of gene regulatory networks based on experimental data usually relies on statistical evidence, necessitating the choice of a statistical threshold which defines a significant biological effect. Approaches to this problem found in the literature range from rigorous multiple testing procedures to ad hoc P-value cut-off points. However, when the data implies graphical structure, it should be possible to exploit this feature in the threshold selection process. In this article we propose a procedure based on this principle. Using coding theory we devise a measure of graphical structure, for example, highly connected nodes or chain structure. The measure for a particular graph can be compared to that of a random graph and structure inferred on that basis. By varying the statistical threshold the maximum deviation from random structure can be estimated, and the threshold is then chosen on that basis. A global test for graph structure follows naturally.

Inference of signal transduction networks from double causal evidence

Here, we present a novel computational method, and related software, to synthesize signal transduction networks from single and double causal evidences. This is a significant and topical problem because there are currently no high-throughput experimental methods for constructing signal transduction networks, and because the understanding of many signaling processes is limited to the knowledge of the signal(s) and of key mediators' positive or negative effects on the whole process. Our software NET-SYNTHESIS is freely downloadable from http://www.cs.uic.edu/∼dasgupta/network-synthesis/ .Our methodology serves as an important first step in formalizing the logical substrate of a signal transduction network, allowing biologists to simultaneously synthesize their knowledge and formalize their hypotheses regarding a signal transduction network. Therefore, we expect that our work will appeal to a broad audience of biologists. The novelty of our algorithmic methodology based on nontrivial combinatorial optimization techniques makes it appealing to computational biologists as well.

Modeling QTL for complex traits: detection and context for plant breeding

The genetic architecture of a trait is defined by the set of genes contributing to genetic variation within a reference population of genotypes together with information on their location in the genome and the effects of their alleles on traits, including intra-locus and inter-locus interactions, environmental dependencies, and pleiotropy. Accumulated evidence from trait mapping studies emphasizes that plant breeders work within a trait genetic complexity continuum. Some traits show a relatively simple genetic architecture while others, such as grain yield, have a complex architecture. An important advance is that we now have empirical genetic models of trait genetic architecture obtained from mapping studies (multi-QTL models including various genetic effects that may vary in relation to environmental factors) to ground theoretical investigations on the merits of alternative breeding strategies. Such theoretical studies indicate that as the genetic complexity of traits increases the opportunities for realizing benefits from molecular enhanced breeding strategies increase. To realize these potential benefits and enable the plant breeder to increase rate of genetic gain for complex traits it is anticipated that the empirical genetic models of trait genetic architecture used for predicting trait variation will need to incorporate the effects of genetic interactions and be interpreted within a genotype-environment-management framework for the target agricultural production system.

Modeling the temporal interplay of molecular signaling and gene expression by using dynamic nested effects models

Cellular decision making in differentiation, proliferation, or cell death is mediated by molecular signaling processes, which control the regulation and expression of genes. Vice versa, the expression of genes can trigger the activity of signaling pathways. We introduce and describe a statistical method called Dynamic Nested Effects Model (D-NEM) for analyzing the temporal interplay of cell signaling and gene expression. D-NEMs are Bayesian models of signal propagation in a network. They decompose observed time delays of multiple step signaling processes into single steps. Time delays are assumed to be exponentially distributed. Rate constants of signal propagation are model parameters, whose joint posterior distribution is assessed via Gibbs sampling. They hold information on the interplay of different forms of biological signal propagation. Molecular signaling in the cytoplasm acts at high rates, direct signal propagation via transcription and translation act at intermediate rates, while secondary effects operate at low rates. D-NEMs allow the dissection of biological processes into signaling and expression events, and analysis of cellular signal flow. An application of D-NEMs to embryonic stem cell development in mice reveals a feed-forward loop dominated network, which stabilizes the differentiated state of cells and points to Nanog as the key sensitizer of stem cells for differentiation stimuli.

In silico evidence for functional specialization after genome duplication in yeast

A fairly recent whole-genome duplication (WGD) event in yeast enables the effects of gene duplication and subsequent functional divergence to be characterized. We examined 15 ohnolog pairs (i.e. paralogs from a WGD) out of c. 500 Saccharomyces cerevisiae ohnolog pairs that have persisted over an estimated 100 million years of evolution. These 15 pairs were chosen for their high levels of asymmetry, i.e. within the pair, one ohnolog had evolved much faster than the other. Sequence comparisons of the 15 pairs revealed that the faster evolving duplicated genes typically appear to have experienced partially--but not fully--relaxed negative selection as evidenced by an average nonsynonymous/synonymous substitution ratio (dN/dS(avg)=0.44) that is higher than the slow-evolving genes' ratio (dN/dS(avg)=0.14) but still <1. Increased number of insertions and deletions in the fast-evolving genes also indicated loosened structural constraints. Sequence and structural comparisons indicated that a subset of these pairs had significant differences in their catalytically important residues and active or cofactor-binding sites. A literature survey revealed that several of the fast-evolving genes have gained a specialized function. Our results indicate that subfunctionalization and even neofunctionalization has occurred along with degenerative evolution, in which unneeded functions were destroyed by mutations.

Identification of an inter-transcription factor regulatory network in human hepatoma cells by Matrix RNAi

Transcriptional regulation by transcriptional regulatory factors (TRFs) of their target TRF genes is central to the control of gene expression. To study a static multi-tiered inter-TRF regulatory network in the human hepatoma cells, we have applied a Matrix RNAi approach in which siRNA knockdown and quantitative RT-PCR are used in combination on the same set of TRFs to determine their interdependencies. This approach focusing on several liver-enriched TRF families, each of which consists of structurally homologous members, revealed many significant regulatory relationships. These include the cross-talks between hepatocyte nuclear factors (HNFs) and the other TRF groups such as CCAAT/enhancer-binding proteins (CEBPs), retinoic acid receptors (RARs), retinoid receptors (RXRs) and RAR-related orphan receptors (RORs), which play key regulatory functions in human hepatocytes and liver. In addition, various multi-component regulatory motifs, which make up the complex inter-TRF regulatory network, were identified. A large part of the regulatory edges identified by the Matrix RNAi approach could be confirmed by chromatin immunoprecipitation. The resultant significant edges enabled us to depict the inter-TRF TRN forming an apparent regulatory hierarchy of (FOXA1, RXRA) → TCF1 → (HNF4A, ONECUT1) → (RORC, CEBPA) as the main streamline.

Biological Network Inference and analysis using SEBINI and CABIN

Attaining a detailed understanding of the various biological networks in an organism lies at the core of the emerging discipline of systems biology. A precise description of the relationships formed between genes, mRNA molecules, and proteins is a necessary step toward a complete description of the dynamic behavior of an organism at the cellular level, and toward intelligent, efficient, and directed modification of an organism. The importance of understanding such regulatory, signaling, and interaction networks has fueled the development of numerous in silico inference algorithms, as well as new experimental techniques and a growing collection of public databases. The Software Environment for BIological Network Inference (SEBINI) has been created to provide an interactive environment for the deployment, evaluation, and improvement of algorithms used to reconstruct the structure of biological regulatory and interaction networks. SEBINI can be used to analyze high-throughput gene expression, protein abundance, or protein activation data via a suite of state-of-the-art network inference algorithms. It also allows algorithm developers to compare and train network inference methods on artificial networks and simulated gene expression perturbation data. SEBINI can therefore be used by software developers wishing to evaluate, refine, or combine inference techniques, as well as by bioinformaticians analyzing experimental data. Networks inferred from the SEBINI software platform can be further analyzed using the Collective Analysis of Biological Interaction Networks (CABIN) tool, which is an exploratory data analysis software that enables integration and analysis of protein-protein interaction and gene-to-gene regulatory evidence obtained from multiple sources. The collection of edges in a public database, along with the confidence held in each edge (if available), can be fed into CABIN as one "evidence network," using the Cytoscape SIF file format. Using CABIN, one may increase the confidence in individual edges in a network inferred by an algorithm in SEBINI, as well as extend such a network by combining it with species-specific or generic information, e.g., known protein-protein interactions or target genes identified for known transcription factors. Thus, the combined SEBINI-CABIN toolkit aids in the more accurate reconstruction of biological networks, with less effort, in less time.A demonstration web site for SEBINI can be accessed from https://www.emsl.pnl.gov/SEBINI/RootServlet . Source code and PostgreSQL database schema are available under open source license.

CONTACT

ronald.taylor@pnl.gov. For commercial use, some algorithms included in SEBINI require licensing from the original developers. CABIN can be downloaded from http://www.sysbio.org/dataresources/cabin.stm .

CONTACT

mudita.singhal@pnl.gov.

Discrimination of direct and indirect interactions in a network of regulatory effects

The matter of concern are algorithms for the discrimination of direct from indirect regulatory effects from an interaction graph built up by error-prone measurements. Many of these algorithms can be cast as a rule for the removal of a single edge of the graph, such that the remaining graph is still consistent with the data. A set of mild conditions is given under which iterated application of such a rule leads to a unique minimal consistent graph. We show that three of the common methods for direct interactions search fulfill these conditions, thus providing a justification of their use. The main issues a reconstruction algorithm has to deal with, are the noise in the data, the presence of regulatory cycles, and the direction of the regulatory effects. We introduce a novel rule that, in contrast to the previously mentioned methods, simultaneously takes into account all these aspects. An efficient algorithm for the computation of the minimal graph is given, whose time complexity is cubic in the number of vertices of the graph. Finally, we demonstrate the utility of our method in a simulation study.

Evidence of Highly Regulated Genes (in-Hubs) in Gene Networks of Saccharomyces Cerevisiae

Uncovering interactions between genes, gene networks, is important to increase our understanding of intrinsic cellular processes and responses to external stimuli such as drugs. Gene networks can be computationally inferred from repeated measurements of gene expression, using algorithms, which assume that each gene is controlled by only a small number of other proteins. Here, by extending the transcription network with cofactors (defined from protein-protein binding data) as active regulators, we identified the effective gene network, providing evidence of in-hubs in the gene regulatory networks of yeast. Then, using the notion that in-hub genes will be differentially expressed over several experimental conditions, we designed an algorithm, the HubDetector, enabling identification of in-hubs directly from gene expression data. Applying the HubDetector to 488 genome-wide expression profiles from two independent datasets, we identified putative in-hubs overlapping significantly with in-hubs in the effective gene network.

Extracting three-way gene interactions from microarray data

MOTIVATION

It is an important and difficult task to extract gene network information from high-throughput genomic data. A common approach is to cluster genes using pairwise correlation as a distance metric. However, pairwise correlation is clearly too simplistic to describe the complex relationships among real genes since co-expression relationships are often restricted to a specific set of biological conditions/processes. In this study, we described a three-way gene interaction model that captures the dynamic nature of co-expression relationship between a gene pair through the introduction of a controller gene.

RESULTS

We surveyed 0.4 billion possible three-way interactions among 1000 genes in a microarray dataset containing 678 human cancer samples. To test the reproducibility and statistical significance of our results, we randomly split the samples into a training set and a testing set. We found that the gene triplets with the strongest interactions (i.e. with the smallest P-values from appropriate statistical tests) in the training set also had the strongest interactions in the testing set. A distinctive pattern of three-way interaction emerged from these gene triplets: depending on the third gene being expressed or not, the remaining two genes can be either co-expressed or mutually exclusive (i.e. expression of either one of them would repress the other). Such three-way interactions can exist without apparent pairwise correlations. The identified three-way interactions may constitute candidates for further experimentation using techniques such as RNA interference, so that novel gene network or pathways could be identified.

Inferring cellular networks--a review

In this review we give an overview of computational and statistical methods to reconstruct cellular networks. Although this area of research is vast and fast developing, we show that most currently used methods can be organized by a few key concepts. The first part of the review deals with conditional independence models including Gaussian graphical models and Bayesian networks. The second part discusses probabilistic and graph-based methods for data from experimental interventions and perturbations.

A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence

In this paper, we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed causal relationships as network paths and using techniques from combinatorial optimization to find the sparsest graph consistent with all experimental observations. Our contributions are twofold: (a) We formalize our approach, study its computational complexity and prove new results for exact and approximate solutions of the computationally hard transitive reduction substep of the approach (Sections 2 and 5). (b) We validate the biological usability of our approach by successfully applying it to a previously published signal transduction network by Li et al. (2006) and show that our algorithm for the transitive reduction substep performs well on graphs with a structure similar to those observed in transcriptional regulatory and signal transduction networks.

A statistical method to incorporate biological knowledge for generating testable novel gene regulatory interactions from microarray experiments

Background

The incorporation of prior biological knowledge in the analysis of microarray data has become important in the reconstruction of transcription regulatory networks in a cell. Most of the current research has been focused on the integration of multiple sets of microarray data as well as curated databases for a genome scale reconstruction. However, individual researchers are more interested in the extraction of most useful information from the data of their hypothesis-driven microarray experiments. How to compile the prior biological knowledge from literature to facilitate new hypothesis generation from a microarray experiment is the focus of this work. We propose a novel method based on the statistical analysis of reported gene interactions in PubMed literature.

Results

Using Gene Ontology (GO) Molecular Function annotation for reported gene regulatory interactions in PubMed literature, a statistical analysis method was proposed for the derivation of a likelihood of interaction (LOI) score for a pair of genes. The LOI-score and the Pearson correlation coefficient of gene profiles were utilized to check if a pair of query genes would be in the above specified interaction. The method was validated in the analysis of two gene sets formed from the yeast Saccharomyces cerevisiae cell cycle microarray data. It was found that high percentage of identified interactions shares GO Biological Process annotations (39.5% for a 102 interaction enriched gene set and 23.0% for a larger 999 cyclically expressed gene set).

Conclusion

This method can uncover novel biologically relevant gene interactions. With stringent confidence levels, small interaction networks can be identified for further establishment of a hypothesis testable by biological experiment. This procedure is computationally inexpensive and can be used as a preprocessing procedure for screening potential biologically relevant gene pairs subject to the analysis with sophisticated statistical methods.

Nested effects models for high-dimensional phenotyping screens

MOTIVATION

In high-dimensional phenotyping screens, a large number of cellular features is observed after perturbing genes by knockouts or RNA interference. Comprehensive analysis of perturbation effects is one of the most powerful techniques for attributing functions to genes, but not much work has been done so far to adapt statistical and computational methodology to the specific needs of large-scale and high-dimensional phenotyping screens.

RESULTS

We introduce and compare probabilistic methods to efficiently infer a genetic hierarchy from the nested structure of observed perturbation effects. These hierarchies elucidate the structures of signaling pathways and regulatory networks. Our methods achieve two goals: (1) they reveal clusters of genes with highly similar phenotypic profiles, and (2) they order (clusters of) genes according to subset relationships between phenotypes. We evaluate our algorithms in the controlled setting of simulation studies and show their practical use in two experimental scenarios: (1) a data set investigating the response to microbial challenge in Drosophila melanogaster, and (2) a compendium of expression profiles of Saccharomyces cerevisiae knockout strains. We show that our methods identify biologically justified genetic hierarchies of perturbation effects.

AVAILABILITY

The software used in our analysis is freely available in the R package 'nem' from www.bioconductor.org.

Bayesian Orthogonal Least Squares (BOLS) algorithm for reverse engineering of gene regulatory networks

Background

A reverse engineering of gene regulatory network with large number of genes and limited number of experimental data points is a computationally challenging task. In particular, reverse engineering using linear systems is an underdetermined and ill conditioned problem, i.e. the amount of microarray data is limited and the solution is very sensitive to noise in the data. Therefore, the reverse engineering of gene regulatory networks with large number of genes and limited number of data points requires rigorous optimization algorithm.

Results

This study presents a novel algorithm for reverse engineering with linear systems. The proposed algorithm is a combination of the orthogonal least squares, second order derivative for network pruning, and Bayesian model comparison. In this study, the entire network is decomposed into a set of small networks that are defined as unit networks. The algorithm provides each unit network with P(D|H_i), which is used as confidence level. The unit network with higher P(D|H_i) has a higher confidence such that the unit network is correctly elucidated. Thus, the proposed algorithm is able to locate true positive interactions using P(D|H_i), which is a unique property of the proposed algorithm.

The algorithm is evaluated with synthetic and Saccharomyces cerevisiae expression data using the dynamic Bayesian network. With synthetic data, it is shown that the performance of the algorithm depends on the number of genes, noise level, and the number of data points. With Yeast expression data, it is shown that there is remarkable number of known physical or genetic events among all interactions elucidated by the proposed algorithm.

The performance of the algorithm is compared with Sparse Bayesian Learning algorithm using both synthetic and Saccharomyces cerevisiae expression data sets. The comparison experiments show that the algorithm produces sparser solutions with less false positives than Sparse Bayesian Learning algorithm.

Conclusion

From our evaluation experiments, we draw the conclusion as follows: 1) Simulation results show that the algorithm can be used to elucidate gene regulatory networks using limited number of experimental data points. 2) Simulation results also show that the algorithm is able to handle the problem with noisy data. 3) The experiment with Yeast expression data shows that the proposed algorithm reliably elucidates known physical or genetic events. 4) The comparison experiments show that the algorithm more efficiently performs than Sparse Bayesian Learning algorithm with noisy and limited number of data.

Application of bioinformatics for DNA microarray data to bioscience, bioengineering and medical fields

In the 1990s, DNA microarray or DNA chip as a novel biological experimental technology was developed, which enables the comprehensive measurement of the expression levels of hundreds of genes, simultaneously. Using this technique, a comprehensive understanding of the cell can be achieved. However, because even simple life forms, such as microorganisms, have more than a thousand kinds of genes, the data from a DNA chip cannot be analyzed without statistical and informational technology. Bioinformatics is the interdisciplinary research field integrating molecular biology with informatics, and it is expected to have a huge impact on the bioscientific, bioengineering and medical fields. There are many techniques in bioinformatics for the analysis of DNA microarray data; however, these are mainly divided into fold-change analysis, clustering, classification, genetic network analysis, and simulation. In this review, these techniques are briefly explained by using some examples.

Multi-target strategies for the improved treatment of depressive states: Conceptual foundations and neuronal substrates, drug discovery and therapeutic application

Major depression is a debilitating and recurrent disorder with a substantial lifetime risk and a high social cost. Depressed patients generally display co-morbid symptoms, and depression frequently accompanies other serious disorders. Currently available drugs display limited efficacy and a pronounced delay to onset of action, and all provoke distressing side effects. Cloning of the human genome has fuelled expectations that symptomatic treatment may soon become more rapid and effective, and that depressive states may ultimately be "prevented" or "cured". In pursuing these objectives, in particular for genome-derived, non-monoaminergic targets, "specificity" of drug actions is often emphasized. That is, priority is afforded to agents that interact exclusively with a single site hypothesized as critically involved in the pathogenesis and/or control of depression. Certain highly selective drugs may prove effective, and they remain indispensable in the experimental (and clinical) evaluation of the significance of novel mechanisms. However, by analogy to other multifactorial disorders, "multi-target" agents may be better adapted to the improved treatment of depressive states. Support for this contention is garnered from a broad palette of observations, ranging from mechanisms of action of adjunctive drug combinations and electroconvulsive therapy to "network theory" analysis of the etiology and management of depressive states. The review also outlines opportunities to be exploited, and challenges to be addressed, in the discovery and characterization of drugs recognizing multiple targets. Finally, a diversity of multi-target strategies is proposed for the more efficacious and rapid control of core and co-morbid symptoms of depression, together with improved tolerance relative to currently available agents.

Gene connectivity, function, and sequence conservation: predictions from modular yeast co-expression networks

Background

Genes and proteins are organized into functional modular networks in which the network context of a gene or protein has implications for cellular function. Highly connected hub proteins, largely responsible for maintaining network connectivity, have been found to be much more likely to be essential for yeast survival.

Results

Here we investigate the properties of weighted gene co-expression networks formed from multiple microarray datasets. The constructed networks approximate scale-free topology, but this is not universal across all datasets. We show strong positive correlations between gene connectivity within the whole network and gene essentiality as well as gene sequence conservation. We demonstrate the preservation of a modular structure of the networks formed, and demonstrate that, within some of these modules, it is possible to observe a strong correlation between connectivity and essentiality or between connectivity and conservation within the modules particularly within modules containing larger numbers of essential genes.

Conclusion

Application of these techniques can allow a finer scale prediction of relative gene importance for a particular process within a group of similarly expressed genes.

Detection of compound mode of action by computational integration of whole-genome measurements and genetic perturbations

Background

A key problem of drug development is to decide which compounds to evaluate further in expensive clinical trials (Phase I- III). This decision is primarily based on the primary targets and mechanisms of action of the chemical compounds under consideration. Whole-genome expression measurements have shown to be useful for this process but current approaches suffer from requiring either a large number of mutant experiments or a detailed understanding of the regulatory networks.

Results

We have designed an algorithm, CutTree that when applied to whole-genome expression datasets identifies the primary affected genes (PAGs) of a chemical compound by separating them from downstream, indirectly affected genes. Unlike previous methods requiring whole-genome deletion libraries or a complete map of gene network architecture, CutTree identifies PAGs from a limited set of experimental perturbations without requiring any prior information about the underlying pathways. The principle for CutTree is to iteratively filter out PAGs from other recurrently active genes (RAGs) that are not PAGs. The in silico validation predicted that CutTree should be able to identify 3–4 out of 5 known PAGs (~70%). In accordance, when we applied CutTree to whole-genome expression profiles from 17 genetic perturbations in the presence of galactose in Yeast, CutTree identified four out of five known primary galactose targets (80%). Using an exhaustive search strategy to detect these PAGs would not have been feasible (>10¹² combinations).

Conclusion

In combination with genetic perturbation techniques like short interfering RNA (siRNA) followed by whole-genome expression measurements, CutTree sets the stage for compound target identification in less well-characterized but more disease-relevant mammalian cell systems.

Inferring gene networks from steady-state response to single-gene perturbations

Inferring gene networks from gene expression data is an important step in understanding the molecular machinery of life. Three methods for establishing and quantifying causal relationships between genes based on steady-state measurements in single-gene perturbation experiments have recently been proposed: the regulatory strength method, the local regulatory strength method, and Gardner's method. The theoretical basis of these methods is presented here in a thorough and consistent fashion. In principle, for the same data set all three methods would generate identical networks, but they would quantify the strengths of connections in different ways. The regulatory strength method is shown here to be topology-dependent. It adopts the format of the data collected in gene expression microarray experiments and therefore can be immediately used with this technology. The regulatory strengths obtained by this method can also be used to compute local regulatory strengths. In contrast, Gardner's method requires both measurements of mRNA concentrations and measurements of the applied rate perturbations, which is not usually part of a standard microarray experimental protocol. The results generated by Gardner's method and by the two regulatory strengths methods differ only by scaling constants, but Gardner's method requires more measurements. On the other hand, the explicit use of rate perturbations in Gardner's approach allows one to address new questions with this method, like what perturbations caused given responses of the system. Results of the application of the three techniques to real experimental data are presented and discussed. The comparative analysis presented in this paper can be helpful for identifying an appropriate technique for inferring genetic networks and for interpreting the results of its application to experimental data.

Gene-to-phenotype models and complex trait genetics

The premise that is explored in this paper is that in some cases, in order to make progress in the design of molecular breeding strategies for complex traits, we will need a theoretical framework for quantitative genetics that is grounded in the concept of gene-networks. We seek to develop a gene-to-phenotype (G→P) modelling framework for quantitative genetics that explicitly deals with the context-dependent gene effects that are attributed to genes functioning within networks, i.e. epistasis, gene × environment interactions, and pleiotropy. The E(NK) model is discussed as a starting point for building such a theoretical framework for complex trait genetics. Applying this framework to a combination of theoretical and empirical G→P models, we find that although many of the context-dependent effects of genetic variation on phenotypic variation can reduce the rate of genetic progress from breeding, it is possible to design molecular breeding strategies for complex traits that on average will outperform phenotypic selection. However, to realise these potential advantages, empirical G→P models of the traits will need to take into consideration the context-dependent effects that are a consequence of epistasis, gene × environment interactions, and pleiotropy. Some promising G→P modelling directions are discussed.

ChIP-chip: considerations for the design, analysis, and application of genome-wide chromatin immunoprecipitation experiments

Chromatin immunoprecipitation (ChIP) is a well-established procedure to investigate interactions between proteins and DNA. Coupled with whole-genome DNA microarrays, ChIPS allow one to determine the entire spectrum of in vivo DNA binding sites for any given protein. The design and analysis of ChIP-microarray (also called ChIP-chip) experiments differ significantly from the conventions used for locus ChIP approaches and ChIP-chip experiments, and these differences require new methods of analysis. In this light, we review the design of DNA microarrays, the selection of controls, the level of repetition required, and other critical parameters for success in the design and analysis of ChIP-chip experiments, especially those conducted in the context of mammalian or other relatively large genomes.

Transcriptional networks and cellular senescence in human mammary fibroblasts

Senescence, the molecular program that limits the finite proliferative potential of a cell, acts as an important barrier to protect the body from cancer. Techniques for measuring transcriptome changes and for modulating their expression suggest that it may be possible to dissect the transcriptional networks underlying complex cellular processes. HMF3A cells are conditionally immortalized human mammary fibroblasts that can be induced to undergo coordinated senescence. Here, we used these cells in conjunction with microarrays, RNA interference, and in silico promoter analysis to promote the dissection of the transcriptional networks responsible for regulating cellular senescence. We first identified changes in the transcriptome when HMF3A cells undergo senescence and then compared them with those observed upon replicative senescence in primary human mammary fibroblasts. In addition to DUSP1 and known p53 and E2F targets, a number of genes such as PHLDA1, NR4A3, and a novel splice variant of STAC were implicated in senescence. Their role in senescence was then analyzed by RNA silencing followed by microarray analysis. In silico promoter analysis of all differential genes predicted that nuclear factor-kappaB and C/EBP transcription factors are activated upon senescence, and we confirmed this by electrophoretic mobility shift assay. The results suggest a putative signaling network for cellular senescence.