Designing microbial communities to maximize the thermodynamic driving force for the production of chemicals

Microbial communities have become a major research focus due to their importance for biogeochemical cycles, biomedicine and biotechnological applications. While some biotechnological applications, such as anaerobic digestion, make use of naturally arising microbial communities, the rational design of microbial consortia for bio-based production processes has recently gained much interest. One class of synthetic microbial consortia is based on specifically designed strains of one species. A common design principle for these consortia is based on division of labor, where the entire production pathway is divided between the different strains to reduce the metabolic burden caused by product synthesis. We first show that classical division of labor does not automatically reduce the metabolic burden when metabolic flux per biomass is analyzed. We then present ASTHERISC (Algorithmic Search of THERmodynamic advantages in Single-species Communities), a new computational approach for designing multi-strain communities of a single-species with the aim to divide a production pathway between different strains such that the thermodynamic driving force for product synthesis is maximized. ASTHERISC exploits the fact that compartmentalization of segments of a product pathway in different strains can circumvent thermodynamic bottlenecks arising when operation of one reaction requires a metabolite with high and operation of another reaction the same metabolite with low concentration. We implemented the ASTHERISC algorithm in a dedicated program package and applied it on E. coli core and genome-scale models with different settings, for example, regarding number of strains or demanded product yield. These calculations showed that, for each scenario, many target metabolites (products) exist where a multi-strain community can provide a thermodynamic advantage compared to a single strain solution. In some cases, a production with sufficiently high yield is thermodynamically only feasible with a community. In summary, the developed ASTHERISC approach provides a promising new principle for designing microbial communities for the bio-based production of chemicals

Computing knock out strategies in metabolic networks

Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently compute the minimal knock out sets of reactions required to block a given behaviour. We describe an algorithm which improves the computation of these knock out sets when the elementary modes (minimal functional subsystems) of the network are given. We also describe an algorithm which computes both the knock out sets and the elementary modes containing the blocked reactions directly from the description of the network and whose worst-case computational complexity is better than the algorithms currently in use for these problems. Computational results are included.Comment: 12 page

Structural and functional analysis of cellular networks with CellNetAnalyzer

BACKGROUND: Mathematical modelling of cellular networks is an integral part of Systems Biology and requires appropriate software tools. An important class of methods in Systems Biology deals with structural or topological (parameter-free) analysis of cellular networks. So far, software tools providing such methods for both mass-flow (metabolic) as well as signal-flow (signalling and regulatory) networks are lacking. RESULTS: Herein we introduce CellNetAnalyzer, a toolbox for MATLAB facilitating, in an interactive and visual manner, a comprehensive structural analysis of metabolic, signalling and regulatory networks. The particular strengths of CellNetAnalyzer are methods for functional network analysis, i.e. for characterising functional states, for detecting functional dependencies, for identifying intervention strategies, or for giving qualitative predictions on the effects of perturbations. CellNetAnalyzer extends its predecessor FluxAnalyzer (originally developed for metabolic network and pathway analysis) by a new modelling framework for examining signal-flow networks. Two of the novel methods implemented in CellNetAnalyzer are discussed in more detail regarding algorithmic issues and applications: the computation and analysis (i) of shortest positive and shortest negative paths and circuits in interaction graphs and (ii) of minimal intervention sets in logical networks. CONCLUSION: CellNetAnalyzer provides a single suite to perform structural and qualitative analysis of both mass-flow- and signal-flow-based cellular networks in a user-friendly environment. It provides a large toolbox with various, partially unique, functions and algorithms for functional network analysis.CellNetAnalyzer is freely available for academic use

Computing Combinatorial Intervention Strategies and Failure Modes in Signaling Networks

The identification of combinatorial intervention strategies and the elucidation of failure modes that may cause aberrant behavior of cellular signaling networks are highly relevant topics in cell biology, medicine, and pharmaceutical industry. We have recently introduced the concept of minimal intervention sets (MISs)—minimal combinations of knock-ins and knock-outs provoking a desired/observed response in certain target nodes—to tackle those problemswithin a Boolean/logical framework.We first generalize the notion ofMISs and then present several techniques for search space reduction facilitating the enumeration of MISs in networks of realistic size. One strategy exploits topological information about network-wide interdependencies between the nodes to discard unfavorable single interventions. A similar technique checks during the algorithm whether all target nodes of an intervention problem can be influenced in appropriate direction (up/down) by the interventions contained in MIS candidates. Another strategy takes lessons from electrical engineering: certain interventions are equivalent with respect to their effect on the target nodes and can therefore be grouped in fault equivalence classes (FECs). FECs resulting from so-called structural equivalence can be easily computed in a preprocessing step, with the advantage that only one representative per class needs to be considered when constructing the MISs in the main algorithm. With intervention problems from realistic networks as benchmarks, we show that these algorith-mic improvements may reduce the computation time up to 99%, increasing the applicabil-ity of MISs in practice. Key words: Boolean networks, diagnosis, drug target identification, failure equivalence classes