Skip to main content
Figure 1 | Source Code for Biology and Medicine

Figure 1

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

Figure 1

An example of the deduction of MEGNs from the expression profiles of gene deletion mutants. (a) An assumption used in the DBRF-MEGN method. (b) Deduction of the initially deduced edges. The matrix represents a set of expression profiles and the schematic represents a set of initially deduced edges. In the matrix, A, B, ... represent expression levels of gene A, gene B, ..., and aΔ, bΔ, ... represent deletion mutants of gene A, B, ... The up (down) arrows indicate that the gene expression levels are higher (lower) in the deletion mutant than in the wild type. (c) Essential edges. Non-essential edges are gray-dotted. (d) Uncovered edges. Uncovered edges are gray-dotted and covered edges are black-dotted. (e) Exclusion of uncovered edges in peripheral components. , , , and are uncovered edges in peripheral components. The resulting four gray-dotted edges are uncovered edges in main components. (f) Independent groups of uncovered edges in main components. For each group, the minimum number of edges with which essential edges can explain all edges in the group are shown: (E, J) or (F, J) for G0, and (H, K) or (H, L) for G1. (g) Four MEGNs of the profiles. Combinations of the minimum numbers of edges of two independent groups (G0 and G1) produce all four MEGNs.

Back to article page