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

Figure 4

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

Figure 4

Example of uncovered edges in peripheral and main components. (a) Initially deduced edges (E ide ). (b) Essential edges (E es ). Non-essential edges are dotted. (c) Uncovered edges (E ucv ). Because all non-essential edges cannot be covered by essential edges, the non-essential edges are called uncovered edges (E ucv ). (d) Uncovered edges in peripheral components (gray-dotted). (B, D) and (B, E) are uncovered edges in peripheral components because (B, E) does not explain any other edges in E ucv with an edge in E ide , and (B, D) does not explain any other edges in E ucv except (B, E) with an edge in E ide . (A, C) and (B, C) are uncovered edges in main components. If edges in a MEGN cover (A, C) and (B, C), the edges also cover (B, D) and (B, E). (B, D) and (B, E) cover no edges except themselves. Thus, (B, D) and (B, E) are not included in the MEGNs.

Back to article page