Fig. 2From: ProMotE: an efficient algorithm for counting independent motifs in uncertain network topologiesA probabilistic network G and three of its possible deterministic network topologies denoted with \(G_{1}^{o}\), \(G_{2}^{o}\) and \(G_{3}^{o}\)Back to article page