<title>Background</title> <p>The analysis of metabolic networks aims at the understanding of metabolic capabilities of organisms to adapt to, and to maintain growth under different external and internal conditions. Various tools exist today to analyze and predict behavior of organisms solely based on metabolic network structure.</p> <p>Important results have been obtained by applying methods like flux balance analysis [##UREF##0##1##], modeling by differential equations [##REF##10951190##2##], stochastic simulations [##REF##17601761##3##], or elementary flux mode analysis [##REF##10700151##4##]. While some of these methods concentrate on the network as a whole, others like elementary flux modes decompose it into smaller parts that form functional modules. Chemical organization theory [##REF##18439260##5##] aims at the understanding of reaction networks from both sides. Its basic aim is to identify parts of the network, or more precisely, sets of molecular species, that are likely to coexist on a long time scale without any of the species vanishing or other species appearing anew. This not only encompasses steady states of the network as might be identified by elementary flux mode analysis (see Ref. [##REF##17172657##6##] for the relation between elementary modes and organizations), but also conditions in which there are positive productions of metabolites. Therefore it can be seen as a method that defines a mapping from a reaction network consisting of reactions and metabolites to a set of potential phenotypes [##REF##12671661##7##] of the network as specified by the set of organizations it contains. The theory of chemical organizations has previously been applied to a model of the central sugar metabolism of <italic>E. coli </italic>[##UREF##1##8##]. It was shown that organizations in the model coincided with known growth phenotypes of <italic>E. coli </italic>under different growth conditions. The growth on each of the carbon sources glucose, lactose, and glycerol could be matched to a specific organization. However, as negative regulation for some genes was ignored because the down-regulation of genes cannot push gene expression levels below the basal level, some organizations represented biologically infeasible system states, for example the simultaneous uptake of all carbon sources.</p> <p>In this paper, we present an approach to explicitly consider inhibitory regulatory interactions within the analysis of chemical organizations. This allows the more faithful and more precise consideration of biological network models, making the identification of all potential phenotypes of regulated metabolic networks possible. First, the basic concepts of the theory of chemical organizations are presented in the next section. Then, the approach to deal with inhibitory interactions is introduced. The method is then first applied to a subnetwork of a network model of the central metabolism of <italic>E. coli </italic>to predict growth phenotypes. Finally, the method is applied to the complete network model to predict the lethality of gene knockouts.</p> <title>Theory of Chemical Organizations</title> <p>The theory of chemical organizations [##REF##18439260##5##] provides a new method to analyze complex reaction networks. Extending ideas by Fontana and Buss [##UREF##2##9##], one main objective is to determine combinations of network species that are more likely to be present over long periods of (simulation-) time than others. Such sets of species are called organizations. To be an organization, a species set has to fulfill two properties: algebraic closure and self-maintenance. The first property – closure – ensures that given the molecular species of an organization, there is no reaction within the reaction network that could create a novel species not yet present in the organization. The second property – self-maintenance – guarantees that every molecular species that is consumed within the organization can be recreated from organization species at a suffcient rate for its maintenance. The basic concepts required for this paper are summarized now more formally.</p> <title>Reaction network</title> <p>Let  be a set of molecular species,  denotes the set of all multisets with elements from . A multiset differs from a set in the fact that it can contain the same element more than once. The set of reactions  occurring among the species  can then be defined by a relation . We call the pair  a <italic>reaction network</italic>.</p> <title>Closed set</title> <p>A set of species  is <italic>closed</italic>, if for all reactions  with , then also . In other words: if the educts of a reaction are contained in , then also its products must be in . There is no reaction in  that could create any new species not yet in  from species contained in .</p> <title>Self-maintaining set</title> <p>Given a reaction system  with <italic>m </italic>= || species and <italic>n </italic>= || reactions, <bold>S </bold>= (<italic>m</italic><sub><italic>i</italic>, <italic>j</italic></sub>) be its <italic>m </italic>× <italic>n </italic>stoichiometric matrix, where <italic>m</italic><sub><italic>i</italic>, <italic>j </italic></sub>is the number of molecules of species <italic>i </italic>that is produced in reaction <italic>j </italic>(<italic>i.e</italic>., right hand side minus left hand side). A set of species  is called <italic>self-maintaining </italic>if a flux vector <italic>v </italic>= (<italic>v</italic><sub>1</sub>, <italic>v</italic><sub>2</sub>, ..., <italic>v</italic><sub><italic>n</italic></sub>) ∈  exists such that the following three conditions are fulfilled:</p> <p>(1) For every reaction  with , its corresponding flux is .</p> <p>(2) For every reaction  with , its corresponding flux is .</p> <p>(3) For every species <italic>i </italic>∈ , its concentration change is nonnegative: (<bold>S</bold><italic>v</italic>)<sub><italic>i </italic></sub>≥ 0.</p> <p>In other words: if we consider only the sub-network made up by the species of  and additionally the species that can be created from  (but are not in ) (conditions (1) and (2)), we can find a positive flux vector, such that no species of  decays (condition (3)).</p> <title>Organization</title> <p>A set of species  that is closed and self-maintaining is called an <italic>organization</italic>.</p> <title>Balanced organization</title> <p>An organization  is a <italic>balanced organization</italic>, if a flux vector conforming to the self-maintenance condition can still be found, if in requirement 3 of the self-maintenance definition, the greater equal condition is replaced by equality:</p> <p>(3') For every species <italic>i </italic>∈ , its concentration change is zero: (<bold>S</bold><italic>v</italic>)<sub><italic>i </italic></sub>= 0.</p> <p>A rigorous link between organizations and the potential dynamics of a reaction system is provided by Theorem 1 from Ref. [##REF##18439260##5##]: Assume that the dynamics is modeled as a "chemical" differential equation system <italic>dx</italic>(<italic>t</italic>)<italic>/dt </italic>= <bold>S</bold><italic>v</italic>(<italic>x</italic>(<italic>t</italic>)), then all steady states of the system are instances of organizations. In other words, the species with concentration levels greater than zero in a particular steady state are exactly those species contained in a corresponding organization. Note that organizations do not necessarily contain a steady state, as they can also embody growth in which species have increasing concentrations. The only assumption made for this theorem is that molecules that are present and can react will react sooner or later (formally: , if and only if for all <italic>i </italic>∈ : <italic>x</italic><sub><italic>i </italic></sub>&gt; 0). Note that this assumption differs fundamentally from the assumption made by methods like elementary mode analysis, which assume that each reaction can be switched off independently even if the reactants are present in large concentrations [##REF##17172657##6##].</p> <title>Computing Organizations</title> <p>To compute organizations, the convex polyhedral cone  can be used which is defined by the <italic>n </italic>+ <italic>m </italic>inequalities <italic>v </italic>≥ <bold>0 </bold>and <bold>S </bold>· <italic>v </italic>≥ <bold>0 </bold>in the flux space . This cone contains all self-maintenance flux vectors as described in the self-maintenance definition. In order to find species sets that are self-maintaining and closed, the extreme rays spanning  are combined in a recursive fashion and the resulting species sets tested. The Supplement contains a detailed description of the algorithm, and outlines a heuristic approach to compute organizations for large network models, for which the runtime of the algorithm exceeds practical limits (see Additional file ##SUPPL##0##1##).</p>
<title>Methods</title> <p>Regulation has not yet been explicitly considered in the analysis using the theory of chemical organizations. The aim of this section is to elaborate a concept that allows us to also account for regulation. This concept makes it possible to also study regulated metabolic networks using organization theory. The basic idea is to map regulatory rules to normal chemical reaction rules. For inhibitory rules and rules using the direction of a reversible flux we introduce pseudo species representing the absence of a species and the direction of a flux, respectively.</p> <title>Types of Regulation</title> <p>To examine the effects of regulation on chemical organizations we first need to discuss the general types of regulatory interactions that occur in biological systems in more detail.</p> <p>Regulation appears on different levels in the cell, being carried out by a variety of biological entities (<italic>e.g</italic>., small molecules, proteins, RNA) acting on further biological target entities. As we are considered with reaction networks, we focus here on the regulation of reactions. Two different types of regulation have to be considered. The first type of regulation only changes the flux of the regulated reaction slightly. Certain types of autoregulation fall into this category. This kind of regulation does not change the structure of the reaction network and hence does not affect its organizational hierarchy. The second type of regulation is more drastic: it turns a reaction completely off or enables a formerly unavailable reaction. This is the case, for example, when the expression of a protein that catalyzes a reaction is suddenly repressed. As a consequence, the catalyzed reaction is not available to the network anymore once the protein is completely degraded. The induction of uptake pathways is an example for enabling novel reactions. New reaction pathways become suddenly available.</p> <p>Note that, even though drastic, this kind of categorization of regulation leads to meaningful models, for example when translated into a boolean regulatory network [##REF##11708855##10##] and also generalizes to discretization using more than two levels as used in Ref. [##REF##15486106##11##].</p> <p>Regulatory interactions do not happen instantly. The time delay between the onset of a regulatory event and its measurable effect in the system can vary between milliseconds (<italic>e.g</italic>., phosphorylation of proteins in signal cascades [##REF##7040985##12##]) and minutes (<italic>e.g</italic>., changes in gene expression [##REF##1789784##13##]). However, as we are here interested in the long term behavior of the system, we do not take different time scales of regulation into account.</p> <title>Modeling Regulatoy Interactions</title> <p>Several approaches exist to represent and model regulatory interactions [##REF##11911796##14##], for example, boolean logic [##REF##11708855##10##,##REF##4588055##15##,##UREF##3##16##], stochastic models [##REF##15261147##17##], and differential equations [##REF##9927716##18##]. Whereas some approaches require a very detailed knowledge of the mechanisms and kinetics behind the regulation, the representation of regulatory networks by boolean logic can be useful if the knowledge about the underlying kinetics is limited [##REF##15486106##11##]. In this approach, the state <italic>on </italic>or <italic>off </italic>is assigned to a regulated reaction [##REF##4588055##15##]. We will adopt this notion to model regulatory interactions.</p> <p>Two types of regulatory events have to be considered: <italic>activation</italic>, in which a species is required in order to perform a certain reaction, and <italic>inhibition</italic>, in which a species inhibits a certain reaction and makes it unavailable. To model this kind of regulation we make use of the properties of reactions being similar to rewriting rules, where the left hand side is being replaced by the right hand side. Taking this approach, the molecules on the left hand side need to be present for the reaction to proceed. Additionally, regulatory events can be triggered not only by the presence or absence of a species, but also by a species being available in excess or not.</p> <title>Activation</title> <p>Activation or turning on a reaction by a specific species can be simply modelled by considering this species as a kind of a catalyst. In terms of rewriting rules this approach can be considered as an additional constraint on the presence of certain species for the reaction to proceed. By this, the reaction can only take place when the activating species is present. Being a catalyst, the activating species is not consumed within the reaction it catalyzes.</p> <p>Let us consider the general case in which species <italic>E </italic>activates a reaction that transforms a reactant <italic>A </italic>into product <italic>B</italic>. In the absence of <italic>E</italic>, the reaction shall have a zero flux, while the flux shall become positive in the presence of <italic>E </italic>and <italic>A</italic>. A reaction <italic>A </italic>→ <italic>B </italic>activated by <italic>E </italic>becomes:</p> <p></p> <p>Note that adding <italic>E </italic>as a catalyst on the reactant and product side of the reaction equation does not change the stoichiometric matrix <bold>S</bold>. Still, one unit of <italic>A </italic>is being consumed to produce one unit of <italic>B</italic>. Therefore any flux vector that guarantees self-maintenance for a set of metabolites including <italic>E </italic>but without considering <italic>E </italic>as an activator, will also guarantee self-maintenance when <italic>E </italic>is added as a catalyst to model activation.</p> <title>Inhibition</title> <p>Handling inhibition is more diffcult. If inhibitor <italic>I </italic>inhibits a reaction, we could add an if-statement to each reaction that guarantees that the reaction is only available when <italic>I </italic>is absent. But since we intend to model regulation within the language of reactions, such if-statements would not fulfill our requirements. An alternative way to model inhibition is to understand it as another type of activation, that is, as the activation of a reaction by the absence of an inhibitor. For achieving this we have to introduce a pseudo species <italic>Ī </italic>that represents the absence of inhibitor <italic>I</italic>. In terms of rewriting rules, such species is just a constraint on the presence of a certain species for a reaction to take place. A reaction <italic>A </italic>→ <italic>B </italic>inhibited by <italic>I </italic>becomes:</p> <p></p> <p>Only in the absence of <italic>I</italic>, represented by pseudo species <italic>Ī</italic>, educt <italic>A </italic>can react to form product <italic>B</italic>.</p> <title>Modelling flux-direction dependent regulation</title> <p>Sometimes it can make sense to define regulatory rules that depend on the <italic>direction </italic>at which one or more reversible reactions operate. Two examples can be found in Covert and Palsson [##REF##12006566##19##], the rule for the pyruvate response regulator (gene <italic>pdhR</italic>) and the rule for the catabolite activator protein (gene <italic>cra</italic>). Given a reversible reaction <italic>r</italic>: <italic>A </italic>↔ <italic>B </italic>and the following flux-direction dependent regulatory rule:</p> <p>"If the flux of reaction <italic>r </italic>is positive (forward), then activate protein E.",</p> <p>we map this regulatory rule to the following conventional reaction rules by introducing a pseudo species <italic>f</italic><sub><italic>r </italic></sub>and its inverse counterpart :</p> <p></p> <p></p> <p></p> <p>Because in consistent organizations (see below) either <italic>f</italic><sub><italic>r </italic></sub>or  is present (but not both), the reaction rules assure that either the forward <italic>r</italic><sub><italic>f </italic></sub>or the backward reaction rule <italic>r</italic><sub><italic>b </italic></sub>can be active. Here, in Eq. (3), we use the presence of the molecular species <italic>A </italic>and <italic>f</italic><sub><italic>r </italic></sub>as an indicator for the activity of reaction <italic>r</italic><sub><italic>f </italic></sub>. Conversely, we can use the presence of the molecular species <italic>B </italic>and  as an indicator for the activity of the backward reaction <italic>r</italic><sub><italic>b</italic></sub>.</p> <p>If necessary, we can add a pseudo species like <italic>f</italic><sub><italic>r </italic></sub>to every reversible reaction rule <italic>r </italic>in order to obtain an indicator for the direction in which it operates. Then, these indicators can even be combined to represent a more complex rule. Note that in Covert and Palsson [##REF##12006566##19##], different flux-directions are logically combined to indicate a surplus of a molecular species (<italic>e.g</italic>., <italic>PYR </italic>for the regulation of <italic>pdhR</italic>; and <italic>FDP </italic>or <italic>F6P </italic>for the regulation of <italic>cra</italic>).</p> <title>Consistent organization</title> <p>Introducing pseudo species causes a problem, as now two network species represent the same molecular entity. When computing the organizations of such a network, some organizations might exist that contain both or neither of the two species. In both cases, the presence of the species is not clearly defined. Either the presence and absence is indicated simultaneously, or no statement is made at all. Consequently, we only consider those organizations in the remaining of this paper, in which for all species it is clearly defined whether they are present or not. We call such organizations consistent.</p> <title>Consistent organization</title> <p>An organization  is called a <italic>consistent organization</italic>, if for all species <italic>S </italic>∈  for which there exists a pseudo species  that indicates its absence, either <italic>S </italic>or  is contained in the organization.</p> <p>In passing we note that this approach allows one to model more than two states of a molecule, for example different phosphorylation states.</p> <title>Modeling Boolean Logic</title> <p>There are few cases where a reaction is regulated by a single molecule alone. In most cases regulation is more complex, for example if the availability of a reaction is being determined by the interaction of a set of proteins. In such cases we need to model regulation by a set of boolean functions. This section presents an approach to account for such functions on the level of regulation (see also [##UREF##4##20##]).</p> <p>All binary boolean functions can be reduced to either <italic>AND </italic>or <italic>OR</italic>, and the negation <italic>NOT</italic>. The construction of a negation has been outlined above. In principle, it would be suffcient to present a method to implement <italic>AND </italic>or <italic>OR</italic>. However, we present methods for both to ease the process of converting regulation logics to chemical reactions.</p> <p>First we consider the <italic>AND </italic>function. A typical regulation incorporating an <italic>AND </italic>function is the required presence of two activators to perform a reaction. If we consider activator <italic>E</italic>1 and activator <italic>E</italic>2 to be necessary for a reaction converting educt <italic>A </italic>into product <italic>B </italic>we can write:</p> <p></p> <p>Next, the <italic>OR </italic>function is considered. An example for this case is a reaction transforming educt <italic>A </italic>into product <italic>B </italic>that can alternatively be activated by two activators <italic>E</italic>1 and <italic>E</italic>2. The presence of one of these activators is suffcient to perform the reaction. In this case, the reaction is split into two parts; one that accounts for the presence of activator <italic>E</italic>1, and one that accounts for the presence of activator <italic>E</italic>2:</p> <p></p> <p></p> <p>Taking these two basic functions, it is possible to model all regulatory relationships that can be represented by boolean rules in metabolic networks [##UREF##4##20##].</p> <title>Example: Regulatory switch</title> <p>As an example for the presented procedure, we analyze a simple reaction network comprising – apart from inflow and outflow – two reactions forming a switch as depicted in Figure ##FIG##0##1(A)##. The product of one reaction inhibits the other reaction and vice versa. Additionally, an inhibitor <italic>I </italic>can shut down both reactions. Thus, we have a simple <italic>AND </italic>function that requires for both reactions that both <italic>I and P</italic>1, respectively <italic>P</italic>2, are absent. A model without regulation would contain only reactions transforming <italic>A </italic>to <italic>P1 </italic>and <italic>P2</italic>, the influx to <italic>A </italic>and the outflux from the products: ' = {∅ → <italic>A</italic>, <italic>A </italic>→ <italic>P</italic>1, <italic>A </italic>→ <italic>P</italic>2, <italic>P</italic>1 → ∅, <italic>P</italic>2 → ∅}.</p> <p>The boolean expressions describing the regulation are:</p> <p></p> <p></p> <p>Applying the presented procedure, these expressions are transformed into chemical reactions. The resulting reaction network contains the following reactions:</p> <p> = {</p> <p></p> <p></p> <p></p> <p></p> <p></p> <p>The network contains 16 organizations as listed in Table ##TAB##0##1##.</p> <p>Three organizations are consistent: <italic>O</italic><sub>10 </sub>= {<italic>A</italic>, <italic>I</italic>, , }, <italic>O</italic><sub>11 </sub>= {<italic>A</italic>, <italic>Ī</italic>, <italic>P</italic>1, }, and <italic>O</italic><sub>12 </sub>= {<italic>A</italic>, <italic>Ī</italic>, , <italic>P</italic>2}. In the remaining organizations it is at least for one species not clearly defined whether it is present or not. Taking Organization 2 for example, the presence of <italic>A </italic>and <italic>I </italic>is determined with <italic>A </italic>present and <italic>I </italic>absent, but there is no information concerning species <italic>P</italic>1 and <italic>P</italic>2. In Organization 6, inhibitor <italic>I </italic>is present and absent at the same time. Figure ##FIG##0##1(B,C,D)##) depicts the reaction networks belonging to the three consistent organizations. They represent the three states of the switch. In Organization 10, inhibitor <italic>I </italic>is present and shuts down reactions (2) and (3), turning the switch off. In the other two consistent organizations <italic>I </italic>is not present and there is either a flux through reaction (2) (Organization 11) or through reaction (3) (Organization 12). They represent the two other states of the switch.</p>
<title>Results</title> <p>We apply the method to a model of the central metabolism of <italic>E. coli </italic>by Covert and Palsson [##REF##12006566##19##]. The authors used the model to study the effects of regulation on flux balance analysis. The regulatory network is defined by a set of boolean functions. There are 73 enzymes, which catalyze 113 reactions. Of these reactions, 43 are regulated by 16 regulatory proteins and therefore controlled by logic statements. The unregulated proteins are assumed to be present in the cell at all times. We add an inflow for all of them in our analysis. To incorporate the regulation into the reaction network, we add the proteins that catalyze reactions explicitly as catalysts in the reactions as described above. Following the introduced protocol, the regulatory logic is incorporated by introducing pseudo species and adapting the reactions accordingly. The activity of several genes is described by boolean statements. Appropriate chemical reactions are added to model this gene regulation. We analyze two variants of the network model by Covert and Palsson [##REF##12006566##19##]: a simplified <italic>core network </italic>to study wildtype growth phenotypes on different carbon sources, and the <italic>complete network </italic>for predicting knockout experiments. Both networks are listed in the Supplement (see Additional file ##SUPPL##0##1##) and provided as SBML files (see Additional files ##SUPPL##1##2## and ##SUPPL##2##3##).</p> <title>The core network model</title> <p>For studying growth on different carbon sources including diauxic shift, the network is reduced to the set of reactions that lead from external glucose, lactose, and glycerol to pyruvate via glycolysis. Additionally, the pentose-phosphate pathway reactions and the reactions leading from glucose-6-phosphate to this pathway are removed. The resulting network comprises 49 reactions of the original network. The considered part of the network does not contain any ATP production. However, ATP is used up by some reactions, for example in glucose uptake. Therefore, ATP is provided as input. Furthermore, UTP, NAD, NADP, Ubiquinone, and external hydrogen ions are necessary for other uptake and transformation reactions and cannot be provided by this part of the network. These species are added as input as well. To model growth, an outflow is added for every biomass precursor, as in the original network. Since we consider proteins as being active only when they are produced, an outflow for every protein is added, modeling degradation. In order to model different growth media and conditions, self-replicator reactions for external glucose, lactose, glycerol, and oxygen are added of the form <italic>M </italic>→ 2 <italic>M</italic>. These reactions ensure that a constant supply of the respective species is available, whenever it is considered to be present. Using self-replicator reactions, all 2<sup>4 </sup>= 16 different growth conditions can be modeled in a single network and can be simultaneously considered in one analysis.</p> <p>The final model comprises 95 species (including 15 pseudo species representing the absence of a species) and 168 reactions. The complete list of network reactions can be found in the Supplement.</p> <title>The complete network model</title> <p>For predicting the lethality of gene knockouts we use the complete network model of the regulated central metabolism of <italic>E. coli </italic>by Covert and Palsson [##REF##12006566##19##]. Depending on the availability of oxygen and the different carbon sources in the growth medium, influxes are added for the respective external species. The currency metabolites HEXT, PI, ADP, ATP, NAD, NADH, Q, QH2, NADP, NADPH, FAD, FADH, UTP, and COA are considered to be unconditionally available in the cell. Input reactions are added for all these species. Without the influxes of external carbon sources and oxygen, the network contains 227 species and 468 reactions.</p> <title>Growth Phenotypes on Different Carbon Sources</title> <p>The core network model contains 16 consistent organizations. They are listed in Table ##TAB##1##2## (see Supplement for a graphical representation). The consistent organizations coincide with the 16 possible growth conditions. The smallest organization, Organization 1, just contains the input metabolites plus the products of the hydrolyzation of ATP, ADP, and phosphate. When analyzing the genes that are active in this organization, we find that the response regulators for glucose, lactose, and glycerol are active, indicating that the respective carbon sources are not present. Due to the absence of oxygen, the aerobic response regulators ArcA and Fnr are also active.</p> <p>In Organization 2, external oxygen is available. Consequently, the aerobic response regulators ArcA and Fnr are absent here. This is the only difference between Organizations 1 and 2.</p> <title>Glucose uptake</title> <p>The first organization that utilizes an external carbon source is Organization 3, which contains the reactions for glucose uptake. Consequently, the metabolites of the central metabolism are present in this organization. When examining the proteins of the organization, we find that the glucose response regulator Mlc is absent. The organization next in size is Organization 4. Here, lactose is additionally in the medium. Although the repressor of the <italic>lac </italic>gene, LacI, is absent in the organization, no uptake reactions for external lactose are contained in the organization. The lactose permease LacY, a product of the <italic>lac </italic>genes, is missing. As glucose is available in the medium, the lactose uptake system is not induced by the presence of external lactose. This effect is known as inducer exclusion. The metabolite required for upregulation of the <italic>lac </italic>genes is not taken up by the cell. Organization 5 represents a similar case in which glycerol is available in the growth medium but not taken up. All external carbon sources and oxygen are available in Organization 10, but the cell is still exclusively utilizing glucose. Organizations 6 to 9 represent further input combinations defining growth conditions with external glucose available. The availability of oxygen does not change the reactions in the part of the central metabolism that is considered in the core model.</p> <title>Lactose uptake</title> <p>In Organization 13, lactose is the exclusive external carbon source. Consequently, LacI is absent as it is bound by allolactose, a derivative of lactose. Hence, it cannot repress the genes necessary for lactose uptake and utilization. We find the corresponding gene products present in this organization, namely LacZ and LacY. Additionally, derivatives of lactose, for example galactose, are contained in this organization. These metabolites are created in the pathway leading from lactose to the central metabolism. Another diauxic shift effect can be observed in Organization 14. Here, external lactose and glycerol are present as carbon sources, but as in the case with glucose and lactose, only lactose is taken up. Organizations 15 and 16 represent further growth conditions in which lactose is taken up. Once again, the availability of oxygen does not change the reactions in the modeled part of the central metabolism.</p> <title>Glycerol uptake</title> <p>Glycerol is the exclusive external carbon source in Organization 11. As all proteins necessary for glycerol uptake are present, glycerol is taken up. For glycerol uptake, three different enzymes catalyze the reaction from glycerol-3-phosphate to dihydroxyacetone-phospate, a metabolite of glycolysis. One of these enzymes, glycerol-3-phosphate-dehydrogenase, is constitutively expressed in the model. The other two proteins, glycerol-3-phosphate kinases GlpABC and GlpD are specific for anaerobic, respectively aerobic growth conditions. Therefore, GlpABC is present and GlpD absent in Organization 11, where no oxygen is available. When oxygen is available as in Organization 12, GlpD is present and GlpABC absent.</p> <title>Predicting Gene Knockout Experiments</title> <p>Knockout experiments are performed using the complete network model. Gene knockouts are modeled by deleting all reactions in which the corresponding protein takes part as educt or product. The set of consistent organizations is determined for each knockout experiment using a heuristic approach detailed in the Supplement. The lethality of a knockout can be predicted by the existence of organizations containing all biomass precursor metabolites. If such an organizations is not found, the knockout is predicted to be lethal. We use organization theory (OT) and an adapted version of organization theory (aOT, see below) to predict the same gene knockouts as Covert and Palsson [##REF##12006566##19##], who used regulatory flux balance analysis (rFBA) for gene knockout predictions. Reference [##REF##12006566##19##] is also our source for <italic>in vivo </italic>data and predictions by flux balance analysis (FBA) and rFBA. The results are summarized in Table ##TAB##2##3##. Out of 116 experiments, the predictions by FBA are correct in 97 cases (83,6%). The predictions by rFBA are correct in 106 cases (91,4%) and improve the results of FBA in nine cases. Unmodified OT predicts the lethality of knockouts correctly in 101 cases (87,1%), while aOT predicts 106 cases (91,4%) correctly as rFBA. The additional model-specific assumptions made by aOT are taken from Covert and Palsson [##REF##12006566##19##] and will be described in detail now.</p> <title>Assumption that accumulation of mass is lethal</title> <p>In two cases, OT predicts a lethal knockout to be nonlethal (<italic>rpiA</italic>, and <italic>rpiA </italic>+ <italic>rpiB </italic>on glucose). The self-maintenance property allows for the accumulation of internal metabolites, while in rFBA, only steady states are considered, and any accumulation of metabolites is regarded as lethal. In these two cases, the organizations containing all biomass precursors contain metabolites with positive productions. (Note, that all species except the pseudo species indicating the absence of species decay in the network model. Hence, all organizations are indeed balanced organizations. However, accumulation of metabolites occur, if the decay reactions, which are not present in the original network, are removed.) Hence, OT predicts the knockout to be nonlethal while rFBA predicts it to be lethal as no steady state exists. In aOT we restrict our analysis to organizations that are balanced (<italic>i.e</italic>., internal metabolites are not allowed to accumulate). With this model specific assumption aOT classifies the two knockout experiments correctly.</p> <title>Assumption that secreted molecules have no effect</title> <p>Further three incorrect predictions by OT (<italic>ackA </italic>and <italic>pta </italic>on acetate, and <italic>ppc </italic>on glycerol) yield deeper insights into the differences between chemical organization theory and regulatory flux balance analysis, namely in the treatment of by the cell secreted molecules.</p> <p>In the case of acetate uptake, there are two pathways that enable the utilization of this carbon source as depicted in Figure ##FIG##1##2(A)##. One pathway leads directly from acetate to acetyl-CoA, and the other takes the route via acetyl phosphate. The first pathway is catalyzed by the acetyl-CoA synthethase (gene <italic>acs</italic>). According to the model, the corresponding gene is only transcribed if no carbon source is available or at most acetate or formate, or both. The second pathway is catalyzed by acetate kinase A (gene <italic>ackA</italic>) and phosphotransacetylase (gene <italic>pta</italic>). If one of these genes is knocked out, the first pathway can still support the central metabolism, given that acetate is the exclusive external carbon source. In this case, chemical organization theory predicts both knockouts as lethal, which is not the case <italic>in vivo </italic>and correctly predicted by rFBA. The reason for this discrepancy is that in any network containing the biomass precursor metabolite pyruvate, this metabolite will be secreted by the cell. Therefore, such a network also comprises the external form of pyruvate which is an inhibitor for the only remaining uptake reaction for acetate. Consequently, there exists no organization containing all biomass precursor metabolites when acetate is the exclusive carbon source in the growth medium and the second pathway is knocked out. Because the presence of metabolites is not explicitly considered in rFBA, this inhibition is not detected by rFBA. However, because the knockout is nonlethal in <italic>in vivo </italic>experiments, the levels of secreted pyruvate might not be suffcient to have an effect on the expression of <italic>acs</italic>. Or, the cell switches its uptake from acetate to pyruvate until it is depleted and then switches back to acetate again.</p> <p>The incorrect prediction of the knockout of <italic>ppc </italic>on glycerol as nonlethal can be explained by the same argument. Gene <italic>ppc </italic>codes for the phosphoenolpyruvate carboxylase, which supplies the citric acid cycle with oxaloacetate (OA). When <italic>ppc </italic>is knocked out, the only alternative for OA production is the glyoxylate shunt, consisting of the isocitrate lyase (gene <italic>aceA</italic>) and the malate synthase A (gene <italic>aceB</italic>). However, the glyoxylate shunt is only active if <italic>E. coli </italic>grows on acetate or fatty acids as the sole carbon source [##REF##7033207##21##]. Hence, the knockout of <italic>ppc </italic>on a glycerol growth medium is lethal <italic>in vivo</italic>, as the glyoxylate shunt is not activated. In the model, the glyoxylate shunt is regulated by the fatty acid and acetate response regulators IclR and FadR as depicted in Figure ##FIG##1##2(B)##. Gene <italic>fadR </italic>is only expressed if external glucose, or no acetate is available in the growth media. If activated, FadR leads to an upregulation of <italic>iclR</italic>, which then leads to a downregulation of <italic>aceA </italic>and <italic>aceB</italic>, inactivating the glyoxylate shunt. If acetate is available in the growth medium, <italic>fadR </italic>is not expressed, and thus <italic>aceA </italic>and <italic>aceB </italic>are expressed at high levels, activating the glyoxylate shunt. Any organization containing the biomass precursor metabolite acetyl-CoA also contains acetate, which is secreted. Hence, any organization containing the biomass precursors also contains the external form of acetate, which activates the glyoxylate shunt.</p> <p>Even though considerable amounts of acetate secretion on glycerol media has only been reported in high density cultures [##REF##7766011##22##], OT indicates the possibility for <italic>E. coli </italic>to grow on glycerol if <italic>ppc </italic>is knocked out. Our result suggests that the activation of the glyoxylate shunt would be enough. There have been reports of <italic>E. coli </italic>strains growing on glucose media that were also able to grow with <italic>ppc </italic>knocked out, which is usually lethal. This was facilitated by a mutation that lead to an upregulation of the glyoxylate shunt [##REF##16102602##23##]. Thus, the results of OT might be biological feasible in this case.</p> <p>The problems encountered in the regulation by secreted species can be resolved by introducing a pseudo species representing the secreted version of a species. Therefore, in aOT, a metabolite that can be secreted is represented by two species: one represents the metabolite at high concentration (<italic>e.g</italic>., when externally supplied), the other species represents the metabolite at low concentration (<italic>e.g</italic>., when secreted). These modifications allow aOT to correctly predict the three cases discussed above. Note that the underlying assumption of this modification is also made by Covert and Palsson [##REF##12006566##19##].</p>
<title>Discussion</title> <p>By transforming the boolean formalism that represents the regulation of a metabolic network into reaction rules, we were able to demonstrate how chemical organization theory can be applied to regulated metabolic networks. Using a model of the central metabolism of <italic>E. coli </italic>[##REF##12006566##19##], each of the 16 wildtype growth scenarios were correctly predicted down to the presence of each protein. Each external condition could be directly mapped to a single organization implying a distinct qualitative state of the network (<italic>i.e</italic>., a set of molecular species present).</p> <title>Knockout experiments</title> <p>Without specific assumptions, organization theory (OT) was able to predict the lethality of knockout experiments correctly in 101 out of 116 cases (87.1%). With model specific assumptions, "adapted" organization theory (aOT) was able to predict the lethality of knockout experiments correctly in 106 cases (91.4%), achieving the same performance as rFBA [##REF##12006566##19##]. When comparing the performance of OT and rFBA with respect to knockout predictions, it must be noted that the model used for the comparison was co-developed with rFBA. Specific assumptions were made that were deliberatly not made in the pure organization analysis as OT shall provide an universal analysis technique applicable to general biological network models (<italic>e.g</italic>., [##REF##16381960##24##]). In this light, we consider the performance of organization theory as competitive.</p> <p>Moreover, there are cases in other models in which predictions by OT are more accurate than those by FBA. This occurs, for example, due to the fact that FBA only incompletely takes co-factors into account. These co-factors are molecules that are necessary for some reactions to proceed. They can interact through various means with the substrates and products of a reaction. In the (unregulated) metabolic model by Reed et al. [##REF##12952533##25##], we identified 10 cases in which OT correctly classifies a knockout as lethal while (r)FBA does not. The reason for this difference is that the identified co-factors are necessary for producing biomass metabolites (i.e., metabolites that appear on the left hand side of the biomass producing reaction), but they are not considered as biomass metabolites (see Supplement for details).</p> <title>Influence of model specific assumptions</title> <p>In our analysis of the model by Covert and Palsson [##REF##12006566##19##], we found five cases in which OT predictions differ from rFBA predictions. All of these cases can be resolved by aOT in a straightforward way by taking assumptions into account also made by rFBA in [##REF##12006566##19##]. In particular, the deviation between OT and (r)FBA has uncovered two critical aspects:</p> <p>First, (r)FBA only considers steady states. A system state with accumulating metabolites is regarded as lethal. In OT, accumulating metabolites are explicitly allowed to also cover system states related to growth. To adopt the steady state assumption in OT however, one simply can restrict the analysis to balanced organizations in aOT. However, only considering steady states is not necessarily the best "natural" choice. As models usually are not complete, the biological system might contain pathways that are not modeled but can take care of overproduced metabolites. Also, certain molecular species accumulate in the cell at certain time points, for example in different phases of the cell cycle. Hence, states with positive productions of certain species are not necessarily lethal.</p> <p>Second, in OT only the presence or absence of metabolites is considered. Hence, even smallest concentrations of species will potentially trigger further responses. When secreted metabolites have much lower concentrations than external metabolites supplied by the growth medium, this can lead to wrong predictions as secreted metabolites shall not trigger further regulation (cf. Figure ##FIG##1##2##). However, the problem can easily be resolved by introducing two species representing the metabolite at a high and at a low concentration, respectively. Alternatively, we could use the positive flow from the carbon source as a signal for the high concentration of the external metabolite (as it has been done by Covert and Palsson [##REF##12006566##19##]). Note however, that with the unmodified OT we found a phenotype that indicates how to bypass the <italic>in vivo </italic>lethality of a knockout in one case.</p> <title>Identification of all potential qualitative phenotypes</title> <p>Organization theory provides a rigorous link between an organization and the potential dynamics of the reaction system (cf. Theorem 1 in Ref. [##REF##18439260##5##]): if there is a steady state, then the species with positive concentrations must be an organization. Thus, we can guarantee that there is no other species combination that can give rise to a stationary state. Note that the species sets our method identifies contain also proteins, so that the organizations we obtain describe not only which metabolites are present but also which proteins are active in any possible steady state.</p> <p>A related issue has been raised by Shlomi et al. [##REF##17437026##26##]: The choice of a flux vector producing biomass in the FBA phase of rFBA leaves open a whole range of possible flux vectors in the space of possible solutions of rFBA. Thus, also the outcome of the experiments might depend on this choice. In contrast, OT takes all possible fluxes into account. If there are several qualitative phenotypes (i.e. sets of species with positive concentrations) consistent with the regulatory rules, several organizations will be found (see Methods).</p> <title>Application to large-scale models</title> <p>The largest organization does not necessarily encompass the whole system. Thus when analyzing larger models, OT allows the exact prediction of those parts of a model that can give rise to a steady state. Parts missing in such a state can then be refined. For example in the case of knockout experiments, we can determine which part of a network is still available. Such knowledge is important when trying to reduce a metabolic model for a specific purpose, for example to increase the production of a certain metabolite. Even though the presented method can also be used for genome scale networks, it remains to be seen if all of the regulated organization in such a system could still be found. The bottleneck in the computation is the determination of all organizations of a regulated network before checking if they are consistent. Their number can grow exponentially with network size, in which case computation is primarily constrained by the available memory. This problem might be circumvented by an approach that partitions the solution space of the self-maintainance condition and searches those partitions in parallel for organizations (see Supplement for algorithmic details). However, such an approach has not yet been implemented. Currently, the analysis of a pure (non-regulated) metabolic network of genome scale by [##REF##12952533##25##] is possible with the heuristic approach (see Supplement). If the number of organizations in such a network is small, all of them can be found with the heuristic approach [##UREF##5##27##]. Whether and how this scales to regulated genome-scale models is an open issue.</p> <title>Other Approaches for Integrated Network Analysis</title> <p>In recent years other approaches for the integration of regulatory networks into stoichiometric analysis have been proposed: Steady-state regulatory flux balance analysis (SR-FBA) [##REF##17437026##26##] builds on rFBA and allows the flux analysis within one step. Boolean regulatory rules are integrated into the FBA approach by using mixed-integer linear programming. Thus, fluxes that obey the regulatory constraints can be computed directly without prior determination of the state of the regulatory network as in rFBA. In contrast to our approach SR-FBA focuses, like FBA, on specific fluxes through the network. Thus a possible flux for each possible reaction among the molecules like in organization theory (by the definition of closure), is not required for a feasible flux vector in SR-FBA. Likewise problems with co-factors like in FBA occur (see Discussion and Supplement).</p> <p>Another approach, a matrix formalism to analyze regulatory systems, has been proposed by Gianchandani et al. [##REF##16895435##28##]. Similar to our approach, they formulate the regulatory network by representing it as reactions in the stoichiometric matrix. Then they analyze the integrated network by using extreme pathway analysis [##REF##10716907##29##]. The main difference to our work is that modelling based on the stoichiometric matrix requires a flux through the regulatory network. Thus inhibitors and activators are consumed upon interaction and are not modelled as catalysts. Even though the authors only analyzed a pure regulatory network, an integration into a metabolic network seems to be possible. Interestingly, the concept of a functional state of the resulting network, <italic>i.e</italic>., the state when all external inputs are defined, resembles the organizations we found. However, those states are restricted to the regulatory part of the network, since the closure of the participating molecules is not taken into account. Another aspect of this concept that has not yet been analyzed is to which extent this method can also be applied to larger networks, for example those we analyzed in this work. The integration of the regulatory network into a metabolic network using a flux through the network might further increase the combinatorial explosion of the number of extreme pathways. Nonetheless, this approach is valuable for identifying underlying pathways in a regulatory network, a prospect which has not yet been analyzed in connection with OT.</p>
<title>Conclusion</title> <p>Because OT does not rely on kinetics, it can serve as a first step to analyze the potential behavior of regulated systems. The analysis delivers all potential network phenotypes described by the sets of molecular species that can coexist over a long time (cf. Theorem 1 in Ref. [##REF##18439260##5##]). The further analysis of the network can then focus on interesting phenotypes. Taking the other direction, it is possible to validate <italic>in silico </italic>network models. All phenotypes of interest observed <italic>in vivo </italic>should have corresponding organizations in the network model.</p> <p>When regulation is considered in metabolic networks, the presented approach offers the advantage that both the metabolism and its regulation are modeled within one single framework: chemical reaction rules forming a network. The unification comes at the expense of introducing a set of pseudo species to represent the absence of species. This allows one to model and consider inhibitory interactions within the framework of organization theory. Using an appropriate user interface, the pseudo species can be easily hidden.</p>
<p>This is an Open Access article distributed under the terms of the Creative Commons Attribution License (<ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/2.0"/>), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</p> <title>Background</title> <p>Due to the growing amount of biological knowledge that is incorporated into metabolic network models, their analysis has become more and more challenging. Here, we examine the capabilities of the recently introduced chemical organization theory (OT) to ease this task. Considering only network stoichiometry, the theory allows the prediction of all potentially persistent species sets and therewith rigorously relates the structure of a network to its potential dynamics. By this, the phenotypes implied by a metabolic network can be predicted without the need for explicit knowledge of the detailed reaction kinetics.</p> <title>Results</title> <p>We propose an approach to deal with regulation – and especially inhibitory interactions – in chemical organization theory. One advantage of this approach is that the metabolic network and its regulation are represented in an integrated way as one reaction network. To demonstrate the feasibility of this approach we examine a model by Covert and Palsson (J Biol Chem, 277(31), 2002) of the central metabolism of <italic>E. coli </italic>that incorporates the regulation of all involved genes. Our method correctly predicts the known growth phenotypes on 16 different substrates. Without specific assumptions, organization theory correctly predicts the lethality of knockout experiments in 101 out of 116 cases. Taking into account the same model specific assumptions as in the regulatory flux balance analysis (rFBA) by Covert and Palsson, the same performance is achieved (106 correctly predicted cases). Two model specific assumptions had to be considered: first, we have to assume that secreted molecules do not influence the regulatory system, and second, that metabolites with increasing concentrations indicate a lethal state.</p> <title>Conclusion</title> <p>The introduced approach to model a metabolic network and its regulation in an integrated way as one reaction network makes organization analysis a universal technique to study the potential behavior of biological network models. Applying multiple methods like OT and rFBA is shown to be valuable to uncover critical assumptions and helps to improve model coherence.</p>
<title>Authors' contributions</title> <p>CK and PD introduced the idea of pseudo species indicating the absence of metabolites. All authors contributed to the presented new concepts and procedures building on the framework of organization theory. Software implementation, data preparation, and analysis was done by CK and FC. All authors read and approved the final manuscript.</p> <title>Supplementary Material</title>
<title>Acknowledgements</title> <p>Financial support by the <italic>Federal Ministry of Education and Research </italic>(BMBF) grant 0312704A, the EU (ESIGNET, grant 12789), and the <italic>German Research Foundation </italic>(DFG) grant Di852/4-x is greatly acknowledged.</p>
<fig position="float" id="F1"><label>Figure 1</label><caption><p><bold>A simple switch</bold>. Regulatory switch network (<bold>A</bold>) and the reaction networks belonging to its three consistent organizations (<bold>B</bold>, <bold>C</bold>, and <bold>D</bold>). Absent species appear in gray. Inactive reactions and interactions are dashed. Panel <bold>B </bold>represents Organization 10 = {<italic>A</italic>, <italic>I</italic>} where inhibitor <italic>I </italic>represses both reactions from <italic>A </italic>to <italic>P</italic>1 and <italic>P</italic>2. Panels <bold>C </bold>and <bold>D </bold>represent Organization 11 = {<italic>A</italic>, <italic>P</italic>1} and Organization 12 = {<italic>A</italic>, <italic>P</italic>2} where one pathway is active, either over <italic>P1 </italic>or <italic>P2</italic>.</p></caption></fig> <fig position="float" id="F2"><label>Figure 2</label><caption><p><bold>Illustration of knockout experiments</bold>. Panel <bold>A</bold>: Illustration of the sub-network that explains why deletion of <italic>pta </italic>or <italic>ackA </italic>is wrongly predicted as lethal by OT. According to the model, the alternative route via <italic>acs </italic>is inhibited by the presence of external pyruvate, which is always excreted when biomass is produced. Thus, there cannot be an uptake of external acetate. <italic>In vivo</italic>, however, the excreted pyruvate is negligible. Panel <bold>B</bold>: Illustration of the sub-network that explains why deletion of <italic>ppc </italic>is wrongly predicted as viable by OT. The glyoxylate shunt is activated if no external glucose but external acetate is present. According to the model, acetate is always excreted when biomass is produced. Therefore, the glyoxylate shunt is always upregulated, if glucose is not contained in the growth medium. Arrows indicate metabolic reactions, squares indicate activation and T-shaped lines inhibition. Dotted arrows indicate schematic reactions, which abstract a set of metabolic reactions.</p></caption></fig>
<table-wrap position="float" id="T1"><label>Table 1</label><caption><p>A simple switch. All organizations of the regulatory switch network (Figure 18.1). Three organizations are consistent: 10, 11, and 12 (marked bold).</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="center">Org.</td><td align="center">Species</td><td align="center">Real Species</td></tr></thead><tbody><tr><td align="center">1</td><td align="center"><italic>A</italic></td><td align="center">-</td></tr><tr><td align="center">2</td><td align="center"><italic>A</italic>, <italic>Ī</italic></td><td align="center">-</td></tr><tr><td align="center">3</td><td align="center"><italic>A</italic>, <italic>I</italic></td><td align="center">-</td></tr><tr><td align="center">4</td><td align="center"><italic>A</italic>, </td><td align="center">-</td></tr><tr><td align="center">5</td><td align="center"><italic>A</italic>, </td><td align="center">-</td></tr><tr><td align="center">6</td><td align="center"><italic>A</italic>, <italic>I</italic>, <italic>Ī</italic></td><td align="center">-</td></tr><tr><td align="center">7</td><td align="center"><italic>A</italic>, <italic>I</italic>, </td><td align="center">-</td></tr><tr><td align="center">8</td><td align="center"><italic>A</italic>, <italic>I</italic>, </td><td align="center">-</td></tr><tr><td align="center">9</td><td align="center"><italic>A</italic>, , </td><td align="center">-</td></tr><tr><td align="center"><bold>10</bold></td><td align="center"><italic>A</italic>, <italic>I</italic>, , </td><td align="center"><italic>A</italic>, <italic>I</italic></td></tr><tr><td align="center"><bold>11</bold></td><td align="center"><italic>A</italic>, <italic>Ī</italic>, <italic>P</italic>1, </td><td align="center"><italic>A</italic>, <italic>P</italic>1</td></tr><tr><td align="center"><bold>12</bold></td><td align="center"><italic>A</italic>, <italic>Ī</italic>, , <italic>P</italic>2</td><td align="center"><italic>A</italic>, <italic>P</italic>2</td></tr><tr><td align="center">13</td><td align="center"><italic>A</italic>, <italic>Ī</italic>, <italic>I</italic>, , </td><td align="center">-</td></tr><tr><td align="center">14</td><td align="center"><italic>A</italic>, <italic>Ī</italic>, <italic>I</italic>, <italic>P</italic>1, </td><td align="center">-</td></tr><tr><td align="center">15</td><td align="center"><italic>A</italic>, <italic>Ī</italic>, , <italic>P</italic>1, , <italic>P</italic>2</td><td align="center">-</td></tr><tr><td align="center">16</td><td align="center"><italic>A</italic>, <italic>Ī</italic>, <italic>I</italic>, , <italic>P</italic>1, , <italic>P</italic>2</td><td align="center">-</td></tr></tbody></table></table-wrap> <table-wrap position="float" id="T2"><label>Table 2</label><caption><p>Growth phenotypes of the core model. Consistent organizations in the core network model of the regulated central metabolism of <italic>E. coli</italic>, ordered by size. </p></caption><table frame="hsides" rules="groups"><thead><tr><td align="left">Consistent Organiza.</td><td align="left">Species</td><td align="left">Growth medium</td><td align="center">Uptake</td></tr></thead><tbody><tr><td align="left">1</td><td align="left">Input metabolites, ADP, PI, ArcA, Fnr, GalR, GalS, GlpR, LacI, Mlc, PykF, Ubiquitous proteins</td><td align="left">-</td><td align="center">-</td></tr><tr><td align="left">2</td><td align="left">Input metabolites, ADP, O2, O2xt, PI, GalR, GalS, GlpR, LacI, Mlc, PykF, Ubiquitous proteins</td><td align="left">O2</td><td align="center">-</td></tr><tr><td align="left">3</td><td align="left">Input metabolites, Glycolysis metabolites, ADP, G1P, GLC, GLCxt, LCTSxt, NADH, PI, PPI, UDPG, ArcA, Crr, FadR, Fnr, Food, GalP, GalR, GalS, GlpR, LacI, Pgk, PtsGHI, PykF, Ubiquitous proteins</td><td align="left">GLC</td><td align="center">GLC</td></tr><tr><td align="left">4</td><td align="left">Input metabolites, Glycolysis metabolites, ADP, G1P, GLC, GLCxt, LCTSxt, NADH, O2, O2xt, PI, PPI, UDPG, ArcA, Crr, FadR, Fnr, Food, GalP, GlpR, Pgk, PtsGHI, PykF, Ubiquitous proteins</td><td align="left">GLC, LCTS</td><td align="center">GLC</td></tr><tr><td align="left">5</td><td align="left">Input metabolites, Glycolysis metabolites, ADP, G1P, GLC, GLCxt, GLxt, LCTSxt, NADH, PI, PPI, UDPG, ArcA, Crr, FadR, Fnr, Food, GalP, GalR, GalS, LacI, Pgk, PtsGHI, PykF, Ubiquitous proteins</td><td align="left">GLC, GL</td><td align="center">GLC</td></tr><tr><td align="left">6</td><td align="left">Input metabolites, Glycolysis metabolites, ADP, G1P, GLC, GLCxt, GLxt, LCTSxt, NADH, O2, O2xt, PI, PPI, UDPG, ArcA, Crr, FadR, Fnr, Food, GalP, Pgk, PtsGHI, PykF, Ubiquitous proteins</td><td align="left">GLC, GL, LCTS</td><td align="center">GLC</td></tr><tr><td align="left">7</td><td align="left">Input metabolites, Glycolysis metabolites, ADP, G1P, GLC, GLCxt, NADH, PI, PPI, UDPG, Crr, FadR, Food, GalP, GalR, GalS, GlpR, LacI, Pgk, PtsGHI, PykF, Ubiquitous proteins</td><td align="left">GLC, O2</td><td align="center">GLC</td></tr><tr><td align="left">8</td><td align="left">Input metabolites, Glycolysis metabolites, ADP, G1P, GLC, GLCxt, NADH, O2, O2xt, PI, PPI, UDPG, Crr, FadR, Food, GalP, GlpR, Pgk, PtsGHI, PykF, Ubiquitous proteins</td><td align="left">GLC, LCTS, O2</td><td align="center">GLC</td></tr><tr><td align="left">9</td><td align="left">Input metabolites, Glycolysis metabolites, ADP, G1P, GLC, GLCxt, GLxt, NADH, PI, PPI, UDPG, Crr, FadR, Food, GalP, GalR, GalS, LacI, Pgk, PtsGHI, PykF, Ubiquitous proteins</td><td align="left">GLC, GL, O2</td><td align="center">GLC</td></tr><tr><td align="left">10</td><td align="left">Input metabolites, Glycolysis metabolites, ADP, G1P, GLC, GLCxt, GLxt, NADH, O2, O2xt, PI, PPI, UDPG, Crr, FadR, Food, GalP, Pgk, PtsGHI, PykF, Ubiquitous proteins</td><td align="left">GLC, GL, LCTS, O2</td><td align="center">GLC</td></tr><tr><td align="left">11</td><td align="left">Input metabolites, Glycolysis metabolites, ADP, G1P, GL, GL3P, GLxt, NADH, NADPH, O2, O2xt, PI, PPI, QH2, UDPG, ArcA, Crr, Fnr, Food, GalP, GalR, GalS, GlpABC, GlpF, GlpK, LacI, Mlc, Pgk, PtsGHI, PykF, Ubiquitous proteins</td><td align="left">GL</td><td align="center">GL</td></tr><tr><td align="left">12</td><td align="left">Input metabolites, Glycolysis metabolites, ADP, G1P, GL, GL3P, GLxt, NADH, NADPH, PI, PPI, QH2, UDPG, Crr, Food, GalP, GalR, GalS, GlpD, GlpF, GlpK, LacI, Mlc, Pgk, PtsGHI, PykF, Ubiquitous proteins</td><td align="left">GL, O2</td><td align="center">GL</td></tr><tr><td align="left">13</td><td align="left">Input metabolites, Glycolysis metabolites, Lactose derivatives, ADP, G1P, GLC, LCTS, LCTSxt, NADH, PI, PPI, UDPG, ArcA, Crr, Fnr, Food, GalE, GalK, GalM, GalP, GalT, GlpR, LacY, LacZ, Mlc, Pgk, PtsGHI, PykF, Ubiquitous Proteins</td><td align="left">LCTS</td><td align="center">LCTS</td></tr><tr><td align="left">14</td><td align="left">Input metabolites, Glycolysis metabolites, Lactose derivatives, ADP, G1P, GLC, LCTS, LCTSxt, NADH, O2, O2xt, PI, PPI, UDPG, ArcA, Crr, Fnr, Food, GalE, GalK, GalM, GalP, GalT, LacY, LacZ, Mlc, Pgk, PtsGHI, PykF, Ubiquitous Proteins</td><td align="left">GL, LCTS</td><td align="center">LCTS</td></tr><tr><td align="left">15</td><td align="left">Input metabolites, Glycolysis metabolites, Lactose derivatives, ADP, G1P, GLC, GLxt, LCTS, LCTSxt, NADH, PI, PPI, UDPG, Crr, Food, GalE, GalK, GalM, GalP, GalT, GlpR, LacY, LacZ, Mlc, Pgk, PtsGHI, PykF, Ubiquitous proteins</td><td align="left">LCTS, O2</td><td align="center">LCTS</td></tr><tr><td align="left">16</td><td align="left">Input metabolites, Glycolysis metabolites, Lactose derivatives, ADP, G1P, GLC, GLxt, LCTS, LCTSxt, NADH, O2, O2xt, PI, PPI, UDPG, Crr, Food, GalE, GalK, GalM, GalP, GalT, LacY, LacZ, Mlc, Pgk, PtsGHI, PykF, Ubiquitous Proteins</td><td align="left">GL, LCTS, O2</td><td align="center">LCTS</td></tr></tbody></table></table-wrap> <table-wrap position="float" id="T3"><label>Table 3</label><caption><p>Comparison of knockout predictions. </p></caption><table frame="hsides" rules="groups"><thead><tr><td/><td align="center"><bold>glc</bold></td><td align="center"><bold>gl</bold></td><td align="center"><bold>suc</bold></td><td align="center"><bold>ac</bold></td><td align="center"><bold>rib</bold></td><td align="center"><bold>glc (-O<sub>2</sub>)</bold></td><td align="center"><bold>Dual Substr</bold>.</td><td align="center"><bold>Reference</bold></td></tr></thead><tbody><tr><td align="left"><italic>aceA</italic></td><td align="center">+/+/+/+</td><td/><td align="center">+/+/+/+</td><td align="center">-/-/-/-</td><td/><td align="center">+/+/+/+</td><td/><td align="center">[30]</td></tr><tr><td align="left"><italic>aceB</italic></td><td/><td/><td/><td align="center">-/-/-/-</td><td/><td/><td/><td align="center">[31]</td></tr><tr><td align="left"><italic>aceEF</italic></td><td align="center">-/+/-/-</td><td/><td align="center">-/+/-/-</td><td align="center">+/+/+/+</td><td/><td align="center">+/+/+/+</td><td align="center">+/+/+/+ (glc-ac)</td><td align="center">[32]</td></tr><tr><td align="left"><italic>ackA</italic></td><td/><td/><td/><td align="center"><bold>+/+/+/-</bold></td><td/><td/><td/><td align="center">[33]</td></tr><tr><td align="left"><italic>ackA </italic>+ <italic>pta </italic>+ <italic>acs</italic></td><td/><td/><td/><td align="center">-/-/-/-</td><td/><td/><td/><td align="center">[33]</td></tr><tr><td align="left"><italic>acnA</italic></td><td align="center">+/+/+/+</td><td align="center">+/+/+/+</td><td align="center">+/+/+/+</td><td align="center">+/+/+/+</td><td/><td align="center">+/+/+/+</td><td/><td align="center">[31,34]</td></tr><tr><td align="left"><italic>acnB</italic></td><td align="center">+/+/+/+</td><td align="center">+/+/+/+</td><td align="center">+/+/+/+</td><td align="center">-/+/+/+</td><td/><td align="center">+/+/+/+</td><td/><td align="center">[34]</td></tr><tr><td align="left"><italic>acnA </italic>+ <italic>acnB</italic></td><td align="center">-/-/-/-</td><td align="center">-/-/-/-</td><td align="center">-/-/-/-</td><td align="center">-/-/-/-</td><td/><td align="center">-/-/-/-</td><td/><td align="center">[34]</td></tr><tr><td align="left"><italic>acs</italic></td><td/><td/><td/><td align="center">+/+/+/+</td><td/><td/><td/><td align="center">[33]</td></tr><tr><td align="left"><italic>adh</italic></td><td align="center">+/+/+/+</td><td/><td/><td/><td/><td align="center">-/+/+/+</td><td/><td align="center">[35]</td></tr><tr><td align="left"><italic>cyd</italic></td><td align="center">+/+/+/+</td><td/><td/><td/><td/><td/><td/><td align="center">[36]</td></tr><tr><td align="left"><italic>cyo</italic></td><td align="center">+/+/+/+</td><td/><td/><td/><td/><td/><td/><td align="center">[36]</td></tr><tr><td align="left"><italic>eno</italic></td><td align="center">-/-/-/-</td><td align="center">-/-/-/-</td><td align="center">-/-/-/-</td><td/><td/><td/><td align="center">+/+/+/+ (gl-suc)</td><td align="center">[37]</td></tr><tr><td align="left"><italic>fbaA</italic></td><td align="center">-/+/+/+</td><td/><td/><td/><td/><td/><td/><td align="center">[38]</td></tr><tr><td align="left"><italic>fbp</italic></td><td align="center">+/+/+/+</td><td align="center">-/-/-/-</td><td align="center">-/-/-/-</td><td align="center">-/-/-/-</td><td/><td/><td/><td align="center">[39]</td></tr><tr><td align="left"><italic>frdA</italic></td><td align="center">+/+/+/+</td><td/><td align="center">+/+/+/+</td><td align="center">+/+/+/+</td><td/><td align="center">+/+/+/+</td><td/><td align="center">[30]</td></tr><tr><td align="left"><italic>fumA</italic></td><td/><td/><td/><td align="center">-/+/-/-</td><td/><td align="center">+/+/+/+</td><td/><td align="center">[31]</td></tr><tr><td align="left"><italic>gap</italic></td><td align="center">-/-/-/-</td><td align="center">-/-/-/-</td><td align="center">-/-/-/-</td><td/><td/><td/><td align="center">+/+/+/+ (gl-suc)</td><td align="center">[37]</td></tr><tr><td align="left"><italic>glk</italic></td><td align="center">+/+/+/+</td><td/><td/><td/><td/><td/><td/><td align="center">[38]</td></tr><tr><td align="left"><italic>glk </italic>+ <italic>pfkA</italic></td><td align="center">+/+/+/+</td><td/><td/><td/><td/><td/><td/><td align="center">[38]</td></tr><tr><td align="left"><italic>glk </italic>+ <italic>pts</italic></td><td align="center">-/-/-/-</td><td/><td/><td/><td/><td/><td/><td align="center">[38]</td></tr><tr><td align="left"><italic>gltA</italic></td><td align="center">-/-/-/-</td><td/><td/><td align="center">-/-/-/-</td><td/><td/><td/><td align="center">[34]</td></tr><tr><td align="left"><italic>gnd</italic></td><td align="center">+/+/+/+</td><td/><td/><td/><td/><td/><td/><td align="center">[38]</td></tr><tr><td align="left"><italic>icd</italic></td><td align="center">-/-/-/-</td><td/><td/><td align="center">-/-/-/-</td><td/><td/><td/><td align="center">[34]</td></tr><tr><td align="left"><italic>mdh</italic></td><td align="center">+/+/+/+</td><td align="center">+/+/+/+</td><td align="center">+/+/+/+</td><td/><td/><td align="center">+/+/+/+</td><td/><td align="center">[40]</td></tr><tr><td align="left"><italic>ndh</italic></td><td align="center">+/+/+/+</td><td align="center">+/+/+/+</td><td/><td/><td/><td/><td/><td align="center">[41]</td></tr><tr><td align="left"><italic>nuo</italic></td><td align="center">+/+/+/+</td><td align="center">+/+/+/+</td><td/><td/><td/><td/><td/><td align="center">[41]</td></tr><tr><td align="left"><italic>pfl</italic></td><td/><td/><td/><td/><td/><td align="center">+/+/+/+</td><td/><td align="center">[42]</td></tr><tr><td align="left"><italic>pgi</italic></td><td align="center">+/+/+/+</td><td align="center">+/-/-/-</td><td align="center">+/-/-/-</td><td/><td/><td/><td/><td align="center">[38]</td></tr><tr><td align="left"><italic>pgi </italic>+ <italic>gnd</italic></td><td align="center">-/-/-/-</td><td/><td/><td/><td/><td/><td/><td align="center">[38]</td></tr><tr><td align="left"><italic>pgi </italic>+ <italic>zwf</italic></td><td align="center">-/-/-/-</td><td/><td/><td/><td/><td/><td/><td align="center">[38]</td></tr><tr><td align="left"><italic>pgk</italic></td><td align="center">-/-/-/-</td><td align="center">-/-/-/-</td><td align="center">-/-/-/-</td><td/><td/><td/><td align="center">+/+/+/+ (gl-suc)</td><td align="center">[37]</td></tr><tr><td align="left"><italic>pgl</italic></td><td align="center">+/+/+/+</td><td/><td/><td/><td/><td/><td/><td align="center">[38]</td></tr><tr><td align="left"><italic>ppc</italic></td><td align="center">-/+/-/-</td><td align="center"><bold>-/+/-/+</bold></td><td align="center">+/+/+/+</td><td/><td/><td/><td align="center">+/+/+/+ (gl-suc) +/+/+/+ (glc-suc)</td><td align="center">[38,40]</td></tr><tr><td align="left"><italic>pta</italic></td><td/><td/><td/><td align="center"><bold>+/+/+/-</bold></td><td/><td/><td/><td align="center">[33]</td></tr><tr><td align="left"><italic>pts</italic></td><td align="center">+/+/+/+</td><td/><td/><td/><td/><td/><td/><td align="center">[38]</td></tr><tr><td align="left"><italic>pykA</italic></td><td align="center">+/+/+/+</td><td/><td/><td/><td/><td/><td/><td align="center">[38]</td></tr><tr><td align="left"><italic>pykA </italic>+ <italic>pykF</italic></td><td align="center">+/+/+/+</td><td/><td/><td/><td/><td/><td/><td align="center">[38]</td></tr><tr><td align="left"><italic>pykF</italic></td><td align="center">+/+/+/+</td><td/><td/><td/><td/><td/><td/><td align="center">[38]</td></tr><tr><td align="left"><italic>rpiA</italic></td><td align="center"><bold>-/+/-/+</bold></td><td/><td/><td/><td align="center">+/+/+/+</td><td/><td align="center">+/+/+/+ (glc-rib)</td><td align="center">[43]</td></tr><tr><td align="left"><italic>rpiA </italic>+ <italic>rpiB</italic></td><td align="center"><bold>-/-/-/+</bold></td><td/><td/><td/><td align="center">-/+/+/+</td><td/><td align="center">+/+/+/+ (glc-rib)</td><td align="center">[43]</td></tr><tr><td align="left"><italic>rpiB</italic></td><td align="center">+/+/+/+</td><td/><td/><td/><td align="center">+/+/+/+</td><td/><td align="center">+/+/+/+ (glc-rib)</td><td align="center">[43]</td></tr><tr><td align="left"><italic>rpiR </italic>+ <italic>rpiA</italic></td><td align="center">+/N/+/+</td><td/><td/><td/><td align="center">+/N/+/+</td><td/><td align="center">+/N/+/+ (glc-rib)</td><td align="center">[43]</td></tr><tr><td align="left"><italic>sdhABCD</italic></td><td align="center">+/+/+/+</td><td/><td align="center">-/-/-/-</td><td align="center">-/-/-/-</td><td/><td align="center">+/+/+/+</td><td/><td align="center">[30]</td></tr><tr><td align="left"><italic>sucAB- lpd</italic></td><td align="center">-/+/+/+</td><td/><td align="center">-/+/+/+</td><td align="center">-/+/+/+</td><td/><td align="center">+/+/+/+</td><td align="center">+/+/+/+ (glc-suc)</td><td align="center">[30,32]</td></tr><tr><td align="left"><italic>tpi</italic></td><td align="center">-/+/+/+</td><td align="center">-/-/-/-</td><td align="center">-/-/-/-</td><td align="center">-/-/-/-</td><td/><td/><td align="center">+/+/+/+ (glc-suc) +/+/+/+ (glc-gl)</td><td align="center">[37,44]</td></tr><tr><td align="left"><italic>zwf</italic></td><td align="center">+/+/+/+</td><td/><td/><td/><td/><td/><td/><td align="center">[38]</td></tr></tbody></table></table-wrap>
<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1" name="1752-0509-2-37-i1" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">M</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2" name="1752-0509-2-37-i2" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi mathvariant="script">P</mml:mi><mml:mi>M</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="script">M</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M3" name="1752-0509-2-37-i1" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">M</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M4" name="1752-0509-2-37-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">R</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M5" name="1752-0509-2-37-i1" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">M</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M6" name="1752-0509-2-37-i4" overflow="scroll"><mml:semantics><mml:mrow><mml:mi mathvariant="script">R</mml:mi><mml:mo>⊆</mml:mo><mml:msub><mml:mi mathvariant="script">P</mml:mi><mml:mi>M</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="script">M</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="script">P</mml:mi><mml:mi>M</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="script">M</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M7" name="1752-0509-2-37-i5" overflow="scroll"><mml:semantics><mml:mrow><mml:mo>〈</mml:mo><mml:mi mathvariant="script">M</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="script">R</mml:mi><mml:mo>〉</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M8" name="1752-0509-2-37-i6" overflow="scroll"><mml:semantics><mml:mrow><mml:mi mathvariant="script">S</mml:mi><mml:mo>⊆</mml:mo><mml:mi mathvariant="script">M</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M9" name="1752-0509-2-37-i7" overflow="scroll"><mml:semantics><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="script">A</mml:mi><mml:mo>→</mml:mo><mml:mi>ℬ</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>∈</mml:mo><mml:mi mathvariant="script">R</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M10" name="1752-0509-2-37-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:mi mathvariant="script">A</mml:mi><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant="script">P</mml:mi><mml:mi>M</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="script">S</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M11" name="1752-0509-2-37-i9" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>ℬ</mml:mi><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant="script">P</mml:mi><mml:mi>M</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="script">S</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M12" name="1752-0509-2-37-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M13" name="1752-0509-2-37-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M14" name="1752-0509-2-37-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">R</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M15" name="1752-0509-2-37-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M16" name="1752-0509-2-37-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M17" name="1752-0509-2-37-i5" overflow="scroll"><mml:semantics><mml:mrow><mml:mo>〈</mml:mo><mml:mi mathvariant="script">M</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="script">R</mml:mi><mml:mo>〉</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M18" name="1752-0509-2-37-i1" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">M</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M19" name="1752-0509-2-37-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">R</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M20" name="1752-0509-2-37-i6" overflow="scroll"><mml:semantics><mml:mrow><mml:mi mathvariant="script">S</mml:mi><mml:mo>⊆</mml:mo><mml:mi mathvariant="script">M</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M21" name="1752-0509-2-37-i11" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi>ℝ</mml:mi><mml:mrow><mml:mo>≥</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M22" name="1752-0509-2-37-i7" overflow="scroll"><mml:semantics><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="script">A</mml:mi><mml:mo>→</mml:mo><mml:mi>ℬ</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>∈</mml:mo><mml:mi mathvariant="script">R</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M23" name="1752-0509-2-37-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:mi mathvariant="script">A</mml:mi><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant="script">P</mml:mi><mml:mi>M</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="script">S</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M24" name="1752-0509-2-37-i12" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi mathvariant="script">A</mml:mi><mml:mo>→</mml:mo><mml:mi>ℬ</mml:mi></mml:mrow></mml:msub><mml:mo>&gt;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M25" name="1752-0509-2-37-i7" overflow="scroll"><mml:semantics><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="script">A</mml:mi><mml:mo>→</mml:mo><mml:mi>ℬ</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>∈</mml:mo><mml:mi mathvariant="script">R</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M26" name="1752-0509-2-37-i13" overflow="scroll"><mml:semantics><mml:mrow><mml:mi mathvariant="script">A</mml:mi><mml:mo>∉</mml:mo><mml:msub><mml:mi mathvariant="script">P</mml:mi><mml:mi>M</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="script">S</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M27" name="1752-0509-2-37-i14" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi mathvariant="script">A</mml:mi><mml:mo>→</mml:mo><mml:mi>ℬ</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M28" name="1752-0509-2-37-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M29" name="1752-0509-2-37-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M30" name="1752-0509-2-37-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M31" name="1752-0509-2-37-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M32" name="1752-0509-2-37-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M33" name="1752-0509-2-37-i6" overflow="scroll"><mml:semantics><mml:mrow><mml:mi mathvariant="script">S</mml:mi><mml:mo>⊆</mml:mo><mml:mi mathvariant="script">M</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M34" name="1752-0509-2-37-i6" overflow="scroll"><mml:semantics><mml:mrow><mml:mi mathvariant="script">S</mml:mi><mml:mo>⊆</mml:mo><mml:mi mathvariant="script">M</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M35" name="1752-0509-2-37-i10" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">S</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M36" name="1752-0509-2-37-i15" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi mathvariant="script">A</mml:mi><mml:mo>→</mml:mo><mml:mi>ℬ</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&gt;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M37" name="1752-0509-2-37-i16" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">A</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M38" name="1752-0509-2-37-i17" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">P</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M39" name="1752-0509-2-37-i11" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi>ℝ</mml:mi><mml:mrow><mml:mo>≥</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M40" name="1752-0509-2-37-i17" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">P</mml:mi></mml:semantics></mml:math></inline-formula> <disp-formula><italic>E </italic>+ <italic>A </italic>→ <italic>E </italic>+ <italic>B</italic>.</disp-formula> <disp-formula><italic>Ī </italic>+ <italic>A </italic>→ <italic>Ī </italic>+ <italic>B</italic>.</disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M41" name="1752-0509-2-37-i18" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <disp-formula id="bmcM1"><label>(1)</label><italic>r</italic><sub><italic>f </italic></sub>: <italic>A </italic>+ <italic>f</italic><sub><italic>r </italic></sub>→ <italic>B </italic>+ <italic>f</italic><sub><italic>r</italic></sub></disp-formula> <disp-formula id="bmcM2"><label>(2)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M42" name="1752-0509-2-37-i19" overflow="scroll">
                        <mml:semantics>
                           <mml:mrow>
                              <mml:msub>
                                 <mml:mi>r</mml:mi>
                                 <mml:mi>b</mml:mi>
                              </mml:msub>
                              <mml:mo>:</mml:mo>
                              <mml:mi>B</mml:mi>
                              <mml:mo>+</mml:mo>
                              <mml:mover accent="true">
                                 <mml:mrow>
                                    <mml:msub>
                                       <mml:mi>f</mml:mi>
                                       <mml:mi>r</mml:mi>
                                    </mml:msub>
                                 </mml:mrow>
                                 <mml:mo stretchy="true">¯</mml:mo>
                              </mml:mover>
                              <mml:mo>→</mml:mo>
                              <mml:mi>A</mml:mi>
                              <mml:mo>+</mml:mo>
                              <mml:mover accent="true">
                                 <mml:mrow>
                                    <mml:msub>
                                       <mml:mi>f</mml:mi>
                                       <mml:mi>r</mml:mi>
                                    </mml:msub>
                                 </mml:mrow>
                                 <mml:mo stretchy="true">¯</mml:mo>
                              </mml:mover>
                           </mml:mrow>
                           
                        </mml:semantics>
                     </mml:math></disp-formula> <disp-formula id="bmcM3"><label>(3)</label><italic>r</italic><sub><italic>E </italic></sub>: <italic>A </italic>+ <italic>f</italic><sub><italic>r </italic></sub>→ <italic>A </italic>+ <italic>f</italic><sub><italic>r </italic></sub>+ <italic>E </italic></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M43" name="1752-0509-2-37-i18" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M44" name="1752-0509-2-37-i18" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M45" name="1752-0509-2-37-i20" overflow="scroll"><mml:semantics><mml:mrow><mml:mi mathvariant="script">O</mml:mi><mml:mo>⊆</mml:mo><mml:mi mathvariant="script">M</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M46" name="1752-0509-2-37-i1" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">M</mml:mi></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M47" name="1752-0509-2-37-i21" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mi>S</mml:mi><mml:mo>¯</mml:mo></mml:mover><mml:mo>∈</mml:mo><mml:mi mathvariant="script">M</mml:mi></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M48" name="1752-0509-2-37-i22" overflow="scroll"><mml:semantics><mml:mover accent="true"><mml:mi>S</mml:mi><mml:mo>¯</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula> <disp-formula><italic>E</italic>1 + <italic>E</italic>2 + <italic>A </italic>→ <italic>E</italic>1 + <italic>E</italic>2 + <italic>B</italic>.</disp-formula> <disp-formula><italic>E</italic>1 + <italic>A </italic>→ <italic>E</italic>1 + <italic>B</italic></disp-formula> <disp-formula><italic>E</italic>2 + <italic>A </italic>→ <italic>E</italic>2 + <italic>B</italic>.</disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M49" name="1752-0509-2-37-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">R</mml:mi></mml:semantics></mml:math></inline-formula> <disp-formula><italic>A </italic>→ <italic>P</italic>1 if ¬<italic>I </italic>⋀ ¬<italic>P</italic>2</disp-formula> <disp-formula><italic>A </italic>→ <italic>P</italic>2 if ¬<italic>I </italic>⋀ ¬<italic>P</italic>1.</disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M50" name="1752-0509-2-37-i3" overflow="scroll"><mml:semantics><mml:mi mathvariant="script">R</mml:mi></mml:semantics></mml:math></inline-formula> <disp-formula id="bmcM1a"><label>(1a)</label>∅ → <italic>A</italic>,</disp-formula> <disp-formula id="bmcM2a"><label>(2a)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M51" name="1752-0509-2-37-i23" overflow="scroll">
                     <mml:semantics>
                        <mml:mrow>
                           <mml:mover accent="true">
                              <mml:mrow>
                                 <mml:mi>P</mml:mi>
                                 <mml:mn>2</mml:mn>
                              </mml:mrow>
                              <mml:mo stretchy="true">¯</mml:mo>
                           </mml:mover>
                           <mml:mo>+</mml:mo>
                           <mml:mover accent="true">
                              <mml:mi>I</mml:mi>
                              <mml:mo>¯</mml:mo>
                           </mml:mover>
                           <mml:mo>+</mml:mo>
                           <mml:mi>A</mml:mi>
                           <mml:mo>→</mml:mo>
                           <mml:mover accent="true">
                              <mml:mrow>
                                 <mml:mi>P</mml:mi>
                                 <mml:mn>2</mml:mn>
                              </mml:mrow>
                              <mml:mo stretchy="true">¯</mml:mo>
                           </mml:mover>
                           <mml:mo>+</mml:mo>
                           <mml:mover accent="true">
                              <mml:mi>I</mml:mi>
                              <mml:mo>¯</mml:mo>
                           </mml:mover>
                           <mml:mo>+</mml:mo>
                           <mml:mi>P</mml:mi>
                           <mml:mn>1</mml:mn>
                           <mml:mo>,</mml:mo>
                        </mml:mrow>
                        
                     </mml:semantics>
                  </mml:math></disp-formula> <disp-formula id="bmcM3a"><label>(3a)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M52" name="1752-0509-2-37-i24" overflow="scroll">
                     <mml:semantics>
                        <mml:mrow>
                           <mml:mover accent="true">
                              <mml:mrow>
                                 <mml:mi>P</mml:mi>
                                 <mml:mn>1</mml:mn>
                              </mml:mrow>
                              <mml:mo stretchy="true">¯</mml:mo>
                           </mml:mover>
                           <mml:mo>+</mml:mo>
                           <mml:mover accent="true">
                              <mml:mi>I</mml:mi>
                              <mml:mo>¯</mml:mo>
                           </mml:mover>
                           <mml:mo>+</mml:mo>
                           <mml:mi>A</mml:mi>
                           <mml:mo>→</mml:mo>
                           <mml:mover accent="true">
                              <mml:mrow>
                                 <mml:mi>P</mml:mi>
                                 <mml:mn>1</mml:mn>
                              </mml:mrow>
                              <mml:mo stretchy="true">¯</mml:mo>
                           </mml:mover>
                           <mml:mo>+</mml:mo>
                           <mml:mover accent="true">
                              <mml:mi>I</mml:mi>
                              <mml:mo>¯</mml:mo>
                           </mml:mover>
                           <mml:mo>+</mml:mo>
                           <mml:mi>P</mml:mi>
                           <mml:mn>2</mml:mn>
                           <mml:mo>,</mml:mo>
                        </mml:mrow>
                        
                     </mml:semantics>
                  </mml:math></disp-formula> <disp-formula id="bmcM4"><label>(4)</label><italic>P</italic>1 → ∅</disp-formula> <disp-formula id="bmcM5"><label>(5)</label><italic>P</italic>2 → ∅ }.</disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M53" name="1752-0509-2-37-i25" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M54" name="1752-0509-2-37-i26" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M55" name="1752-0509-2-37-i26" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M56" name="1752-0509-2-37-i25" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M57" name="1752-0509-2-37-i26" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M58" name="1752-0509-2-37-i25" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M59" name="1752-0509-2-37-i26" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M60" name="1752-0509-2-37-i25" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M61" name="1752-0509-2-37-i25" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M62" name="1752-0509-2-37-i26" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M63" name="1752-0509-2-37-i26" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M64" name="1752-0509-2-37-i25" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M65" name="1752-0509-2-37-i25" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M66" name="1752-0509-2-37-i26" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M67" name="1752-0509-2-37-i25" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M68" name="1752-0509-2-37-i26" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M69" name="1752-0509-2-37-i25" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M70" name="1752-0509-2-37-i26" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M71" name="1752-0509-2-37-i25" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M72" name="1752-0509-2-37-i25" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M73" name="1752-0509-2-37-i26" overflow="scroll"><mml:semantics><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="true">¯</mml:mo></mml:mover></mml:mrow></mml:semantics></mml:math></inline-formula>
<supplementary-material content-type="local-data" id="S1"><caption><title>Additional file 1</title><p>Supplement including the analyzed network models and a descritption of the employed algorithms to compute organizations.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S2"><caption><title>Additional file 2</title><p>The analyzed core model in SBML format.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S3"><caption><title>Additional file 3</title><p>The analyzed complete model in SBML format.</p></caption></supplementary-material>
<table-wrap-foot><p>For brevity, pseudo species indicating the absence of a species are not listed. A list of abbrevations can be found in the Supplement. A species followed by 'xt' denotes its extra-cellular form. "Ubiquitous proteins" include the proteins that are considered ubiquitously present in the cell and therefore are not listed separately. They are: Eno, Fba, Fbp, GalU, GapA, Glk, GpmA, GpmB, GpsA, PfkA, PfkB, Pgi, Pgm, PykA, and TpiA. "Input metabolites" denotes the metabolites provided as input to the system: HEXT (external hydrogen), Q (Ubiquinone), ATP, UTP, NAD, and NADP. "Glycolysis metabolites" denotes the metabolites of the glycolysis: G6P, F6P, FDP, T3P2, T3P1, 13PDG, 3PG, 2PG, PEP, and PYR. "Lactose derivatives" denotes the derivatives of lactose in the central metabolism: GAL1P, GLAC, UDPGAL, bDGLAC, bDGLC.</p></table-wrap-foot> <table-wrap-foot><p>Comparing <italic>in vivo </italic>knockout experiment results with predictions made by FBA, rFBA, OT and by aOT. A '+' indicates growth, a '-' no growth of the mutants on the indicated substrate(s). For cases denoted as 'N', data was not available. Results and predictions are derived from <italic>in vivo</italic>/FBA/rFBA/(a)OT. <italic>In vivo </italic>data and references, FBA and rFBA predictions are taken from Ref. [19]. In five instances, predictions made by OT deviate from rFBA predictions (bold cases). See text for discussion. The growth medium contained glucose (glc), glycerol (gl), succinate (suc), acetate (ac), or ribose (rib). Anaerobic condition is denoted by '-O<sub>2</sub>'.</p></table-wrap-foot>
<graphic xlink:href="1752-0509-2-37-1"/> <graphic xlink:href="1752-0509-2-37-2"/>
<media xlink:href="1752-0509-2-37-S1.pdf" mimetype="application" mime-subtype="pdf"><caption><p>Click here for file</p></caption></media> <media xlink:href="1752-0509-2-37-S2.xml" mimetype="text" mime-subtype="xml"><caption><p>Click here for file</p></caption></media> <media xlink:href="1752-0509-2-37-S3.xml" mimetype="text" mime-subtype="xml"><caption><p>Click here for file</p></caption></media>
[{"surname": ["Varma", "Palsson"], "given-names": ["A", "B"], "article-title": ["Metabolic Flux Balancing: Basic Concepts, Scientific and Practical Use"], "source": ["Bio/Technology"], "year": ["1994"], "volume": ["12"], "fpage": ["994"], "lpage": ["998"], "pub-id": ["10.1038/nbt1094-994"]}, {"surname": ["Centler", "Speroni di Fenizio", "Matsumaru", "Dittrich", "Deutsch A, Brusch L, Byrne H, de Vries G, Herzel HP"], "given-names": ["F", "P", "N", "P"], "article-title": ["Chemical organizations in the central sugar metabolism of "], "italic": ["Escherichia Coli"], "source": ["Mathematical Modeling of Biological Systems"], "year": ["2007"], "volume": ["I"], "publisher-name": ["Birkh\u00e4user, Boston"], "fpage": ["109"], "lpage": ["123"]}, {"surname": ["Fontana", "Buss"], "given-names": ["W", "LW"], "article-title": ["'The Arrival of the Fittest': Towards a Theory of Biological Organization"], "source": ["B Math Biol"], "year": ["1994"], "volume": ["56"], "fpage": ["1"], "lpage": ["64"]}, {"surname": ["Kauffman"], "given-names": ["SA"], "source": ["The Origins of Order: Self-Organization and Selection in Evolution"], "year": ["1993"], "publisher-name": ["Oxford University Press"]}, {"surname": ["Matsumaru", "Centler", "Speroni di Fenizio", "Dittrich"], "given-names": ["N", "F", "P", "P"], "article-title": ["Chemical Organization Theory as a Theoretical Base for Chemical Computing"], "source": ["Int J Unconv Comp"], "year": ["2007"], "volume": ["3"], "fpage": ["285"], "lpage": ["309"]}, {"surname": ["Centler", "Kaleta", "di Fenizio", "Dittrich"], "given-names": ["F", "C", "PS", "P"], "article-title": ["Computing Chemical Organizations in Biological Networks"], "source": ["Bioinformatics (accepted)"], "year": ["2008"]}, {"surname": ["Cronan", "LaPorte", "Neidhardt FC, III RC, Ingraham JL, Lin ECC, Low KB, Magasanik B, Reznikoff WS, Riley M, Schaechter M, Umbarger HE"], "given-names": ["JE", "D"], "article-title": ["Tricarboxylic acid cycle and glyoxylate bypass"], "source": ["Escherichia coli and Salmonella: cellular and molecular biology"], "year": ["1996"], "volume": ["1"], "publisher-name": ["Washington, D.C: ASM Press"], "fpage": ["206"], "lpage": ["216"]}, {"surname": ["Fraenkel", "Neidhardt FC, III RC, Ingraham JL, Lin ECC, Low KB, Magasanik B, Reznikoff WS, Riley M, Schaechter M, Umbarger HE"], "given-names": ["DG"], "article-title": ["Glycolysis"], "source": ["Escherichia coli and Salmonella: cellular and molecular biology"], "year": ["1996"], "volume": ["1"], "publisher-name": ["Washington, D.C: ASM Press"], "fpage": ["189"], "lpage": ["198"]}]
BMC Syst Biol. 2008 Apr 25; 2:37