DBRF–MEGN method: an algorithm for deducing minimum equivalent gene networks from large-scale gene expression profiles of gene deletion mutants

Abstract

Motivation: Large-scale gene expression profiles measured in gene deletion mutants are invaluable sources for identifying gene regulatory networks. Signed directed graph (SDG) is the most common representation of gene networks in genetics and cell biology. However, no practical procedure that deduces SDGs consistent with such profiles has been developed. Results: We developed the DBRF–MEGN (difference-based regulation finding–minimum equivalent gene network) method in which an algorithm deduces the most parsimonious SDGs consistent with expression profiles of gene deletion mutants. Positive (or negative) directed edges representing positive (or negative) gene regulations are deduced by comparing the gene expression level between the wild-type and mutant. The most parsimonious SDGs are deduced using graph theoretical procedures. Compensation for excess removal of edges by restoring a minimum number of edges makes the method applicable to cyclic gene networks. Use of independent groups of edges greatly reduces the computational cost, thus making the method applicable to large-scale expression profiles. We confirmed the applicability of our method by applying it to the gene expression profiles of 265 Saccharomyces cerevisiae deletion mutants, and we confirmed our method's validity by comparing the pheromone response pathway, general amino acid control system, and copper and iron homeostasis system deduced by our method with those reported in the literature. Interpretation of the gene network deduced from the S. cerevisiae expression profiles by using our method led to the prediction of 132 transcriptional targets and modulators of transcriptional activity of 18 transcriptional regulators. Availability: The software is available on request. Supplementary information: http://www.so.bio.keio.ac.jp/dbrf-megn/

A proof of the DBRF-MEGN method, an algorithm for deducing minimum equivalent gene networks

“…These thresholds can be specified by various procedures such as by using fold-change or the statistical significance of the expression level [7,8,14,19,20]. …”

Systems‐based understanding of pharmacological responses with combinations of multidisciplinary methodologies

“…This difference makes it difficult to judge which of these molecules has the greatest impact on network behavior. There are several methods we can use to determine the relative importance of the molecules, all of which are based on mathematical graph theory [37][38][39][40][41]. The simplest way is to simply count the number of pathways that lead into and out of each molecule node, which are defined as degree in and degree out , respectively.…”

Reverse engineering gene regulatory networks

“…Such models reveal connections between the regulatory networks and data, providing clues for uncovering the network from data. Modeling has been a vital topic in the GRNs research and a large body of work exists including, most noticeably, (probabilistic) Boolean networks [2], Bayesian networks [1], signed directed graphs (SDG) [3], and differential equations [4]. Our focus in this article is statistical models appropriate for inferential computations used in reverse engineering GRNs, rather than those for network simulations.…”