Skip to main content


Figure 4 | BMC Medical Genomics

Figure 4

From: Graph pyramids for protein function prediction

Figure 4

Illustration of the graph pyramid search subroutine. Here we elaborate the algorithm 1 using 5 different queries. For simplicity assume T AC = 0, t AC = {t1, t2, t3} and only 3 protein classes i.e. | M | = 3 . Each query q i , is analyzed first at the highest level (t3) where we look for all classes c M , having ΔAC(c, t3) > T AC and collect them in A C M . For q1 we can not find any such classes c at t3, so we descend the GP to t2 level and discover A C = { c 2 , c 3 } with threshold t = t2. This secondary threshold (T AC ) is necessary, otherwise there will be many spurious classes (false positives (FP)) having nonzero ΔAC(·).

Back to article page