Figure 3From: Efficient reconstruction of biological networks via transitive reduction on general purpose graphics processorsTransitive reduction of a weighted graph. Edge (a,f) with weight 0. 5 is removed because of the indirect path (a,d,e,f) with a smaller transitive interaction uncertainty of 0. 4. In contrast to Figure 1, the edge (a,c) is not removed as its weight (0. 5) is smaller than the transitive interaction uncertainty of the path (a,b,c) (0. 6).Back to article page