Figure 7
From: Efficient and accurate P-value computation for Position Weight Matrices
Time efficiency for granularity 10-3. We compare the running time for the computation of the score threshold associated to a given P-value for FROM P-VALUE TO SCORE and LAZYDISTRIBUTION onto the Jaspar matrices with a granularity set to 10-3. We choose two P-value levels: 10-3 and 10-6. There are 122 matrices (resp. 75 matrices) that can achieve a P-value equal to 10-3 (resp. 10-6). For each algorithm, we classified the matrices into four groups according to the time needed to complete the computation: less than 0.1 second, from 0.1 second to 1 second, from 1 second to 1 minute, and greater than 1 minute. The results are represented by a histogram with four bars. The height of each bar gives the percentage of matrices involved and the number at the top of each bar indicates the corresponding number of matrices.