Skip to main content

Table 1 The runtimes of the four algorithms on the same simulated dataset.

From: Identifying overlapping mutated driver pathways by constructing gene networks in cancer

  Average runtime (seconds)
q Iterative-RME Iterative-Dendrix Multi-Dendrix NBM
0.0001 30.26 635.68 5.32 7.25
0.0005 42.37 685.35 7.03 7.56
0.001 165.28 645.87 8.35 7.89
0.005 N/A 721.32 9.56 7.86
0.01 N/A 756.48 11.48 8.35
0.015 N/A 786.69 13.98 8.43
0.02 N/A 843.53 15.45 8.58
  1. A comparison of the runtimes of Iterative-RME, Iterative-Dendrix, Multi-Dendrix and NBM on simulated mutation data with different passenger mutation probability q. Runtimes of each algorithm are shown as the mean of 20 runs for each q. N/A represents that Iterative-RME algorithm does not give any result within 24 hours. Simulations are performed on the machine running 64-bit windows with Intel Xeon 2.0 GHz processor and a maximum of 6 GB of available memory.