Table 3

GeneId-Ranking With a Graph

(1) let Q0 be the probability distribution such that Q0(x) = 1

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

    • let Qd(x) = 0 for all x

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

       - sample xi according to Qd-1

       - Qd(xi) = γQd-1 (xi)

       - for each edge label ℓ ∈ L (x)

          * for each node y Y(x, ℓ)

             · let qxy = Pr(y|ℓ, x)·Pr(ℓ|x)

             · increment Qd(y) by (1 - γ)Qd-1 (xi)qxy

(3) return

<a onClick="popup('http://www.biomedcentral.com/1471-2105/7/440/mathml/M36','MathML',630,470);return false;" target="_blank" href="http://www.biomedcentral.com/1471-2105/7/440/mathml/M36">View MathML</a>

(z) as an approximation to Q(z|x)


An efficient approximation algorithm for computing Q(z|x), given transition probabilities Pr(y|x, ℓ) and Pr(ℓ|x).

Cohen and Minkov BMC Bioinformatics 2006 7:440   doi:10.1186/1471-2105-7-440

Open Data