Metric filtering performance on various chromosomes of yeast. The total confidence that each algorithm recovers normalized by the total number of edges is plotted. Higher values are better. The objective value of the linear program (blue diamonds) gives an upper bound for both the ConsT and ConsP solutions. We also compare our algorithms to the Duan et al. filtering method at FDR 1% (black circles) which is their largest and highest-confidence filtered interaction set. (A bug in the SP-Union script in the conference version of this paper erroneously led to plotting the sum of edge q-values instead of the sum of confidence. The plots have been updated to correctly plot total confidence with little qualitative difference).