Skip to main content
. 2019 May 23;15(5):e1006802. doi: 10.1371/journal.pcbi.1006802

Fig 5. Running time of UNCOVER on simulated data.

Fig 5

The running time (expectation and standard deviation) of the greedy algorithm and of the ILP approach are shown for different number of samples and the difference pn between the fraction p of samples with positive target and the fraction n of samples with negative target covered by the the correct solution.