A Posterior Probability Approach for Gene Regulatory Network Inference in Genetic Perturbation Data

Inferring gene regulatory networks is an important problem in systems biology. However, these networks can be hard to infer from experimental data because of the inherent variability in biological data as well as the large number of genes involved. We propose a fast, simple method for inferring regulatory relationships between genes from knockdown experiments in the NIH LINCS dataset by calculating posterior probabilities, incorporating prior information. We show that the method is able to find previously identified edges from TRANSFAC and JASPAR and discuss the merits and limitations of this approach

How to understand the cell by breaking it: network analysis of gene perturbation screens

Modern high-throughput gene perturbation screens are key technologies at the forefront of genetic research. Combined with rich phenotypic descriptors they enable researchers to observe detailed cellular reactions to experimental perturbations on a genome-wide scale. This review surveys the current state-of-the-art in analyzing perturbation screens from a network point of view. We describe approaches to make the step from the parts list to the wiring diagram by using phenotypes for network inference and integrating them with complementary data sources. The first part of the review describes methods to analyze one- or low-dimensional phenotypes like viability or reporter activity; the second part concentrates on high-dimensional phenotypes showing global changes in cell morphology, transcriptome or proteome.Comment: Review based on ISMB 2009 tutorial; after two rounds of revisio

Systems analysis of host-parasite interactions.

Parasitic diseases caused by protozoan pathogens lead to hundreds of thousands of deaths per year in addition to substantial suffering and socioeconomic decline for millions of people worldwide. The lack of effective vaccines coupled with the widespread emergence of drug-resistant parasites necessitates that the research community take an active role in understanding host-parasite infection biology in order to develop improved therapeutics. Recent advances in next-generation sequencing and the rapid development of publicly accessible genomic databases for many human pathogens have facilitated the application of systems biology to the study of host-parasite interactions. Over the past decade, these technologies have led to the discovery of many important biological processes governing parasitic disease. The integration and interpretation of high-throughput -omic data will undoubtedly generate extraordinary insight into host-parasite interaction networks essential to navigate the intricacies of these complex systems. As systems analysis continues to build the foundation for our understanding of host-parasite biology, this will provide the framework necessary to drive drug discovery research forward and accelerate the development of new antiparasitic therapies

Using temporal correlation in factor analysis for reconstructing transcription factor activities

Two-level gene regulatory networks consist of the transcription factors (TFs) in the top level and their regulated genes in the second level. The expression profiles of the regulated genes are the observed high-throughput data given by experiments such as microarrays. The activity profiles of the TFs are treated as hidden variables as well as the connectivity matrix that indicates the regulatory relationships of TFs with their regulated genes. Factor analysis (FA) as well as other methods, such as the network component algorithm, has been suggested for reconstructing gene regulatory networks and also for predicting TF activities. They have been applied to E. coli and yeast data with the assumption that these datasets consist of identical and independently distributed samples. Thus, the main drawback of these algorithms is that they ignore any time correlation existing within the TF profiles. In this paper, we extend previously studied FA algorithms to include time correlation within the transcription factors. At the same time, we consider connectivity matrices that are sparse in order to capture the existing sparsity present in gene regulatory networks. The TFs activity profiles obtained by this approach are significantly smoother than profiles from previous FA algorithms. The periodicities in profiles from yeast expression data become prominent in our reconstruction. Moreover, the strength of the correlation between time points is estimated and can be used to assess the suitability of the experimental time interval

Rank-based edge reconstruction for scale-free genetic regulatory networks

<p>Abstract</p> <p>Background</p> <p>The reconstruction of genetic regulatory networks from microarray gene expression data has been a challenging task in bioinformatics. Various approaches to this problem have been proposed, however, they do not take into account the topological characteristics of the targeted networks while reconstructing them.</p> <p>Results</p> <p>In this study, an algorithm that explores the scale-free topology of networks was proposed based on the modification of a rank-based algorithm for network reconstruction. The new algorithm was evaluated with the use of both simulated and microarray gene expression data. The results demonstrated that the proposed algorithm outperforms the original rank-based algorithm. In addition, in comparison with the Bayesian Network approach, the results show that the proposed algorithm gives much better recovery of the underlying network when sample size is much smaller relative to the number of genes.</p> <p>Conclusion</p> <p>The proposed algorithm is expected to be useful in the reconstruction of biological networks whose degree distributions follow the scale-free topology.</p