Figure 5From: A depth-first search algorithm to compute elementary flux modes by linear programming Comparison of computation times. Comparing the total computation time (tCPU) in seconds required by the depth-first search algorithm (◊) (using Gurobi solver) and by efmtool (×) to generate EFMs for the five test models with increasing size. The tCPU for a model with nullity of 80 was extrapolated based on the trend for the depth-first search.Back to article page