An enumerative approach to computing cut sets in metabolic networks
The productivity of organisms used in biotechnology may be enhanced when certain parts of their metabolism are rendered inaccessible. This can be achieved with genetic modifications, but current techniques set a practical limit on number of modifications that can be applied. Taking advantage of this limit, we implement a brute force algorithm that can compute cut sets for any set of metabolites and reactions that is shown to perform better than alternative approaches. Also, an attempt is made to approximate a binary linear program with a quadratic program; this approximation is meant to be used when refining the growth model of organisms used in flux balance analysis. The approximation is shown to be less efficient that the original program. Finally, extensions to the brute force algorithm are proposed.