Skip to main content

Table 2 Time comparison between the depth-first search algorithm and efmtool

From: A depth-first search algorithm to compute elementary flux modes by linear programming

Model ID No. EFMs tCPU (s) Time ratio
CPLEX Gurobi efmtool CPLEX /efmtool Gurobi /efmtool
subaa 1,779 357 29 10 36 3
aa 70,743 54,824 5,198 47 1166 111
aarna 126,831 824,230 78,394 38,551 21 2
aant 282,027 3,504,514 346,564 731,824 5 0.47
aantpe 2,712,435 24,297,990 2,759,912 >6,929,770 < 4 <0.40
  1. Both CPLEX or Gurobi solvers were tested. Absolute time and time ratios with respect to efmtool are shown. For model aantpe, efmtool failed at the 27th of the 39th iteration.
Back to article page