Table 3 GeneId-Ranking With a Graph

(2) for d = 1, ..., d _max do

    • let Q _d (x) = 0 for all x

    • for i = 1, ..., m do

       - sample x _i according to Q_d-1

       - Q _d (x _i ) = γQ_d-1(x _i )

- for each edge label ℓ ∈ L (x)

          * for each node y ∈ Y(x, ℓ)

             · let q _xy = Pr(y|ℓ, x)·Pr(ℓ|x)

             · increment Q _d (y) by (1 - γ)Q_d-1(x _i )q _xy

(3) return $Q_{d_{max}}$ (z) as an approximation to Q(z|x)