Comparison and improvement of algorithms for computing minimal cut sets
1 Austrian Centre of Industrial Biotechnology, Vienna, Austria
2 Department of Biotechnology, University of Natural Resources and Life Sciences, Vienna, Austria
3 Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg, Germany
BMC Bioinformatics 2013, 14:318 doi:10.1186/1471-2105-14-318Published: 6 November 2013
Constrained minimal cut sets (cMCSs) have recently been introduced as a framework to enumerate minimal genetic intervention strategies for targeted optimization of metabolic networks. Two different algorithmic schemes (adapted Berge algorithm and binary integer programming) have been proposed to compute cMCSs from elementary modes. However, in their original formulation both algorithms are not fully comparable.
Here we show that by a small extension to the integer program both methods become equivalent. Furthermore, based on well-known preprocessing procedures for integer programming we present efficient preprocessing steps which can be used for both algorithms. We then benchmark the numerical performance of the algorithms in several realistic medium-scale metabolic models. The benchmark calculations reveal (i) that these preprocessing steps can lead to an enormous speed-up under both algorithms, and (ii) that the adapted Berge algorithm outperforms the binary integer approach.
Generally, both of our new implementations are by at least one order of magnitude faster than other currently available implementations.