Accurate and Scalable Techniques for the Complex/Pathway Membership Problem in Protein Networks

Algorithm 1

General flow algorithm.

Input: probabilistic graph, 𝐺=(𝑉,𝐸), member list 𝑠

(1) for each  𝑡∈𝑉  do

(2) set capacity of each 𝑒∈𝐸 to 1

(3) assign 𝑡 as the sink

(4) run linear programming for (𝐺,𝑠,𝑡) to find 𝐹, the set of flow edges

(5) find edge disjoint paths using 𝐹

(6) compute reliability, 𝑅(𝑡) by  (1)

(7) end for

(8) sort 𝑅(𝑡) values for all 𝑡∈𝑉

(9) report the answer set