Skip to main content
. 2010 Aug 5;6(8):e1000868. doi: 10.1371/journal.pcbi.1000868

Figure 3. Average CPU time taken for calculating the pseudo-likelihood on toy networks.

Figure 3

The pseudo-likelihood of going from the network Inline graphic to the network Inline graphic (Figure 1) was calculated conditioned on Inline graphic for different sub-network sizes. The times taken for calculating the pseudo-likelihood averaged across three runs are shown in red. The horizontal lines show the average CPU time taken using the MCMC approach based on path sampling described in Mithani et al. [9] with 11,000 iterations including first 1,000 iteration as burn-in period (blue dashed line) and by exponentiating the full network (brown dotted line).