Figure 5.

Directed acyclic graph [DAG] depicting a conditional probabilistic Bayesian network. Strength and direction of associations based on the hill-climbing algorithm with 1000 bootstraps. Edges [arrows] connecting the nodes represent probabilistic dependencies, and associations with strength ≥0.6 are shown. Labels of edges indicate the strength of associations. Nodes with no edges indicate conditional independence. A] Non-inflamed sigmoid colon mucosa. B] Inflamed sigmoid colon mucosa. Strength of an interaction is defined as the proportion of bootstrap networks that support the presence of a given edge in a given direction.