<?xml version='1.0'?>
<!DOCTYPE art SYSTEM 'http://www.biomedcentral.com/xml/article.dtd'>
<art><ui>1752-0509-5-135</ui><ji>1752-0509</ji><fm>
<dochead>Research article</dochead>
<bibl>
<title>
<p>Environmental versatility promotes modularity in genome-scale metabolic networks</p>
</title>
<aug>
<au id="A1"><snm>Samal</snm><fnm>Areejit</fnm><insr iid="I1"/><insr iid="I2"/><email>samal@mis.mpg.de</email></au>
<au ca="yes" id="A2" ce="yes"><snm>Wagner</snm><fnm>Andreas</fnm><insr iid="I3"/><insr iid="I4"/><insr iid="I5"/><email>andreas.wagner@ieu.uzh.ch</email></au>
<au ca="yes" id="A3" ce="yes"><snm>Martin</snm><mi>C</mi><fnm>Olivier</fnm><insr iid="I1"/><insr iid="I6"/><email>olivier.martin@u-psud.fr</email></au>
</aug>
<insg>
<ins id="I1"><p>Laboratoire de Physique Th&#233;orique et Mod&#232;les Statistiques, CNRS and Univ Paris-Sud, UMR 8626, F-91405 Orsay Cedex, France</p></ins>
<ins id="I2"><p>Max Planck Institute for Mathematics in the Sciences, Inselstr. 22, 04103 Leipzig, Germany</p></ins>
<ins id="I3"><p>Institute of Evolutionary Biology and Environmental Studies, University of Zurich, Winterthurerstrasse 190, CH-8057 Zurich, Switzerland</p></ins>
<ins id="I4"><p>Swiss Institute of Bioinformatics, Quartier Sorge, Batiment Genopode, 1015 Lausanne, Switzerland</p></ins>
<ins id="I5"><p>The Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501, USA</p></ins>
<ins id="I6"><p>INRA, UMR 0320/UMR 8120 G&#233;n&#233;tique V&#233;g&#233;tale, Univ Paris-Sud, F-91190 Gif-sur-Yvette, France</p></ins>
</insg>
<source>BMC Systems Biology</source>
<issn>1752-0509</issn>
<pubdate>2011</pubdate>
<volume>5</volume>
<issue>1</issue>
<fpage>135</fpage>
<url>http://www.biomedcentral.com/1752-0509/5/135</url>
<xrefbib><pubidlist><pubid idtype="doi">10.1186/1752-0509-5-135</pubid><pubid idtype="pmpid">21864340</pubid></pubidlist></xrefbib>
</bibl>
<history><rec><date><day>31</day><month>5</month><year>2011</year></date></rec><acc><date><day>24</day><month>8</month><year>2011</year></date></acc><pub><date><day>24</day><month>8</month><year>2011</year></date></pub></history>
<cpyrt><year>2011</year><collab>Samal et al; licensee BioMed Central Ltd.</collab><note>This is an Open Access article distributed under the terms of the Creative Commons Attribution License (<url>http://creativecommons.org/licenses/by/2.0</url>), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</note></cpyrt>
<abs>
<sec>
<st>
<p>Abstract</p>
</st>
<sec>
<st>
<p>Background</p>
</st>
<p>The ubiquity of modules in biological networks may result from an evolutionary benefit of a modular organization. For instance, modularity may increase the rate of adaptive evolution, because modules can be easily combined into new arrangements that may benefit their carrier. Conversely, modularity may emerge as a by-product of some trait. We here ask whether this last scenario may play a role in genome-scale metabolic networks that need to sustain life in one or more chemical environments. For such networks, we define a network module as a maximal set of reactions that are fully coupled, <it>i.e</it>., whose fluxes can only vary in fixed proportions. This definition overcomes limitations of purely graph based analyses of metabolism by exploiting the functional links between reactions. We call a metabolic network viable in a given chemical environment if it can synthesize all of an organism's biomass compounds from nutrients in this environment. An organism's metabolism is highly versatile if it can sustain life in many different chemical environments. We here ask whether versatility affects the modularity of metabolic networks.</p>
</sec>
<sec>
<st>
<p>Results</p>
</st>
<p>Using recently developed techniques to randomly sample large numbers of viable metabolic networks from a vast space of metabolic networks, we use flux balance analysis to study <it>in silico </it>metabolic networks that differ in their versatility. We find that highly versatile networks are also highly modular. They contain more modules and more reactions that are organized into modules. Most or all reactions in a module are associated with the same biochemical pathways. Modules that arise in highly versatile networks generally involve reactions that process nutrients or closely related chemicals. We also observe that the metabolism of <it>E. coli </it>is significantly more modular than even our most versatile networks.</p>
</sec>
<sec>
<st>
<p>Conclusions</p>
</st>
<p>Our work shows that modularity in metabolic networks can be a by-product of functional constraints, e.g., the need to sustain life in multiple environments. This organizational principle is insensitive to the environments we consider and to the number of reactions in a metabolic network. Because we observe this principle not just in one or few biological networks, but in large random samples of networks, we propose that it may be a generic principle of metabolic network organization.</p>
</sec>
</sec>
</abs>
</fm><bdy>
<sec>
<st>
<p>Background</p>
</st>
<p>The architectures of most multi-cellular organisms are strikingly modular. On the one hand, such modularity can be spatial. Organisms are partitioned into organs and tissues whose cells have specialized functions <abbrgrp>
<abbr bid="B1">1</abbr>
<abbr bid="B2">2</abbr>
</abbrgrp>, and where cells of similar types are in close proximity. Such spatial modularity also exists within cells. Examples include organelles, spatial modules that allow specialized tasks to be performed in localized regions of a cell. Spatial modularity can be thought of as functional specialization according to spatial localization.</p>
<p>On the other hand, modularity can be topological, as research of the last ten years has shown. Such modularity is evident in biological networks such as protein-protein interaction networks <abbrgrp>
<abbr bid="B3">3</abbr>
<abbr bid="B4">4</abbr>
</abbrgrp>, transcriptional regulatory networks <abbrgrp>
<abbr bid="B5">5</abbr>
</abbrgrp>, or metabolic networks <abbrgrp>
<abbr bid="B6">6</abbr>
<abbr bid="B7">7</abbr>
<abbr bid="B8">8</abbr>
<abbr bid="B9">9</abbr>
<abbr bid="B10">10</abbr>
</abbrgrp>. In these systems, the networks - viewed as graphs - contain modules that are subsets of nodes strongly connected to each other but weakly connected to the remaining network. This kind of modularity does not involve explicit spatial location but nevertheless relies on a notion of proximity (of nodes in a network). If nodes within a module tend to be involved in the same biological or biochemical function, then both spatial and topological modularity point to a general architectural principle: The parts of an organism that perform specific tasks or functions are grouped into modules that can function semi-autonomously.</p>
<p>The prevalence of modularity (both spatial and topological) in living systems might have several ultimate evolutionary origins (see Ref. <abbrgrp>
<abbr bid="B11">11</abbr>
</abbrgrp> for a recent review). One long-standing idea is that modularity facilitates adaptation, in particular by enhancing the frequency at which new and useful traits appear, and by increasing their heritability. Indeed, modules that are semi-autonomous entities can be easily modified, added, replaced, or rearranged in a system through a process that has been called evolutionary tinkering <abbrgrp>
<abbr bid="B12">12</abbr>
<abbr bid="B13">13</abbr>
<abbr bid="B14">14</abbr>
</abbrgrp>. In this view, modularity would be favored by natural selection because it modifies the <it>rate </it>of adaptation <abbrgrp>
<abbr bid="B15">15</abbr>
<abbr bid="B16">16</abbr>
<abbr bid="B17">17</abbr>
</abbrgrp>. This scenario predicts that directional selection will bring forth organisms and networks that are highly modular; it can be particularly relevant for the evolution of complex traits <abbrgrp>
<abbr bid="B17">17</abbr>
<abbr bid="B18">18</abbr>
</abbrgrp>. A specific realization of this scenario arises in models of genetic network evolution when the environment is fluctuating and structured; modularity can then arise as a result of selection for a high rate of adaptation in changing environments <abbrgrp>
<abbr bid="B19">19</abbr>
<abbr bid="B20">20</abbr>
</abbrgrp>. But modularity in this scenario need not even require environmental change. In particular, it can emerge from innovations that allow adaptation to new ecological niches, as suggested by studies of metabolism <abbrgrp>
<abbr bid="B9">9</abbr>
<abbr bid="B10">10</abbr>
</abbrgrp>, or from innovations that increase fitness, as suggested from gene network studies <abbrgrp>
<abbr bid="B21">21</abbr>
</abbrgrp>.</p>
<p>In other scenarios for the origin of modularity, natural selection on the rate of adaptation does not shape modularity; instead modular architectures follow from developmental constraints, or from other phenomena related to epistasis and pleiotropy <abbrgrp>
<abbr bid="B11">11</abbr>
</abbrgrp>. In such scenarios, modularity can be the mere consequence of selection on other traits, but researchers do not agree on how general this scenario could be <abbrgrp>
<abbr bid="B22">22</abbr>
</abbrgrp>.</p>
<p>In the present work we focus on metabolism, and show that modularity in genome-scale metabolic networks may be a by-product of phenotypic constraints. We will show that this scenario is likely to be very general in metabolism for traits related to an organism's ability to live in different environments. We refer to this ability as an organism's metabolic <it>versatility</it>, and explain it further below. Specifically, we view metabolism as a complex chemical reaction network inside an organism and ask this question: Among all possible metabolic reaction networks with high versatility, do most have modular architectures?</p>
<p>In contrast to many other networks <abbrgrp>
<abbr bid="B23">23</abbr>
<abbr bid="B24">24</abbr>
</abbrgrp>, metabolic networks do not just have a static graph structure, but a function that involves the flow of molecules through them. This function can be used to define modules in a network based on <it>fully coupled sets </it>of reactions, as explained in the Methods and Results sections <abbrgrp>
<abbr bid="B25">25</abbr>
<abbr bid="B26">26</abbr>
<abbr bid="B27">27</abbr>
<abbr bid="B28">28</abbr>
<abbr bid="B29">29</abbr>
</abbrgrp>. We will measure a network's modularity by several indices based on these modules, and relate this modularity to versatility, a metabolism's ability to sustain life in different environments. Some organisms are metabolic specialists and can live in few environments, others are generalists that can thrive in many different environments. General principles of how a metabolic network must change as an organism's versatility varies remain elusive. One might try to find such principles by studying a broad panel of living organisms that differ in versatility. However, any association between versatility and some other observable quantity, such as modularity, would leave open whether the association between the two is driven by evolutionary forces that act not on versatility but on some other, unknown network property.</p>
<p>To avoid this difficulty, we can take advantage of our ability to create random samples of metabolic genotypes with specific properties, including versatility. (More precisely, the genotypes we consider are discretized binary metabolic genotypes, representations of genotypes that are suitably simplified for our purpose, as explained in Methods.) This approach <abbrgrp>
<abbr bid="B30">30</abbr>
</abbrgrp> allows us to examine the consequences of versatility for network modularity, in the absence of any other influences. We shall find that the ability to thrive in increasing numbers of environments is strongly associated with greater modularity of metabolic networks. Our observations support the idea that elementary properties of metabolic networks, such as their ability to sustain life in multiple environments, can contribute to shaping metabolic network structure and in particular modularity, without the need to consider evolutionary dynamics or selection on a rate of adaptation.</p>
<sec>
<st>
<p>Modeling framework</p>
</st>
<p>For our study, we use genome-scale metabolic network modeling. The set of chemical reactions that can take place in an organism and their associated metabolites define the organism's metabolic network. Each reaction is typically catalyzed by an enzyme that allows the transformation of substrate molecules into product molecules. With the advent of genome-scale metabolic network modeling <abbrgrp>
<abbr bid="B31">31</abbr>
<abbr bid="B32">32</abbr>
<abbr bid="B33">33</abbr>
<abbr bid="B34">34</abbr>
</abbrgrp>, it has become possible to compute which target products can be synthesized by a given set of enzymes, assuming that the network is in a metabolic steady state, and that specific nutrients are available to the network from the environment. The relevant computational method is based on balancing metabolic flux - the rate at which a reaction converts substrates into products - for all reactions, and is thus called flux balance analysis (FBA) <abbrgrp>
<abbr bid="B32">32</abbr>
<abbr bid="B35">35</abbr>
</abbrgrp>. Its predictions are usually in good agreement with experimental data <abbrgrp>
<abbr bid="B36">36</abbr>
<abbr bid="B37">37</abbr>
<abbr bid="B38">38</abbr>
</abbrgrp>, except where enzymes are mis-regulated, such that a network cannot attain optimal metabolic fluxes through all its reactions. (Such mis-regulation can be sometimes eliminated during laboratory evolution experiments <abbrgrp>
<abbr bid="B37">37</abbr>
<abbr bid="B39">39</abbr>
</abbrgrp>, if growth rate maximization is the sole objective of the experiment.)</p>
<p>An organism's set of enzyme coding genes, identified here with a list of reactions, can be viewed as a discretized binary metabolic genotype; for brevity we refer to it from here on as the organism's genotype or metabolic genotype. Specifically, given a total universe of <it>N </it>possible reactions, any genotype can be represented by a string of <it>N </it>bits, <it>G </it>= (<it>b<sub>1</sub>
</it>, <it>b<sub>2</sub>
</it>, ..., <it>b<sub>N</sub>
</it>) as illustrated in Additional File <supplr sid="S1">1</supplr> Figure S1a. If enzyme <it>i </it>is encoded in the organism's genome, then <it>b<sub>i </sub>
</it>= 1, while <it>b<sub>i </sub>
</it>= 0 otherwise. In this framework, the space of all metabolic genotypes contains 2<it>
<sup>N </sup>
</it>elements. Following previous work <abbrgrp>
<abbr bid="B30">30</abbr>
<abbr bid="B40">40</abbr>
</abbrgrp>, we here take the universe of reactions to encompass all known enzyme-catalyzed chemical reactions, as represented in publicly available databases <abbrgrp>
<abbr bid="B41">41</abbr>
<abbr bid="B42">42</abbr>
</abbrgrp>. This set of reactions is most likely incomplete, but nevertheless sufficiently comprehensive to produce a vast space of metabolic genotypes, where each genotype contains a subset of these reactions.</p>
<suppl id="S1">
<title>
<p>Additional file 1</p>
</title>
<text>
<p>
<b>Figures S1 to S7</b>. This file contains the following additional figures: Figure S1 - MCMC sampling of genotypes with a given phenotype; Figure S2 - a FCS predominantly consists of a reactions belonging to one biochemical pathway; Figure S3 -Example of a frequently arising FCS in sampled genotypes; Figure S4 - Environmental versatility enhances the modularity index <it>M </it>regardless of the value of <it>n</it>; Figure S5 -Environmental versatility enhances the number of modules <it>s </it>regardless of the value of <it>n</it>; Figure S6 - Example of FCSs that account for the increase in modularity with versatility; Figure S7 - Schematic diagram describing nested sets of environments used to sample genotypes with decreasing <it>V<sub>env</sub>
</it>.</p>
</text>
<file name="1752-0509-5-135-S1.DOC">
   <p>Click here for file</p>
</file>
</suppl>
<p>If an organism can grow in a specific chemical environment (defined through the nutrients it contains), its metabolic network is able to produce all of its biomass precursors (see Methods); we then call the organism (and by extension its metabolic network) <it>viable</it>. This leads us to define an organism's phenotype via its ability to synthesize biomass in a number of given chemical environments. Note that the mapping from genotype to phenotype in our approach is completely determined by the FBA framework. Previous research has shown that this map is highly degenerate, meaning that a huge number of genotypes will produce the same phenotype; indeed, many reactions in a metabolic network are typically non-essential and can be replaced by other reactions. Furthermore, genotypes of identical phenotype are such that small genotypic changes (a reaction deletion, addition, or exchange) connect these genotypes into a vast graph; we refer to this graph as a <it>genotype network</it>. A consequence of this connectivity property is that gradual evolution of genotypes is possible, while leaving the phenotype unchanged <abbrgrp>
<abbr bid="B30">30</abbr>
<abbr bid="B40">40</abbr>
</abbrgrp>. For this reason, genotype networks can facilitate evolutionary changes and adaptation of genotypes <abbrgrp>
<abbr bid="B43">43</abbr>
</abbrgrp>. Such properties seem to be generic properties of well-studied genotype to phenotype maps, and have been found in many systems. These include RNA and proteins, where the genotype is the sequence and the phenotype is the secondary or tertiary structure <abbrgrp>
<abbr bid="B44">44</abbr>
<abbr bid="B45">45</abbr>
<abbr bid="B46">46</abbr>
</abbrgrp>, as well as gene regulatory networks whose genotype specifies a pattern of genetic interactions and whose phenotype corresponds to a gene expression pattern <abbrgrp>
<abbr bid="B47">47</abbr>
</abbrgrp>.</p>
<p>To characterize metabolic networks of a given phenotype, we cannot examine all genotypes because of their astronomical number. Instead, we use a Markov Chain Monte Carlo (MCMC) <abbrgrp>
<abbr bid="B48">48</abbr>
</abbrgrp> approach to sample a space of genotypes or subsets thereof. This approach is based on performing random walks within that subspace, as illustrated in Additional File <supplr sid="S1">1</supplr> Figure S1c. At each step of such a random walk, a small change is applied to the current genotype and the phenotype of the changed genotype is computed; if the phenotype fulfills a pre-specified criterion, the current genotype is updated; if not, the change is rejected, and the current genotype is kept. With appropriate precautions <abbrgrp>
<abbr bid="B30">30</abbr>
</abbrgrp> this procedure will create uniform samples of the accessible space of genotypes with a desired phenotype.</p>
</sec>
</sec>
<sec>
<st>
<p>Results</p>
</st>
<sec>
<st>
<p>Fully Coupled Sets of reactions are proxies of pathways</p>
</st>
<p>The analysis of modularity in large graphs or networks is a mature field. Not surprisingly, multiple different measures of modularity have been developed <abbrgrp>
<abbr bid="B8">8</abbr>
<abbr bid="B49">49</abbr>
<abbr bid="B50">50</abbr>
<abbr bid="B51">51</abbr>
<abbr bid="B52">52</abbr>
<abbr bid="B53">53</abbr>
<abbr bid="B54">54</abbr>
</abbrgrp>. Identifying all modules of a large network can be computationally intractable, that is, NP difficult <abbrgrp>
<abbr bid="B55">55</abbr>
<abbr bid="B56">56</abbr>
</abbrgrp>. Fortunately, metabolic networks are special, because their analysis can go beyond graph-based representations. The reason is that metabolic networks synthesize biomass, and this function of metabolic networks can be quantified by studying the flow or <it>flux </it>of matter through each reaction in a network. Doing so permits an analysis of modularity that is based on network function, not just topology. Here we take advantage of the notion of <it>coupling </it>between reaction fluxes to identify sets of reactions that form a metabolic module. Such sets have been referred to as <it>reaction/enzyme subsets </it>or <it>correlated reaction sets </it>or Fully Coupled Sets <abbrgrp>
<abbr bid="B25">25</abbr>
<abbr bid="B26">26</abbr>
<abbr bid="B27">27</abbr>
<abbr bid="B28">28</abbr>
<abbr bid="B29">29</abbr>
</abbrgrp>. Hereafter we will use the term Fully Coupled Set (FCS) only. These sets define metabolic network modules that are both biochemically sensible <abbrgrp>
<abbr bid="B28">28</abbr>
<abbr bid="B29">29</abbr>
<abbr bid="B57">57</abbr>
<abbr bid="B58">58</abbr>
</abbrgrp> and computationally tractable <abbrgrp>
<abbr bid="B28">28</abbr>
</abbrgrp>. By definition, two reactions are in the same FCS if the ratio of their fluxes is fixed when considering all possible steady-state flux distributions through the metabolic network. Determining all FCSs of a large metabolic network can be done efficiently using linear optimization (see Methods). We note that the different FCSs in a metabolic network are disjoint, and that not all of a network's reactions need to belong to an FCS (see Methods).</p>
<p>The simplest possible FCS involves reactions in a linear biochemical pathway, arguably the most intuitive form of a functional module in biochemistry. However pathways with branches and cycles can also form FCSs <abbrgrp>
<abbr bid="B28">28</abbr>
</abbrgrp>. For illustration, Figure <figr fid="F1">1</figr> represents the largest FCS containing a cycle that arises in the <it>E. coli </it>metabolic network; it includes reactions that are involved in cell envelope biosynthesis.</p>
<fig id="F1"><title><p>Figure 1</p></title><caption><p>Example of a FCS in the <it>E. coli </it>metabolic network</p></caption><text>
   <p><b>Example of a FCS in the <it>E. coli </it>metabolic network</b>. We display a FCS of 12 reactions in the <it>E. coli </it>metabolic network that is branched and contains a cycle. In this figure, the (hyper) edges represent reactions involving metabolites. Green edges represent irreversible reactions and red edges represent reversible reactions. To reduce clutter, the ubiquitous high degree metabolites such as ATP, NADH, etc. have been omitted from this figure. Abbreviations of metabolite names are as follows: 26dap-M = meso-2,6-Diaminoheptanedioate; ala-D = D-Alanine; ala-L = L-Alanine; glu-D = D-Glutamate; glu-L = L-Glutamate; peptido_EC = Peptidoglycan subunit; uaagmda = Undecaprenyl-diphospho-N-acetylmuramoyl-(N-acetylglucosamine)-L-ala-D-glu-meso-2,6-diaminopimeloyl-D-ala-D-ala; uaccg = UDP-N-acetyl-3-O-(1-carboxyvinyl)-D-glucosamine; uacgam = UDP-N-acetyl-D-glucosamine; uagmda = Undecaprenyl-diphospho-N-acetylmuramoyl-L-alanyl-D-glutamyl-meso-2,6-diaminopimeloyl-D-alanyl-D-alanine; uama = UDP-N-acetylmuramoyl-L-alanine; uamag = UDP-N-acetylmuramoyl-L-alanyl-D-glutamate; uamr = UDP-N-acetylmuramate; udcpdp = Undecaprenyl diphosphate; udcpp = Undecaprenyl phosphate; ugmd = UDP-N-acetylmuramoyl-L-alanyl-D-gamma-glutamyl-meso-2,6-diaminopimelate; ugmda = UDP-N-acetylmuramoyl-L-alanyl-D-glutamyl-meso-2,6-diaminopimeloyl-D-alanyl-D-alanine.</p>
</text><graphic file="1752-0509-5-135-1"/></fig>
<p>We first asked how modules, as defined by FCSs, relate to conventional biochemical pathways, the classical functional modules of metabolism. To this end, we mapped reactions in many different FCSs onto biochemical pathways, as defined by standardized annotations <abbrgrp>
<abbr bid="B41">41</abbr>
<abbr bid="B59">59</abbr>
</abbrgrp>. We relied on annotations in the Kyoto Encyclopedia of Genes and Genomes database (KEGG) <abbrgrp>
<abbr bid="B41">41</abbr>
</abbrgrp>, a comprehensive metabolic database that annotates biochemical reactions as belonging to a list of pathways. For the metabolic network of <it>E. coli</it>, we find that reactions in the same FCS typically belong to a common pathway. To quantify whether this property was statistically significant, we implemented the following test.</p>
<p>For each FCS, we identified the pathway annotation for all of its reactions. Because each reaction can be annotated as belonging to multiple pathways, we identified for each FCS the pathway annotation that is shared by most of its reactions. We defined the quantity Q as the fraction of reactions that are annotated as belonging to that pathway, and computed Q for each FCS in the metabolic network of <it>E. coli</it>. We observed that in most FCSs (50 percent, corresponding to 50 of 100 FCSs in <it>E. coli</it>) all reactions belonged to the same pathway, and nearly 75 percent of FCSs had more than 75 percent of their reactions belonging in the same pathway. This strong association of reactions in an FCS with one pathway is not expected by chance alone, as a randomization test shows (P &lt; 0.001). Thus, most of the FCSs in <it>E. coli </it>can be viewed as biochemical pathways or parts thereof.</p>
<p>The same analysis can be applied to random samples of metabolic networks with specific properties, as generated by our MCMC sampling procedure (see Methods). Specifically, we first identified FCSs from 1000 <it>in silico </it>metabolic genotypes viable in all of the 89 carbon source environments we consider (see Methods). In this analysis, we observed that in most FCSs (74 percent, corresponding to 45,893 of 62,148 FCSs examined) all reactions belonged to the same pathway, and nearly 80 percent of FCSs had more than 80 percent of their reactions in the same pathway (see Additional File <supplr sid="S1">1</supplr> Figure S2). Just like <it>E. coli</it>, the strong association is not expected by chance alone, as a randomization test shows (P &lt; 0.001; see Methods). Thus, both for <it>E. coli </it>and for our random samples, most FCSs can be viewed as biochemical pathways or as parts thereof. To illustrate such FCSs, Additional File <supplr sid="S1">1</supplr> Figure S3 shows the most frequent FCS comprising five or more reactions that we found in our sampling. This FCS occurred in 898 of the 1000 metabolic genotypes. All its reactions belong to histidine metabolism (Q = 1).</p>
</sec>
<sec>
<st>
<p>Both measures of modularity <it>M </it>and <it>s </it>increase with versatility</p>
</st>
<p>We next asked quantitatively how network modularity is affected by environmental versatility. To answer this question, we defined two indices of network modularity, which we call <it>M </it>and s. The first index is the number <it>M </it>of reactions in a network that belong to FCSs. Then we calculate the average <it>&lt;M&gt; </it>for a sample of networks generated by our MCMC procedure, where each network in the sample needs to be viable in a given set <it>V<sub>env </sub>
</it>of chemical environments (see Methods). We consider <it>V<sub>env </sub>
</it>as an index of <it>environmental versatility </it>for these metabolic networks. In our analysis, we study up to 89 minimal chemical environments that differ only in the <it>sole </it>carbon source they contain (see Methods and Additional File <supplr sid="S2">2</supplr> Table S1). In other words, <it>V<sub>env </sub>
</it>indicates the number of sole carbon sources from which these networks can synthesize all essential biomass precursors. To see how our observations depended on the sets of carbon sources used, we investigated different choices for these sets, where sets of fewer carbon sources were nested within sets of more carbon sources (see Methods for further details).</p>
<suppl id="S2">
<title>
<p>Additional file 2</p>
</title>
<text>
<p>
<b>Tables S1 and S2</b>. This file contains the following additional tables: Table S1 - The list of 89 minimal environments; Table S2 - The list of autocatalytic metabolites.</p>
</text>
<file name="1752-0509-5-135-S2.XLS">
   <p>Click here for file</p>
</file>
</suppl>
<p>In Figure <figr fid="F2">2a</figr> we show how &lt;<it>M</it>&gt; depends on versatility <it>V<sub>env</sub>
</it>, both on average (yellow dots), and for multiple different nested sets of carbon sources (symbols with different colors and shapes). The analysis is based on metabolic networks with the same number of reactions as <it>E. coli </it>
<abbrgrp>
<abbr bid="B42">42</abbr>
</abbrgrp>. The data show that greater versatility leads to higher values of the modularity index; this trend is clear when considering the average over all choices of carbon sources, and also when considering the different nested sets.</p>
<fig id="F2"><title><p>Figure 2</p></title><caption><p>A higher modularity index <it>M </it>and a greater number of modules <it>s </it>are by-products of increasing environmental versatility</p></caption><text>
   <p><b>A higher modularity index <it>M </it>and a greater number of modules <it>s </it>are by-products of increasing environmental versatility</b>. The Environmental Versatility Index (<it>V<sub>env</sub></it>, horizontal axis in both (a) and (b)) denotes the number of minimal environments in which a genotype is forced to be viable. The modularity index <it>M </it>(vertical axis in (a)) for a genotype gives the number of reactions contained in the FCSs of that genotype. The number of FCSs (modules) in a metabolic network genotype is denoted by <it>s </it>(vertical axis in (b)). The figure shows that with increasing <it>V<sub>env</sub></it>, both <it>M </it>and the number of modules <it>s </it>in a genotype increase. The data shown here are based on MCMC sampled genotypes with <it>n </it>= 831 reactions (as in the <it>in silico E. coli </it>metabolic model), and 10 different choices for nested sets of environments when requiring viability on more and more environments. Each choice of nested set is displayed with a different color and symbol in (a) and (b). Each of the 10 nested sets, as well as their average (line shown for visual guidance), show a clear rise in the average of <it>M </it>(panel a) and the average of <it>s </it>(panel b) as one increases <it>V<sub>env</sub></it>.</p>
</text><graphic file="1752-0509-5-135-2" hint_layout="single"/></fig>
<p>As a network's versatility rises, does an increase in <it>M </it>- the number of reactions in FCSs - occur through an increase in the size of the FCSs, or through an increase in the number of FCSs, while their size remains constant? To address this question, we next studied the number of FCSs, which we denote by <it>s</it>, our second index of modularity. We applied the procedures we described earlier to the same genotypes as before, averaging now the number of modules (FCSs) rather than the number of reactions in these modules.</p>
<p>Figure <figr fid="F2">2b</figr> shows the average number of modules, which we denote as &lt;<it>s</it>&gt;, for the same 1000 metabolic genotypes, the same choices of <it>V<sub>env</sub>
</it>, and the same nested sets of environments as above. The figure shows that greater versatility leads to higher values of this modularity index. This holds for the averages over different nested sets (yellow dots), and also without averaging, <it>i.e</it>., for different nested sets of carbon sources (symbols of different shapes and colors). Both &lt;<it>M</it>&gt; and &lt;<it>s</it>&gt; show a monotonic increase with <it>V<sub>env </sub>
</it>but with possible deviations from linearity.</p>
<p>The results of Figure <figr fid="F2">2</figr> were obtained from networks whose number <it>n </it>of reactions equaled that of the <it>E. coli </it>metabolic network, <it>i.e</it>., <it>n </it>= 831 <abbrgrp>
<abbr bid="B42">42</abbr>
</abbrgrp>. Additional File <supplr sid="S1">1</supplr> Figures S4 and S5 show that the patterns we see are not sensitive to the number of reactions in a network. Specifically, Additional File <supplr sid="S1">1</supplr> Figure S4 shows that the average number of reactions in FCSs, <it>&lt;M&gt;</it>, increases with versatility <it>V<sub>env </sub>
</it>also for networks with <it>n </it>= 500 (Figure S4a) and <it>n </it>= 700 (Figure S4b) reactions. The sole difference to the data of Figure <figr fid="F2">2a</figr> is that the increase of <it>&lt;M&gt; </it>is beginning to level off as <it>V<sub>env </sub>
</it>reaches the largest values investigated here, in particular for <it>n </it>= 500. Additional File <supplr sid="S1">1</supplr> Figure S5 shows that the average number of modules, &lt;<it>s</it>&gt;, also increases with versatility at <it>n </it>= 500 (Figure S5a) and <it>n </it>= 700 (Figure S5b) reactions. However, in contrast to the trend for &lt;<it>M</it>&gt; in Additional File <supplr sid="S1">1</supplr> Figure S4, the increase in &lt;<it>s</it>&gt; does not slow down for the largest values of <it>V<sub>env </sub>
</it>we have examined.</p>
</sec>
<sec>
<st>
<p>Modular architecture of the <it>E. coli </it>metabolic network</p>
</st>
<p>So far we have shown averages of our modularity measures <it>M </it>and <it>s </it>based on samples of random networks of a given versatility. In such a sample, modularity has a distribution, where some networks are more modular, and others less so. We can use this distribution to ask whether the modularity observed in the metabolic network of an organism such as <it>E. coli </it>is atypically high or low. In other words, the distribution of modularity arising in our samples of <it>in silico </it>metabolic networks can provide a null hypothesis to evaluate whether a biological network shows unusual modularity.</p>
<p>Figure <figr fid="F3">3a</figr> shows the distribution of the total number <it>M </it>of reactions in modules, and Figure <figr fid="F3">3b</figr> shows the distribution of the number <it>s </it>of modules (FCSs) in a sample of 1000 random networks with <it>n </it>= 831 reactions (the same as <it>E.coli </it>
<abbrgrp>
<abbr bid="B42">42</abbr>
</abbrgrp>), where each network is able to sustain growth on the 89 different sole carbon sources as given in Ref. <abbrgrp>
<abbr bid="B29">29</abbr>
</abbrgrp>. This phenotype constitutes the <it>in silico </it>
<it>E. coli </it>metabolic phenotype we use. The figure also shows the values of <it>M </it>and <it>s </it>for the metabolic network of <it>E. coli</it>. The data from the network sample allows us to test the null hypothesis that <it>M </it>or <it>s </it>for <it>E. coli </it>could have been drawn from the sample. We find that <it>M </it>is atypically large, being in the top 3 percentile of our MCMC sample. This allows us to reject the null hypothesis at a P-value of P = 0.028. Based on this analysis, we conclude that the metabolic network of <it>E. coli </it>is more modular than expected.</p>
<fig id="F3"><title><p>Figure 3</p></title><caption><p>Distribution of <it>M </it>and of the number of modules <it>s </it>for genotypes of phenotype with <it>V<sub>env </sub></it>= 89 in an ensemble and comparison with <it>E. coli</it></p></caption><text>
   <p><b>Distribution of <it>M </it>and of the number of modules <it>s </it>for genotypes of phenotype with <it>V<sub>env </sub></it>= 89 in an ensemble and comparison with <it>E. coli</it></b>. The horizontal axis shows the modularity index <it>M </it>in (a) and the number of modules <it>s </it>in (b). The vertical axis shows the frequency of genotypes with the corresponding value of <it>M </it>(panel a) and <it>s </it>(panel b) in a random sample of 1000 genotypes (<it>n </it>= 831 reactions each, as in the <it>in silico E. coli </it>metabolic model) that are viable in <it>V<sub>env </sub></it>= 89 different minimal environments. In both panels, the histogram is displayed along with estimates of <it>M </it>and <it>s </it>for <it>E. coli</it>. From (a), we can reject at a p-value of 0.028 the hypothesis that the modularity index <it>M </it>of <it>E. coli </it>is drawn from this same distribution. Thus, <it>E. coli </it>can be considered as atypically modular.</p>
</text><graphic file="1752-0509-5-135-3" hint_layout="single"/></fig>
<p>The architecture of the <it>E. coli </it>metabolic network has higher modularity than anticipated, but the large value of <it>M </it>may come from either a greater number of FCSs or from an increased size of the FCSs. Figure <figr fid="F3">3b</figr> shows that the number of FCSs in <it>E. coli </it>is just slightly above the position of the distribution's peak in our ensemble, well within one standard deviation. From this observation one can conclude that the atypically high modularity of the <it>E. coli </it>network stems from the fact that <it>E. coli </it>has larger modules (FCSs) but not much more modules than typical networks allowing growth on 89 carbon sources.</p>
</sec>
<sec>
<st>
<p>Reactions in versatility-dependent FCSs are just downstream of nutrients</p>
</st>
<p>Thus far, we saw that metabolic networks sustaining growth on more nutrients have higher modularity, that is, more reactions contained in modules and more modules (FCSs) (see Figure <figr fid="F2">2</figr>). We surmised that these additional reactions would be closely linked to the additional nutrients that metabolic networks must utilize as their versatility increases. In other words, these reactions and the modules they reside in presumably are needed to metabolize these nutrients, and may thus occur just downstream of them. To inquire whether this is the case, we compared the FCSs of genotypes with maximal versatility (<it>V<sub>env </sub>
</it>= 89) to FCSs of genotypes with <it>V<sub>env </sub>
</it>= 1. Specifically, we first extracted the reactions that belonged to FCSs and that occurred in more than 50 percent of the genotypes in each of the two samples. Call these sets of reactions R<sub>89 </sub>and R<sub>1</sub>, for the ensembles with <it>V<sub>env </sub>
</it>= 89 and <it>V<sub>env </sub>
</it>= 1, respectively. At a qualitative level, we find that about 90% of reactions in R<sub>1 </sub>also belong to R<sub>89</sub>. We then examined the reactions that belong to R<sub>89 </sub>but that are not part of R<sub>1</sub>, and called this set of reactions R<sub>89</sub>\R<sub>1</sub>. Are the reactions in R<sub>89</sub>\R<sub>1 </sub>immediately downstream of the nutrients? The notion of downstream can be made quantitative through the <it>Scope </it>algorithm <abbrgrp>
<abbr bid="B60">60</abbr>
<abbr bid="B61">61</abbr>
</abbrgrp>. A reaction of scope distance one can use the nutrients as its only substrates, a reaction of scope distance two can use products of reactions at scope distance at most one, and so on. (See Methods for a more detailed explanation of this scope distance.) We applied this algorithm to compare the scope distances of reactions in R<sub>89</sub>\R<sub>1 </sub>to the scope distances of all reactions in our universe of reactions. Figure <figr fid="F4">4</figr> shows a distribution of these distances for both groups of reactions. It indicates that reactions associated in R<sub>89</sub>\R<sub>1 </sub>generally have smaller scope distance than other reactions. A statistical test (see Methods) shows that this difference is significant with a p-value of 10<sup>-5</sup>. In sum, reactions of modules involved in increased versatility tend to be more closely downstream of nutrients, suggesting that they typically belong to pathways metabolizing such nutrients. To illustrate this property with concrete examples, we determined which FCSs in R<sub>89</sub>\R<sub>1 </sub>involved any of the 24 reactions occurring at scope distance 1 in Figure <figr fid="F4">4b</figr>. These FCSs have various sizes that range from 2 to 4 reactions. In Additional File <supplr sid="S1">1</supplr> Figure S6 we show the three largest of these FCSs, all of them with 4 reactions, together with the pathways they belong to. These FCSs are linear pathways containing reactions of scope distance 1, 2, 3 and 4; they metabolize the nutrients fucose, rhamnose and 3-hydroxycinnamic acid.</p>
<fig id="F4"><title><p>Figure 4</p></title><caption><p>The increase in modularity with <it>V<sub>env </sub></it>can be attributed to reactions that are close to nutrients</p></caption><text>
   <p><b>The increase in modularity with <it>V<sub>env </sub></it>can be attributed to reactions that are close to nutrients</b>. The sampled genotypes with <it>V<sub>env </sub></it>= 89 typically have additional FCSs compared to sampled genotypes with <it>V<sub>env </sub></it>= 1. The reactions in these additional FCSs are not typical of the whole reaction network, and instead cluster at small distances from the nutrients. (See Methods for the determination of these distances using the <it>Scope </it>algorithm.) The distribution of distances for these reactions in additional FCSs is clearly concentrated at much smaller values than the distribution for all possible reactions; a Kolmogorov-Smirnov (K-S) test yields a p-value of 10<sup>-5</sup>, allowing us to reject the hypothesis that the two distributions are the same. Furthermore, a two sample Welch t-test gives a p-value of 8 &#215; 10<sup>-8</sup>, allowing us to also reject the hypothesis that the mean of the two distributions are the same. <b>a) </b>Distribution of scope distances from the nutrients for all possible reactions. <b>b) </b>Distribution of scope distances from the nutrients for those reactions belonging to additional FCSs that differentiate the sampled genotypes at <it>V<sub>env </sub></it>= 89 from those at <it>V<sub>env </sub></it>= 1.</p>
</text><graphic file="1752-0509-5-135-4" hint_layout="single"/></fig>
</sec>
</sec>
<sec>
<st>
<p>Discussion and conclusions</p>
</st>
<p>Our work took advantage of a new computational method <abbrgrp>
<abbr bid="B30">30</abbr>
<abbr bid="B40">40</abbr>
</abbrgrp> that uses a combination of flux balance analysis and Markov Chain Monte Carlo sampling to create large and random samples of metabolic networks with desired properties from the space of all possible metabolic networks. The property we focused on was environmental versatility, the number of chemical environments a metabolic network can sustain life in. We studied how versatility relates to a network's modularity. For our purpose, we defined modularity as the total number of reactions contained in fully coupled sets. We found that more versatile networks are more modular (they have more modules and more reactions contained in modules) than less versatile networks. We emphasize that this does not result from the fact that networks with more reactions are more versatile, because our analysis uses networks with fixed number of reactions. The reactions that form part of newly arising modules in highly versatile networks tend to be close to reactions that process nutrients. The advantage of using random samples of metabolic networks with a specific property for our analysis is that such samples have not been subject to any of the (usually unknown) selection pressures that an organism's metabolism is subject to, and that they can form a useful reference point to ask whether any one organism's metabolic network has typical or atypical properties. In such a comparison, we learned that <it>E. coli</it>'s network is significantly more modular than random networks of the same versatility, a feature arising mainly from the fact that it contains larger modules.</p>
<p>Modularity in metabolic networks has been studied by several other authors <abbrgrp>
<abbr bid="B6">6</abbr>
<abbr bid="B7">7</abbr>
<abbr bid="B8">8</abbr>
<abbr bid="B9">9</abbr>
<abbr bid="B10">10</abbr>
</abbrgrp>. Metabolic networks can be represented as graphs, allowing one to study topological (graph-based) measures of modularity; this approach has been taken for metabolic and other systems, such as protein interaction networks. Unfortunately, for any sensible definition of modularity, graph-based module identification is typically computationally very expensive, so in practice one resorts to heuristic algorithms to extract modules <abbrgrp>
<abbr bid="B49">49</abbr>
<abbr bid="B51">51</abbr>
<abbr bid="B52">52</abbr>
</abbrgrp>. Additionally, in graph-based representations of metabolism, many metabolites have very high degree (number of reactions they participate in). This feature may prevent any clear modules from arising, although various heuristic tricks, such as removing high degree metabolites <abbrgrp>
<abbr bid="B6">6</abbr>
<abbr bid="B7">7</abbr>
<abbr bid="B8">8</abbr>
<abbr bid="B9">9</abbr>
<abbr bid="B10">10</abbr>
</abbrgrp> can be used to skirt this problem. Problems like these can be avoided by using <it>functional </it>measures of modularity. Commonly used measures involve elementary flux mode or extreme pathways <abbrgrp>
<abbr bid="B25">25</abbr>
<abbr bid="B26">26</abbr>
<abbr bid="B27">27</abbr>
</abbrgrp>, but they are ill-suited for genome-scale modeling because of the complexity in computing them. The measure of modularity we used here was based on the reactions contained in fully coupled sets (FCSs) <abbrgrp>
<abbr bid="B28">28</abbr>
</abbrgrp>. We showed that most or all reactions in a fully coupled set fall within a single metabolic pathway, which underlines the biochemical relevance of our definition of modularity. Two further technical advantages come with our definition of modularity based on FCSs: (1) the approach involves no adjustable parameters; (2) identification of FCSs is computationally efficient even for genome-scale networks.</p>
<p>Intriguingly, the extent of modularity found in <it>E. coli </it>is higher than in our <it>in silico </it>genomes. <it>E. coli </it>both has more fully coupled sets and larger fully coupled sets than expected for networks with the highest versatility we consider. This high modularity may reflect the fact that <it>E. coli </it>is even more versatile than the most versatile networks in our samples, networks that are viable on 89 carbon sources. For example, it can also grow on sources of sulfur or nitrogen that we did not consider. The high computational cost of our analysis in multiple environments currently prohibits us from extending our study to a larger spectrum of environments. Conversely, the high modularity of <it>E. coli </it>might also be caused by other factors, for example, a long record of past evolutionary adaptations that may favor modularity through the high rates of adaptation it may allow and/or its high heritability, e.g. through horizontal gene transfer <abbrgrp>
<abbr bid="B62">62</abbr>
<abbr bid="B63">63</abbr>
</abbrgrp>. Indeed it has been shown that FCSs and operons in <it>E. coli </it>are positively associated <abbrgrp>
<abbr bid="B29">29</abbr>
<abbr bid="B57">57</abbr>
<abbr bid="B58">58</abbr>
</abbrgrp>. Only future work will be able to validate which of these causes is more important in <it>E.coli</it>. Our network sampling approach has the advantage that it provides a rational expectation for how modular a network can be expected to be based solely on phenotypic constraints. It thus puts answering this question within reach.</p>
<p>Given the ubiquity of modularity in biological systems, it is tempting to propose general principles that might explain its appearance. By comparing natural with man-made systems and following the original insights of Jacob <abbrgrp>
<abbr bid="B12">12</abbr>
</abbrgrp> and others <abbrgrp>
<abbr bid="B1">1</abbr>
<abbr bid="B2">2</abbr>
<abbr bid="B3">3</abbr>
<abbr bid="B4">4</abbr>
<abbr bid="B5">5</abbr>
<abbr bid="B6">6</abbr>
<abbr bid="B8">8</abbr>
<abbr bid="B9">9</abbr>
<abbr bid="B10">10</abbr>
<abbr bid="B11">11</abbr>
</abbrgrp>, it seems very plausible that modularity should emerge during adaptive evolutionary trajectories because it can increase the rate of adaptive change. This holds true in particular in artificial systems such as factories, companies and even industries, where modularity allows for lower costs and enhanced possibilities for innovation <abbrgrp>
<abbr bid="B64">64</abbr>
<abbr bid="B65">65</abbr>
<abbr bid="B66">66</abbr>
</abbrgrp>. As long as a lineage of organisms is experiencing adaptive evolutionary change, modularity should remain ubiquitous, whereas in long periods of stasis modularity may become reduced. This perspective is appealing but other factors may also influence modularity, which can be seen by considering the modularity of eukaryotic cells. The organization of cells into parts with specialized tasks (organelles, ribosomes, etc.) suggests that cellular tasks are best performed in specialized modules. One may thus conjecture that modularity has not only the indirect benefit of accelerating the rate of evolutionary change, but also direct benefits such as the possibility to perform certain tasks better, and thereby allow organisms to be better adapted to the complex world around them.</p>
<p>The question whether biological modularity may have a direct benefit can be addressed in systems where a realistically complex yet computationally tractable genotype to phenotype relationship exists. Genome-scale metabolic network models are such systems <abbrgrp>
<abbr bid="B32">32</abbr>
</abbrgrp>. Answering the question amounts to finding out whether the best performing genotypes (according to some criterion) have a modular architecture. The criterion we used is based on the complex trait we called environmental versatility, the number of environments a metabolic network can sustain life in. The answer we found is clear: Requiring viability in additional environments requires additional pathways or modules to metabolize more nutrients and thus versatility enhances modularity.</p>
<p>Our analysis shows that modularity can be a by-product of versatility, at least in the framework of our metabolic modeling, because our system has no selective pressure on modularity per-se; highly versatile networks that are also highly modular are simply more numerous than the less modular ones. In the language of constraint satisfaction problems <abbrgrp>
<abbr bid="B67">67</abbr>
</abbrgrp>, constraints are easier to satisfy using modular architectures, so highly modular solutions will be more numerous than the less modular ones. An analogy with the engineering of network architectures may be appropriate here. Consider the circuit layout problem where a circuit's electronic components and wires must be placed on a chip. If no constraints are imposed on the circuit's speed, many different layouts are possible. But, if one focuses on the fastest circuits, one will find that they have shorter wires and are more modular, so modularity is a by-product of circuit speed. In this example, functional constraints change the architectural characteristics in the space of possible solutions. Such a property may be expected to arise in both artificial and natural systems.</p>
<p>Since versatility corresponds to viability in increasing numbers of environments, it can be considered as a trait associated with fitness itself. Our work suggests that modularity can emerge as a consequence of increasing functional constraints. Because our work is not just based on one or few metabolic networks from well-studied organism, but on large samples of random viable networks, we also suggest that this scenario may be generally important. Recent observations by Parter et al. <abbrgrp>
<abbr bid="B9">9</abbr>
</abbrgrp> and Kreimer et al. <abbrgrp>
<abbr bid="B10">10</abbr>
</abbrgrp> where generalists prokaryotes living in many different environments are more modular than specialists are fully consistent with this conclusion.</p>
</sec>
<sec>
<st>
<p>Methods</p>
</st>
<sec>
<st>
<p>Flux Balance Analysis (FBA)</p>
</st>
<p>Flux balance analysis (FBA) <abbrgrp>
<abbr bid="B32">32</abbr>
<abbr bid="B35">35</abbr>
</abbrgrp> is a computational modeling approach widely used to analyze genome-scale metabolic networks. FBA uses structural information contained in the stoichiometric coefficients of each reaction in a metabolic network to predict the possible steady state fluxes of all reactions and the maximum biomass yield of an organism. FBA does not require knowledge of metabolite concentrations or detailed information of enzyme kinetics. The stoichiometric coefficients of all reactions in a network are encapsulated in a matrix <b>S </b>of dimensions <it>m </it>x <it>n</it>, where <it>m </it>is the number of metabolites and <it>n </it>is the number of reactions. Note that some of these reactions correspond to transport processes, <it>i.e</it>., they import or export metabolites. In a metabolic steady state, such as might be attained in a growing cell population with adequate nutrient supply, the metabolites achieve a dynamic mass balance wherein the vector <b>v </b>of metabolic fluxes through the reactions satisfies the equation</p>
<p>
<display-formula id="M1">
<m:math name="1752-0509-5-135-i1" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:mrow>
   <m:mstyle mathvariant="bold">
      <m:mi>S</m:mi>
      <m:mi>v</m:mi>
   </m:mstyle>
   <m:mo class="MathClass-rel">=</m:mo>
   <m:mn>0</m:mn>
</m:mrow>
</m:math>
</display-formula>
</p>
<p>so as to satisfy mass conservation. Eq. 1 represents stoichiometric and mass balance constraints on the metabolic network. For genome-scale metabolic networks, Eq. 1 leads to an under-determined system of linear equations in the metabolic fluxes, leading to a large solution space of allowable fluxes. The space of allowable solutions can be reduced by incorporating thermodynamic constraints associated with irreversible reactions, as well as flux capacity constraints which limit the maximum flux through certain reactions. To obtain a particular solution, linear programming (LP) is used to find a set of flux values - a point in the solution space - that maximizes a biologically relevant linear objective function <it>Z</it>. The LP formulation of the FBA problem can be written as:</p>
<p>
<display-formula id="M2">
<m:math name="1752-0509-5-135-i2" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:mrow>
   <m:mo class="qopname">max</m:mo>
   <m:mspace width="0.3em" class="thinspace"/>
   <m:mi>Z</m:mi>
   <m:mo class="MathClass-rel">=</m:mo>
   <m:mo class="qopname"> max</m:mo>
   <m:mrow>
      <m:mo class="MathClass-open">{</m:mo>
      <m:mrow>
         <m:msup>
            <m:mrow>
               <m:mstyle mathvariant="bold">
                  <m:mi>c</m:mi>
               </m:mstyle>
            </m:mrow>
            <m:mrow>
               <m:mi>T</m:mi>
            </m:mrow>
         </m:msup>
         <m:mstyle mathvariant="bold">
            <m:mi>v</m:mi>
         </m:mstyle>
         <m:mo class="MathClass-rel">|</m:mo>
         <m:mstyle mathvariant="bold">
            <m:mi>S</m:mi>
            <m:mi>v</m:mi>
         </m:mstyle>
         <m:mo class="MathClass-rel">=</m:mo>
         <m:mn>0</m:mn>
         <m:mo class="MathClass-punc">,</m:mo>
         <m:mstyle mathvariant="bold">
            <m:mi>a</m:mi>
         </m:mstyle>
         <m:mo class="MathClass-rel">&#8804;</m:mo>
         <m:mstyle mathvariant="bold">
            <m:mi>v</m:mi>
         </m:mstyle>
         <m:mo class="MathClass-rel">&#8804;</m:mo>
         <m:mstyle mathvariant="bold">
            <m:mi>b</m:mi>
         </m:mstyle>
      </m:mrow>
      <m:mo class="MathClass-close">}</m:mo>
   </m:mrow>
</m:mrow>
</m:math>
</display-formula>
</p>
<p>where the vector <b>c </b>corresponds to the coefficients of the objective function <it>Z</it>, and vectors <b>a </b>and <b>b </b>contain the lower and upper limits of different metabolic fluxes in <b>v</b>. The objective function <it>Z </it>is often chosen to be the so-called growth flux. This is the flux through an artifactual reaction that reflects the synthesis of biomass, which requires biosynthesis of biomass precursor molecules, such as amino acids and nucleotides, in specific proportions. The stoichiometry of this reaction is based on the experimentally measured biomass composition of an organism. The predictions from the FBA framework and related approaches are often in good agreement with experimental results <abbrgrp>
<abbr bid="B36">36</abbr>
<abbr bid="B37">37</abbr>
<abbr bid="B38">38</abbr>
<abbr bid="B68">68</abbr>
</abbrgrp>.</p>
</sec>
<sec>
<st>
<p>Reaction database</p>
</st>
<p>In this work, we have used a hybrid database compiled by Rodrigues and Wagner <abbrgrp>
<abbr bid="B40">40</abbr>
</abbrgrp> containing 4816 metabolites and 5870 reactions. This hybrid database was obtained by merging the reactions in the Kyoto Encyclopedia of Genes and Genomes (KEGG) LIGAND <abbrgrp>
<abbr bid="B41">41</abbr>
</abbrgrp> with those in the <it>E. coli </it>metabolic model iJR904 <abbrgrp>
<abbr bid="B42">42</abbr>
</abbrgrp>, followed by appropriate pruning to exclude generalized polymerization reactions. Of the 5870 reactions, 2501 are reversible and 3369 are irreversible. Note that more than 5500 reactions in the hybrid database are contained in KEGG database and less than 300 reactions are specific to the <it>E. coli </it>metabolic model iJR904.</p>
<p>In addition to the 5870 metabolic reactions, the hybrid database has transport reactions for 143 external metabolites contained in the <it>E. coli </it>iJR904 model. These 143 external metabolites were assumed to be the set of possible imported and secreted metabolites. Further, the hybrid database includes an objective function <it>Z </it>in the form of a biomass reaction that reflects synthesis of the <it>E. coli </it>biomass components, as defined in the iJR904 model.</p>
<p>Genome-scale metabolic networks typically contain <it>blocked </it>reactions <abbrgrp>
<abbr bid="B28">28</abbr>
<abbr bid="B69">69</abbr>
</abbrgrp> which are dead-ends and necessarily have zero flux for every examined chemical environment under any steady-state condition. Such blocked reactions cannot contribute to any steady-state flux distribution and can be excluded from the hybrid database. For the set of 143 external metabolites, we found 2968 of the 5870 reactions in the hybrid database to be blocked under all environmental conditions we examined. We have excluded this set of 2968 blocked reactions from the hybrid database of 5870 reactions to arrive at a reduced reaction set of 1597 metabolites and 2902 reactions. We thus take this reduced set of <it>N </it>= 2902 reactions as the <it>global reaction set</it>.</p>
<p>The <it>E. coli </it>metabolic model iJR904 has 931 reactions (which of course are contained in the hybrid database of 5870 reactions). Our global reaction set (having 2902 reactions) was derived from the hybrid database by excluding blocked reactions; after this exclusion, the <it>E. coli </it>metabolic model iJR904 is left with 831 reactions. Here, we consider this set of 831 reactions to be the <it>E. coli </it>metabolic genotype.</p>
</sec>
<sec>
<st>
<p>Viable genotypes</p>
</st>
<p>Any subset of <it>n </it>reactions taken from the global reaction set is considered to specify a discretized binary metabolic genotype. For simplicity, we shall refer to this as a metabolic genotype or as a genotype. Specifically, a metabolic genotype <it>G </it>can be represented by a bit string of length <it>N</it>, <it>i.e., G </it>= (<it>b<sub>1</sub>
</it>, <it>b<sub>2</sub>
</it>, ..., <it>b<sub>N</sub>
</it>), where <it>N </it>is the number of reactions in the global reaction set (see Additional File <supplr sid="S1">1</supplr> Figure S1a). Each position in the bit string <it>G </it>corresponds to one reaction in the global reaction set, with the reaction being either present (<it>b<sub>i </sub>
</it>= 1) or absent (<it>b<sub>i </sub>
</it>= 0) in the genotype. We denote the set or space of metabolic genotypes with a given number <it>n </it>of reactions as &#937;(<it>n</it>).</p>
<p>For any genotype, we can use FBA to determine whether the corresponding metabolic network has the ability to synthesize all biomass components in a given chemical environment (medium). We consider a genotype to be <it>viable </it>in a given environment if and only if the maximum biomass flux predicted by FBA for the genotype is nonzero; otherwise we consider the genotype to be non-viable (see Additional File <supplr sid="S1">1</supplr> Figure S1b). In general, <it>in silico </it>metabolic studies take a metabolic network's <it>fitness </it>to be proportional to the maximum biomass growth flux the network can attain in a given environment. The metabolic property considered here is simpler: we ask only whether a network can synthesize all biomass components in a given environment, regardless of the synthesis rate. For all the work we report, we use the <it>E. coli </it>biomass composition to determine the viability of a genotype in a given chemical environment.</p>
</sec>
<sec>
<st>
<p>Chemical environments and phenotypes</p>
</st>
<p>For our purpose, the metabolic phenotype of a metabolic network (genotype) is determined by the network's viability in a list of well-defined chemical environments (media). We shall denote the subset of genotypes within &#937;(<it>n</it>) that have a specific phenotype - growth on a specific list of environments - as <it>V</it>(<it>n</it>). In this work, we use only aerobic minimal environments containing one carbon source. Each environment also contains unlimited amounts of the following inorganic metabolites: ammonia, iron, potassium, protons, pyrophosphate, sodium, sulfate, water and oxygen. Based on FBA applied to the metabolic model iJR904, it was found earlier that <it>E. coli </it>can support nonzero biomass growth on 89 different aerobic minimal environments <abbrgrp>
<abbr bid="B29">29</abbr>
<abbr bid="B57">57</abbr>
</abbrgrp>. The environments we focus on here differ in these 89 carbon sources, which are listed in Additional File <supplr sid="S2">2</supplr> Table S1.</p>
</sec>
<sec>
<st>
<p>Environmental versatility index (<it>V<sub>env</sub>
</it>) and nested choices of chemical environments</p>
</st>
<p>The Markov Chain Monte Carlo (MCMC) sampling algorithm (see also below) can be used to explore the set of genotypes having a given phenotype. In our case, this phenotype is viability on a given set of minimal environments; if this set consists of <it>V<sub>env </sub>
</it>environments, we say that the genotype's environmental versatility index is <it>V<sub>env</sub>
</it>. Thus, the phenotype <it>V<sub>env </sub>
</it>= 1 refers to genotypes viable in one specific environment, the phenotype <it>V<sub>env </sub>
</it>= 2 refers to genotypes viable in two given environments, and so on. We have considered 89 minimal environments whose sole carbon sources, their only distinguishing feature, are listed in Additional File <supplr sid="S2">2</supplr> Table S1.</p>
<p>We have used MCMC to sample ensembles of increasingly versatile metabolic networks, <it>i.e</it>., ensembles whose networks have <it>V<sub>env </sub>
</it>= 1, 2, 5, 10, 20, 30, 40, 50, 70 and 89. The genotypes with <it>V<sub>env </sub>
</it>= 89 are the most versatile among them as they are viable in all 89 minimal environments. There are many ways of choosing 1, 2, or more specific environments out of 89 environments to sample genotypes having a phenotype with <it>V<sub>env </sub>
</it>= 1, 2, through 89. The properties of sampled genotypes in an ensemble with a given <it>V<sub>env </sub>
</it>will depend on the choice of those <it>V<sub>env </sub>
</it>environments. The computations we carry out are computationally very expensive, and they become more expensive with every additional environment in which viability is determined. To limit this expense, we pursued two strategies. First, we used <it>nested </it>sets of environments to sample genotypes in ensembles with different <it>V<sub>env</sub>
</it>, e.g., the set of 70 environments chosen for <it>V<sub>env </sub>
</it>= 70 is a subset of that for <it>V<sub>env </sub>
</it>= 89, and the set of 50 environments chosen for <it>V<sub>env </sub>
</it>= 50 is a subset of that used for <it>V<sub>env </sub>
</it>= 70, and so forth. Second, we used only one subset of 70 environments within <it>V<sub>env </sub>
</it>= 89 to sample an ensemble with <it>V<sub>env </sub>
</it>= 70, and only one subset of 50 environments within the choice for <it>V<sub>env </sub>
</it>= 70 for sampling an ensemble with <it>V<sub>env </sub>
</it>= 50. For <it>V<sub>env </sub>
</it>below that, we did tackle the variability coming from different environmental choices; specifically, for <it>V<sub>env </sub>
</it>= 40, we used 10 different subsets of 40 environments within the choice for <it>V<sub>env </sub>
</it>= 50; thus we generated 10 different genotype ensembles, where each genotype in each ensemble had <it>V<sub>env </sub>
</it>= 40. Each of these 10 different choices of 40 environments was then used to create a single nested sequence for <it>V<sub>env </sub>
</it>= 30, 20, 10, 5, 2, and 1. This allowed us to have 10 different ensembles to sample at each of these <it>V<sub>env </sub>
</it>and to follow for each sequence of nested sets the consequences of modifying <it>V<sub>env</sub>
</it>. (See Additional File <supplr sid="S1">1</supplr> Figure S7 for a diagram representing two such nested sets.) We computed the average properties of the sampled genotypes as well as their dispersion based on the 10 different samples for each value of <it>V<sub>env</sub>
</it>.</p>
</sec>
<sec>
<st>
<p>MCMC sampling of viable genotypes</p>
</st>
<p>It was shown in previous work <abbrgrp>
<abbr bid="B30">30</abbr>
</abbrgrp> for a single environment, corresponding to <it>V<sub>env </sub>
</it>= 1, that the size of the subspace <it>V</it>(<it>n</it>) relative to &#937;(<it>n</it>) is of the order of 10<sup>-22 </sup>for genotypes with <it>n </it>= 2000 reactions. This size decreases even further if one requires viability in multiple environments. Such tiny probabilities of finding a desired phenotype in &#937;(<it>n</it>) make it infeasible to sample genotypes in <it>V</it>(<it>n</it>) by simply drawing random genotypes in &#937;(<it>n</it>) with the correct number <it>n </it>of reactions, followed by determining the phenotype of each genotype. Thus, we relied on the Markov Chain Monte Carlo (MCMC) method described in Ref. <abbrgrp>
<abbr bid="B30">30</abbr>
</abbrgrp> to uniformly sample genotypes in <it>V</it>(<it>n</it>).</p>
<p>This MCMC method starts with a genotype in <it>V</it>(<it>n</it>) and produces a sequence of genotypes, wherein the (k+1)<sup>th </sup>genotype in the sequence is generated from the k<sup>th </sup>genotype using a probabilistic transition rule. At each transition step, one proposes a small modification to the current genotype in the sequence; if the modified genotype has the correct phenotype, one accepts the modified genotype as the next genotype of the sequence; otherwise the next genotype becomes identical to the current genotype. The modification introduced at each transition step is a reaction swap. It consists of removal of one reaction from the current genotype, followed by addition of new reaction from the global reaction set to generate a modified genotype. Note that the reaction swap preserves the number <it>n </it>of reactions in the genotype (see Additional File <supplr sid="S1">1</supplr> Figure S1a). Thus, the MCMC approach produces a walk in the subspace <it>V</it>(<it>n</it>), as illustrated in Additional File <supplr sid="S1">1</supplr> Figure S1c. Note that in the limit of long walks, this approach samples uniformly the space of genotypes that are accessible from the first genotype of the MCMC procedure and that have a given phenotype.</p>
<p>In our simulations, starting from an initial genotype in <it>V</it>(<it>n</it>), we have first carried out 10<sup>5 </sup>attempted swaps to erase the memory of the starting genotype. After this initial phase, we continued the MCMC procedure to sample genotypes in <it>V</it>(<it>n</it>). During this later phase, it is not useful to keep all of the genotypes produced, as many of them may be highly similar to one another. We thus saved only every 1000<sup>th </sup>genotype generated in a sequence of 10<sup>6 </sup>steps. This procedure produces a random ensemble of 1000 genotypes in <it>V</it>(<it>n</it>) <abbrgrp>
<abbr bid="B30">30</abbr>
</abbrgrp>. We sampled genotypes in <it>V</it>(<it>n</it>) for three different values of the number of reactions <it>n </it>= 500, 700 and 831.</p>
<p>To start the MCMC sampling, a first genotype having the correct phenotype is required. To this end, we first determined those reactions in the <it>E. coli </it>metabolic network that have nonzero flux in an optimal flux distribution with maximum biomass flux for each of the 89 minimal environments considered here. (Recall that <it>E. coli </it>is viable on all of our 89 environments). The number of nonzero fluxes is ~300 in a typical optimal flux distribution for each of the 89 environments. We generated a genotype with <it>n </it>reactions and phenotype <it>V<sub>env </sub>
</it>= 1 (<it>i.e</it>., growth on one specified environment) by starting with the set of nonzero flux reactions for <it>E. coli </it>in that environment, and then adding randomly other reactions until we reached a metabolic genotype with exactly <it>n </it>reactions. We generated a genotype with <it>n </it>reactions and <it>V<sub>env </sub>
</it>= 2 (<it>i.e</it>., growth in two specific environments) by starting with the union of the two sets of reactions that had nonzero flux when the <it>E. coli </it>metabolic network synthesized biomass in the two different environments; then we added randomly other reactions until we reached a metabolic genotype with exactly <it>n </it>reactions. We generated starting genotypes with <it>V<sub>env </sub>
</it>= 5, 10, 20, 30, 40, 50, 70 and 89 analogously.</p>
</sec>
<sec>
<st>
<p>Fully coupled sets (FCSs) and measures of modularity</p>
</st>
<p>A reaction pair <it>v<sub>1 </sub>
</it>and <it>v<sub>2 </sub>
</it>are said to be <it>fully coupled </it>to each other if a nonzero flux for <it>v<sub>1 </sub>
</it>implies a proportionate (nonzero) flux for <it>v<sub>2 </sub>
</it>in any steady state and vice versa <abbrgrp>
<abbr bid="B28">28</abbr>
</abbrgrp>. A <it>fully coupled set </it>(FCS) in a metabolic network is a maximal set of reactions that are mutually fully coupled to each other (thus, there are no FCSs of size 1). A simple argument shows that FCSs of a network are non-overlapping entities. Indeed, if a reaction were to belong to two FCSs, then all reactions in those two sets would be fully coupled pairwise, resulting in one larger FCS.</p>
<p>We denote the number of FCSs in a metabolic network genotype by <it>s</it>. This is one index of modularity. We also define the modularity index <it>M </it>for a genotype as the number of reactions contained in the FCSs of that genotype (<it>M </it>can vary from zero to the total number of reactions in the network). Burgard <it>et al </it>
<abbrgrp>
<abbr bid="B28">28</abbr>
</abbrgrp> have proposed a linear programming (LP) based method to determine whether two fluxes in a metabolic network are fully coupled. The LP formulation of the coupling problem can be written as:</p>
<p>
<display-formula id="M3">
<m:math name="1752-0509-5-135-i3" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:mrow>
   <m:mstyle class="text">
      <m:mtext class="textsf" mathvariant="sans-serif">Solve&#160;</m:mtext>
   </m:mstyle>
   <m:msub>
      <m:mrow>
         <m:mi>R</m:mi>
      </m:mrow>
      <m:mrow>
         <m:mstyle class="text">
            <m:mtext class="textsf" mathvariant="sans-serif">max</m:mtext>
         </m:mstyle>
      </m:mrow>
   </m:msub>
   <m:mo class="MathClass-rel">=</m:mo>
   <m:mstyle class="text">
      <m:mtext class="textsf" mathvariant="sans-serif">max</m:mtext>
   </m:mstyle>
   <m:mfenced separators="" open="{" close="}">
      <m:mrow>
         <m:msub>
            <m:mrow>
               <m:mi>v</m:mi>
            </m:mrow>
            <m:mrow>
               <m:mstyle class="text">
                  <m:mtext class="textsf" mathvariant="sans-serif">1</m:mtext>
               </m:mstyle>
            </m:mrow>
         </m:msub>
         <m:mo class="MathClass-rel">|</m:mo>
         <m:msub>
            <m:mrow>
               <m:mi>v</m:mi>
            </m:mrow>
            <m:mrow>
               <m:mstyle class="text">
                  <m:mtext class="textsf" mathvariant="sans-serif">2</m:mtext>
               </m:mstyle>
            </m:mrow>
         </m:msub>
         <m:mo class="MathClass-rel">=</m:mo>
         <m:mstyle class="text">
            <m:mtext class="textsf" mathvariant="sans-serif">1,</m:mtext>
         </m:mstyle>
         <m:mstyle mathvariant="bold">
            <m:mi>S</m:mi>
         </m:mstyle>
         <m:mstyle class="text">
            <m:mtext class="textsf" mathvariant="sans-serif">.</m:mtext>
         </m:mstyle>
         <m:mstyle mathvariant="bold">
            <m:mi>v</m:mi>
         </m:mstyle>
         <m:mo class="MathClass-rel">=</m:mo>
         <m:mstyle class="text">
            <m:mtext class="textsf" mathvariant="sans-serif">0,</m:mtext>
         </m:mstyle>
         <m:mspace width="2.77695pt" class="tmspace"/>
         <m:mstyle mathvariant="bold">
            <m:mi>a</m:mi>
         </m:mstyle>
         <m:mo class="MathClass-rel">&#8804;</m:mo>
         <m:mstyle mathvariant="bold">
            <m:mi>v</m:mi>
         </m:mstyle>
         <m:mo class="MathClass-rel">&#8804;</m:mo>
         <m:mstyle mathvariant="bold">
            <m:mi>b</m:mi>
         </m:mstyle>
      </m:mrow>
   </m:mfenced>
</m:mrow>
</m:math>
</display-formula>
</p>
<p>
<display-formula id="M4">
<m:math name="1752-0509-5-135-i4" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:mrow>
   <m:mstyle class="text">
      <m:mtext class="textsf" mathvariant="sans-serif">Solve&#160;</m:mtext>
   </m:mstyle>
   <m:msub>
      <m:mrow>
         <m:mi>R</m:mi>
      </m:mrow>
      <m:mrow>
         <m:mstyle class="text">
            <m:mtext class="textsf" mathvariant="sans-serif">min</m:mtext>
         </m:mstyle>
      </m:mrow>
   </m:msub>
   <m:mo class="MathClass-rel">=</m:mo>
   <m:mstyle class="text">
      <m:mtext class="textsf" mathvariant="sans-serif">min</m:mtext>
   </m:mstyle>
   <m:mfenced separators="" open="{" close="}">
      <m:mrow>
         <m:msub>
            <m:mrow>
               <m:mi>v</m:mi>
            </m:mrow>
            <m:mrow>
               <m:mstyle class="text">
                  <m:mtext class="textsf" mathvariant="sans-serif">1</m:mtext>
               </m:mstyle>
            </m:mrow>
         </m:msub>
         <m:mo class="MathClass-rel">|</m:mo>
         <m:msub>
            <m:mrow>
               <m:mi>v</m:mi>
            </m:mrow>
            <m:mrow>
               <m:mstyle class="text">
                  <m:mtext class="textsf" mathvariant="sans-serif">2</m:mtext>
               </m:mstyle>
            </m:mrow>
         </m:msub>
         <m:mo class="MathClass-rel">=</m:mo>
         <m:mstyle class="text">
            <m:mtext class="textsf" mathvariant="sans-serif">1,</m:mtext>
         </m:mstyle>
         <m:mstyle mathvariant="bold">
            <m:mi>S</m:mi>
         </m:mstyle>
         <m:mstyle class="text">
            <m:mtext class="textsf" mathvariant="sans-serif">.</m:mtext>
         </m:mstyle>
         <m:mstyle mathvariant="bold">
            <m:mi>v</m:mi>
         </m:mstyle>
         <m:mo class="MathClass-rel">=</m:mo>
         <m:mstyle class="text">
            <m:mtext class="textsf" mathvariant="sans-serif">0,</m:mtext>
         </m:mstyle>
         <m:mspace width="2.77695pt" class="tmspace"/>
         <m:mstyle mathvariant="bold">
            <m:mi>a</m:mi>
         </m:mstyle>
         <m:mo class="MathClass-rel">&#8804;</m:mo>
         <m:mstyle mathvariant="bold">
            <m:mi>v</m:mi>
         </m:mstyle>
         <m:mo class="MathClass-rel">&#8804;</m:mo>
         <m:mstyle mathvariant="bold">
            <m:mi>b</m:mi>
         </m:mstyle>
      </m:mrow>
   </m:mfenced>
</m:mrow>
</m:math>
</display-formula>
</p>
<p>If <it>R</it>
<sub>max </sub>= <it>R</it>
<sub>min </sub>then <it>v</it>
<sub>1 </sub>and <it>v</it>
<sub>2 </sub>are fully coupled. In the above equations, <b>S </b>is the stoichiometric matrix, and vectors <b>a </b>and <b>b </b>contain the lower and upper limits of different metabolic fluxes in <b>v</b>.</p>
<p>We have used the algorithm of Burgard <it>et al</it>. to determine all FCSs in our metabolic network genotypes. We have computed the coupled reaction pairs under conditions where all external metabolites were allowed to be imported or secreted. Further, coupled reaction pairs were computed without assuming a constant biomass composition to avoid coupling a large set of fluxes to the biomass reaction. Hence, all biomass components were allowed to be synthesized independently of one another, without constraining their stoichiometry in the biomass.</p>
</sec>
<sec>
<st>
<p>Scope algorithm and distance of reactions from nutrient metabolites</p>
</st>
<p>Ebenh&#246;h and colleagues <abbrgrp>
<abbr bid="B60">60</abbr>
<abbr bid="B61">61</abbr>
</abbrgrp> have introduced the concept of <it>scope </it>based on a network expansion algorithm for the structural analysis of genome-scale metabolic networks. Their approach calculates for a given metabolic network/reaction database and predefined external metabolites (referred to as seed metabolites) the set of metabolites - the scope - which the reaction network is in principle able to produce. In other words, the scope describes the synthesizing capacity of a given set of seed metabolites given a list of metabolic reactions.</p>
<p>The Scope algorithm iteratively updates a set <it>A </it>of metabolites that a reaction system can synthesize. In the algorithm this set <it>A </it>is initialized to the set of nutrient metabolites. At each iteration <it>i </it>of the algorithm, one takes the current set <it>A(i) </it>of producible metabolites and expands it to set <it>A(i+1) </it>as follows. First one initializes, <it>A(i+1) </it>to contain all metabolites in <it>A(i)</it>. Then one considers successively each reaction in the database and adds that reaction's products to <it>A(i+1) </it>if and only if all of its substrates are in <it>A(i)</it>. This procedure ends when <it>A(i) </it>= <it>A(i+1)</it>, that is when in a given iteration no new molecules can be synthesized. We have used the Scope algorithm to define a distance of a reaction in the global reaction set from nutrient metabolites. Specifically, the distance of a reaction from the nutrient metabolites in the seed set is defined as the iteration number <it>i </it>of the Scope algorithm when that particular reaction contributes its products to <it>A(i+1)</it>.</p>
<p>A limitation of the Scope algorithm in comparison to constraint-based frameworks like FBA is its inability to deal properly with the self-generating (autocatalytic) nature of certain cofactor metabolites (e.g., ATP, NADH) in the network <abbrgrp>
<abbr bid="B70">70</abbr>
<abbr bid="B71">71</abbr>
</abbrgrp>. The scope of the nutrient metabolites in the seed set is sensitive to the presence or absence of such co-factors in the seed set. Following Kun et al <abbrgrp>
<abbr bid="B71">71</abbr>
</abbrgrp>, we included in the seed set the autocatalytic metabolites listed in Additional File <supplr sid="S2">2</supplr> Table S2 (in addition to the nutrient metabolites in our minimal environment) when computing the distance of reactions with the Scope algorithm.</p>
<p>We have determined the distance from nutrient metabolites for each reaction in the global reaction set for 89 different seed sets corresponding to the 89 aerobic minimal environments. For each reaction, we have designated the minimum of the 89 distances obtained for the 89 different environments as the <it>scope distance </it>of that reaction from the nutrient metabolites.</p>
</sec>
<sec>
<st>
<p>Statistical tests for the increase in modularity <it>M </it>with <it>V<sub>env</sub>
</it>
</p>
</st>
<p>Since the modularity index <it>M </it>and the number <it>s </it>of FCSs is larger for sampled genotypes with <it>V<sub>env </sub>
</it>= 89 than with <it>V<sub>env </sub>
</it>= 1 (cf. Figure <figr fid="F2">2a</figr>), it is appropriate to identify reactions contributing to additional FCSs in genotypes having <it>V<sub>env </sub>
</it>= 89. To this end, we combined the lists of FCSs for each of the 1000 sampled genotypes at <it>V<sub>env </sub>
</it>= 89 (and <it>n </it>= 831 reactions) to create a merged list of FCSs that occur in at least one such sampled genotype. Since the FCSs are non-overlapping entities, multiple copies of a FCS in the merged list signify the FCS's presence in multiple sampled genotypes. We then determined the set of reactions that occurred in at least 500 FCSs in the merged list of FCSs for <it>V<sub>env </sub>
</it>= 89. We refer to it as the <it>consensus set </it>R<sub>89 </sub>of FCS reactions for <it>V<sub>env </sub>
</it>= 89 and <it>n </it>= 831. In a similar way, we obtained the consensus set R<sub>1 </sub>of FCS reactions for our sampled genotypes with <it>V<sub>env </sub>
</it>= 1.</p>
<p>The consensus set R<sub>89 </sub>for <it>V<sub>env </sub>
</it>= 89 is larger than the set R<sub>1 </sub>for <it>V<sub>env </sub>
</it>= 1, and the complement set R<sub>89</sub>\R<sub>1 </sub>consisting of the reactions belonging to R<sub>89 </sub>but not R<sub>1 </sub>gives the set of reactions that mostly account for the additional FCSs in <it>V<sub>env </sub>
</it>= 89. We then considered the scope distances of reactions from nutrient metabolites for two choices of reaction sets. The first set is this complement set R<sub>89</sub>\R<sub>1</sub>, the second is the set of all reactions in the global reaction set. (In Figure <figr fid="F4">4</figr> we show the corresponding distributions.) The scope distances for the reactions in R<sub>89</sub>\R<sub>1 </sub>are clearly concentrated at much smaller values than when considering <it>all </it>possible reactions. A Kolmogorov-Smirnov (K-S) test allowed us to reject the null hypothesis that the two distributions are the same (P &lt; 10<sup>-5</sup>). Further, a two sample Welch t-test allowed us to reject the hypothesis that the means of the two distributions are the same (P &lt; 8.10<sup>-8</sup>).</p>
</sec>
<sec>
<st>
<p>Use of pathway classification of reactions to characterize biochemical relevance of FCSs</p>
</st>
<p>We have classified reactions in our global reaction set into different biochemical pathways using the pathway information <abbrgrp>
<abbr bid="B72">72</abbr>
</abbrgrp> for reactions in the KEGG database <abbrgrp>
<abbr bid="B41">41</abbr>
</abbrgrp>, along with subsystem information <abbrgrp>
<abbr bid="B73">73</abbr>
</abbrgrp> for the remaining reactions in the <it>E. coli </it>metabolic model iJR904 <abbrgrp>
<abbr bid="B42">42</abbr>
</abbrgrp>. We have used this pathway classification as follows to test whether the majority of reactions in a given FCS belong to a common biochemical pathway.</p>
<p>For a given FCS, we define the quantity <it>Q </it>which is the fraction of reactions sharing the dominant annotation for that FCS. We computed <it>Q </it>for each FCS in the merged list of FCSs from our 1000 sampled genotypes with phenotype <it>V<sub>env </sub>
</it>= 89 and <it>n </it>= 831 (see the previous section for merged lists of FCSs). We then considered the cumulative distribution of <it>Q </it>for FCSs in the merged list, namely, the probability that <it>Q </it>is at least as large as a given value X. The cumulative distribution of <it>Q </it>for FCSs in the merged list with <it>V<sub>env </sub>
</it>= 89 and <it>n </it>= 831 is shown in Additional File <supplr sid="S1">1</supplr> Figure S2. We also computed the fraction <it>h </it>of FCSs in the merged list with <it>Q </it>&#8805; <it>h</it>, a quantity that is analogous to the <it>h</it>-index commonly used to measure scientific productivity <abbrgrp>
<abbr bid="B74">74</abbr>
</abbrgrp>. This <it>h</it>-index has a value of <it>h </it>= 0.79, as can be seen from the point of intersection of the cumulative distribution of <it>Q </it>with the bisecting line in Additional File <supplr sid="S1">1</supplr> Figure S2.</p>
<p>To test the significance of the <it>h</it>-index obtained from the merged list of FCSs for sampled genotypes with <it>V<sub>env </sub>
</it>= 89 and <it>n </it>= 831, we performed the following randomization test. Starting from the merged list of FCSs and the pathway annotations of their reactions, we generated 1000 equivalent random lists by swapping the annotations among reactions in different FCSs, while preserving the frequency of each annotation in the merged list. We swapped annotations as follows. We first recorded the multiplicity of each distinct FCS within the merged list. We then randomly picked two FCSs in the merged list with the same multiplicity, and one random reaction in each of the two FCSs, and then swapped the annotations of these two reactions in the FCSs. We performed at least 10<sup>7 </sup>swaps starting from the merged list before saving a <it>random list</it>, that is, a list of FCSs whose reaction annotations had been randomized in this way. None of the 1000 random lists we generated had an <it>h</it>-index greater than 0.79 obtained for the merged list with <it>V<sub>env </sub>
</it>= 89. On this basis, we can reject the hypothesis that reaction annotations are not similar within FCSs at a p-value of less than 0.001.</p>
</sec>
</sec>
<sec>
<st>
<p>Authors' contributions</p>
</st>
<p>The project was defined by all three authors. OCM and AS conceived the algorithmic procedures. AS wrote the code and performed the numerical simulations. All authors contributed in designing research, analyzing the data, and writing the paper. All authors have read and approved the manuscript.</p>
</sec>
</bdy><bm>
<ack>
<sec>
<st>
<p>Acknowledgements</p>
</st>
<p>We thank Dominique de Vienne, Christine Dillmann and Vincent Fromion for comments, and Pierre-Yves Bourguignon for discussions. AS acknowledges support from CNRS GDRE513. AW acknowledges support through Swiss National Science Foundation grants 315200-116814, 315200-119697, and 315230-129708, as well as through the YeastX project of SystemsX.ch, and the University Priority Research Program in Systems Biology at the University of Zurich. OCM acknowledges support from the Agence Nationale de la Recherche, Metacoli grant ANR-08-SYSC-011. The LPTMS is an Unit&#233; de Recherche de l'Universit&#233; Paris-Sud associ&#233;e au CNRS.</p>
</sec>
</ack>
<refgrp><bibl id="B1"><title><p>Modularity in development and why it matters to evo-devo</p></title><aug><au><snm>Bolker</snm><fnm>JA</fnm></au></aug><source>American Zoologist</source><pubdate>2000</pubdate><volume>40</volume><fpage>770</fpage><lpage>776</lpage><xrefbib><pubid idtype="doi">10.1668/0003-1569(2000)040[0770:MIDAWI]2.0.CO;2</pubid></xrefbib></bibl><bibl id="B2"><aug><au><snm>Schlosser</snm><fnm>G</fnm></au><au><snm>Wagner</snm><fnm>GP</fnm></au></aug><source>Modularity in development and evolution</source><publisher>Chicago, Ill; London: University of Chicago Press</publisher><pubdate>2004</pubdate></bibl><bibl id="B3"><title><p>Modular organization of cellular networks</p></title><aug><au><snm>Rives</snm><fnm>AW</fnm></au><au><snm>Galitski</snm><fnm>T</fnm></au></aug><source>Proc Natl Acad Sci USA</source><pubdate>2003</pubdate><volume>100</volume><fpage>1128</fpage><lpage>1133</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1073/pnas.0237338100</pubid><pubid idtype="pmcid">298738</pubid><pubid idtype="pmpid" link="fulltext">12538875</pubid></pubidlist></xrefbib></bibl><bibl id="B4"><title><p>Identification and analysis of evolutionarily cohesive functional modules in protein networks</p></title><aug><au><snm>Campillos</snm><fnm>M</fnm></au><au><snm>von Mering</snm><fnm>C</fnm></au><au><snm>Jensen</snm><fnm>LJ</fnm></au><au><snm>Bork</snm><fnm>P</fnm></au></aug><source>Genome Res</source><pubdate>2006</pubdate><volume>16</volume><fpage>374</fpage><lpage>382</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1101/gr.4336406</pubid><pubid idtype="pmcid">1415216</pubid><pubid idtype="pmpid" link="fulltext">16449501</pubid></pubidlist></xrefbib></bibl><bibl id="B5"><title><p>Revealing modular organization in the yeast transcriptional network</p></title><aug><au><snm>Ihmels</snm><fnm>J</fnm></au><au><snm>Friedlander</snm><fnm>G</fnm></au><au><snm>Bergmann</snm><fnm>S</fnm></au><au><snm>Sarig</snm><fnm>O</fnm></au><au><snm>Ziv</snm><fnm>Y</fnm></au><au><snm>Barkai</snm><fnm>N</fnm></au></aug><source>Nat Genet</source><pubdate>2002</pubdate><volume>31</volume><fpage>370</fpage><lpage>377</lpage><xrefbib><pubid idtype="pmpid" link="fulltext">12134151</pubid></xrefbib></bibl><bibl id="B6"><title><p>Hierarchical organization of modularity in metabolic networks</p></title><aug><au><snm>Ravasz</snm><fnm>E</fnm></au><au><snm>Somera</snm><fnm>AL</fnm></au><au><snm>Mongru</snm><fnm>DA</fnm></au><au><snm>Oltvai</snm><fnm>ZN</fnm></au><au><snm>Barabasi</snm><fnm>AL</fnm></au></aug><source>Science</source><pubdate>2002</pubdate><volume>297</volume><fpage>1551</fpage><lpage>1555</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1126/science.1073374</pubid><pubid idtype="pmpid" link="fulltext">12202830</pubid></pubidlist></xrefbib></bibl><bibl id="B7"><title><p>Quantifying modularity in the evolution of biomolecular systems</p></title><aug><au><snm>Snel</snm><fnm>B</fnm></au><au><snm>Huynen</snm><fnm>MA</fnm></au></aug><source>Genome Res</source><pubdate>2004</pubdate><volume>14</volume><fpage>391</fpage><lpage>397</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1101/gr.1969504</pubid><pubid idtype="pmcid">353226</pubid><pubid idtype="pmpid" link="fulltext">14993205</pubid></pubidlist></xrefbib></bibl><bibl id="B8"><title><p>Functional cartography of complex metabolic networks</p></title><aug><au><snm>Guimera</snm><fnm>R</fnm></au><au><snm>Nunes Amaral</snm><fnm>LA</fnm></au></aug><source>Nature</source><pubdate>2005</pubdate><volume>433</volume><fpage>895</fpage><lpage>900</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1038/nature03288</pubid><pubid idtype="pmcid">2175124</pubid><pubid idtype="pmpid" link="fulltext">15729348</pubid></pubidlist></xrefbib></bibl><bibl id="B9"><title><p>Environmental variability and modularity of bacterial metabolic networks</p></title><aug><au><snm>Parter</snm><fnm>M</fnm></au><au><snm>Kashtan</snm><fnm>N</fnm></au><au><snm>Alon</snm><fnm>U</fnm></au></aug><source>BMC Evol Biol</source><pubdate>2007</pubdate><volume>7</volume><fpage>169</fpage><xrefbib><pubidlist><pubid idtype="doi">10.1186/1471-2148-7-169</pubid><pubid idtype="pmcid">2151768</pubid><pubid idtype="pmpid" link="fulltext">17888177</pubid></pubidlist></xrefbib></bibl><bibl id="B10"><title><p>The evolution of modularity in bacterial metabolic networks</p></title><aug><au><snm>Kreimer</snm><fnm>A</fnm></au><au><snm>Borenstein</snm><fnm>E</fnm></au><au><snm>Gophna</snm><fnm>U</fnm></au><au><snm>Ruppin</snm><fnm>E</fnm></au></aug><source>Proc Natl Acad Sci USA</source><pubdate>2008</pubdate><volume>105</volume><fpage>6976</fpage><lpage>6981</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1073/pnas.0712149105</pubid><pubid idtype="pmcid">2383979</pubid><pubid idtype="pmpid" link="fulltext">18460604</pubid></pubidlist></xrefbib></bibl><bibl id="B11"><title><p>The road to modularity</p></title><aug><au><snm>Wagner</snm><fnm>GP</fnm></au><au><snm>Pavlicev</snm><fnm>M</fnm></au><au><snm>Cheverud</snm><fnm>JM</fnm></au></aug><source>Nat Rev Genet</source><pubdate>2007</pubdate><volume>8</volume><fpage>921</fpage><lpage>931</lpage><xrefbib><pubid idtype="pmpid" link="fulltext">18007649</pubid></xrefbib></bibl><bibl id="B12"><title><p>Evolution and tinkering</p></title><aug><au><snm>Jacob</snm><fnm>F</fnm></au></aug><source>Science</source><pubdate>1977</pubdate><volume>196</volume><fpage>1161</fpage><lpage>1166</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1126/science.860134</pubid><pubid idtype="pmpid" link="fulltext">860134</pubid></pubidlist></xrefbib></bibl><bibl id="B13"><title><p>From molecular to modular cell biology</p></title><aug><au><snm>Hartwell</snm><fnm>LH</fnm></au><au><snm>Hopfield</snm><fnm>JJ</fnm></au><au><snm>Leibler</snm><fnm>S</fnm></au><au><snm>Murray</snm><fnm>AW</fnm></au></aug><source>Nature</source><pubdate>1999</pubdate><volume>402</volume><fpage>C47</fpage><lpage>52</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1038/35011540</pubid><pubid idtype="pmpid" link="fulltext">10591225</pubid></pubidlist></xrefbib></bibl><bibl id="B14"><title><p>Biological networks: the tinkerer as an engineer</p></title><aug><au><snm>Alon</snm><fnm>U</fnm></au></aug><source>Science</source><pubdate>2003</pubdate><volume>301</volume><fpage>1866</fpage><lpage>1867</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1126/science.1089072</pubid><pubid idtype="pmpid" link="fulltext">14512615</pubid></pubidlist></xrefbib></bibl><bibl id="B15"><aug><au><snm>Rechenberg</snm><fnm>I</fnm></au></aug><source>Evolutionsstrategie Stuttgart</source><publisher>Germany: Friedrich Frommann Verlag</publisher><pubdate>1973</pubdate></bibl><bibl id="B16"><aug><au><snm>Riedel</snm><fnm>R</fnm></au></aug><source>Die Ordnung des Lebendigen Systembedingungen d Evolution</source><publisher>Hamburg und Berlin: Verlag Paul Parey</publisher><pubdate>1975</pubdate></bibl><bibl id="B17"><title><p>Homologues, natural kinds and the evolution of modularity</p></title><aug><au><snm>Wagner</snm><fnm>GP</fnm></au></aug><source>American Zoologist</source><pubdate>1996</pubdate><volume>36</volume><fpage>36</fpage><lpage>43</lpage></bibl><bibl id="B18"><title><p>Wings, horns, and butterfly eyespots: how do complex traits evolve?</p></title><aug><au><snm>Monteiro</snm><fnm>A</fnm></au><au><snm>Podlaha</snm><fnm>O</fnm></au></aug><source>PLoS Biol</source><pubdate>2009</pubdate><volume>7</volume><fpage>e37</fpage><xrefbib><pubidlist><pubid idtype="doi">10.1371/journal.pbio.1000037</pubid><pubid idtype="pmcid">2652386</pubid><pubid idtype="pmpid" link="fulltext">19243218</pubid></pubidlist></xrefbib></bibl><bibl id="B19"><title><p>Spontaneous evolution of modularity and network motifs</p></title><aug><au><snm>Kashtan</snm><fnm>N</fnm></au><au><snm>Alon</snm><fnm>U</fnm></au></aug><source>Proc Natl Acad Sci USA</source><pubdate>2005</pubdate><volume>102</volume><fpage>13773</fpage><lpage>13778</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1073/pnas.0503610102</pubid><pubid idtype="pmcid">1236541</pubid><pubid idtype="pmpid" link="fulltext">16174729</pubid></pubidlist></xrefbib></bibl><bibl id="B20"><title><p>Varying environments can speed up evolution</p></title><aug><au><snm>Kashtan</snm><fnm>N</fnm></au><au><snm>Noor</snm><fnm>E</fnm></au><au><snm>Alon</snm><fnm>U</fnm></au></aug><source>Proc Natl Acad Sci USA</source><pubdate>2007</pubdate><volume>104</volume><fpage>13711</fpage><lpage>13716</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1073/pnas.0611630104</pubid><pubid idtype="pmcid">1948871</pubid><pubid idtype="pmpid" link="fulltext">17698964</pubid></pubidlist></xrefbib></bibl><bibl id="B21"><title><p>Specialization can drive the evolution of modularity</p></title><aug><au><snm>Espinosa-Soto</snm><fnm>C</fnm></au><au><snm>Wagner</snm><fnm>A</fnm></au></aug><source>PLoS Comput Biol</source><pubdate>2010</pubdate><volume>6</volume><fpage>e1000719</fpage><xrefbib><pubidlist><pubid idtype="doi">10.1371/journal.pcbi.1000719</pubid><pubid idtype="pmcid">2847948</pubid><pubid idtype="pmpid" link="fulltext">20360969</pubid></pubidlist></xrefbib></bibl><bibl id="B22"><title><p>Evolution of complex modular biological networks</p></title><aug><au><snm>Hintze</snm><fnm>A</fnm></au><au><snm>Adami</snm><fnm>C</fnm></au></aug><source>PLoS Comput Biol</source><pubdate>2008</pubdate><volume>4</volume><fpage>e23</fpage><xrefbib><pubidlist><pubid idtype="doi">10.1371/journal.pcbi.0040023</pubid><pubid idtype="pmcid">2233666</pubid><pubid idtype="pmpid" link="fulltext">18266463</pubid></pubidlist></xrefbib></bibl><bibl id="B23"><title><p>Properties of metabolic networks: structure versus function</p></title><aug><au><snm>Mahadevan</snm><fnm>R</fnm></au><au><snm>Palsson</snm><fnm>BO</fnm></au></aug><source>Biophys J</source><pubdate>2005</pubdate><volume>88</volume><fpage>L07</fpage><lpage>09</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1529/biophysj.104.055723</pubid><pubid idtype="pmcid">1305059</pubid><pubid idtype="pmpid" link="fulltext">15574705</pubid></pubidlist></xrefbib></bibl><bibl id="B24"><title><p>Metabolic networks in motion: 13C-based flux analysis</p></title><aug><au><snm>Sauer</snm><fnm>U</fnm></au></aug><source>Mol Syst Biol</source><pubdate>2006</pubdate><volume>2</volume><fpage>62</fpage><xrefbib><pubidlist><pubid idtype="pmcid">1682028</pubid><pubid idtype="pmpid" link="fulltext">17102807</pubid></pubidlist></xrefbib></bibl><bibl id="B25"><title><p>METATOOL: for studying metabolic networks</p></title><aug><au><snm>Pfeiffer</snm><fnm>T</fnm></au><au><snm>Sanchez-Valdenebro</snm><fnm>I</fnm></au><au><snm>Nuno</snm><fnm>JC</fnm></au><au><snm>Montero</snm><fnm>F</fnm></au><au><snm>Schuster</snm><fnm>S</fnm></au></aug><source>Bioinformatics</source><pubdate>1999</pubdate><volume>15</volume><fpage>251</fpage><lpage>257</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1093/bioinformatics/15.3.251</pubid><pubid idtype="pmpid" link="fulltext">10222413</pubid></pubidlist></xrefbib></bibl><bibl id="B26"><title><p>Metabolic network structure determines key aspects of functionality and regulation</p></title><aug><au><snm>Stelling</snm><fnm>J</fnm></au><au><snm>Klamt</snm><fnm>S</fnm></au><au><snm>Bettenbrock</snm><fnm>K</fnm></au><au><snm>Schuster</snm><fnm>S</fnm></au><au><snm>Gilles</snm><fnm>ED</fnm></au></aug><source>Nature</source><pubdate>2002</pubdate><volume>420</volume><fpage>190</fpage><lpage>193</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1038/nature01166</pubid><pubid idtype="pmpid" link="fulltext">12432396</pubid></pubidlist></xrefbib></bibl><bibl id="B27"><title><p>Extreme pathway lengths and reaction participation in genome-scale metabolic networks</p></title><aug><au><snm>Papin</snm><fnm>JA</fnm></au><au><snm>Price</snm><fnm>ND</fnm></au><au><snm>Palsson</snm><fnm>BO</fnm></au></aug><source>Genome Res</source><pubdate>2002</pubdate><volume>12</volume><fpage>1889</fpage><lpage>1900</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1101/gr.327702</pubid><pubid idtype="pmcid">187577</pubid><pubid idtype="pmpid" link="fulltext">12466293</pubid></pubidlist></xrefbib></bibl><bibl id="B28"><title><p>Flux coupling analysis of genome-scale metabolic network reconstructions</p></title><aug><au><snm>Burgard</snm><fnm>AP</fnm></au><au><snm>Nikolaev</snm><fnm>EV</fnm></au><au><snm>Schilling</snm><fnm>CH</fnm></au><au><snm>Maranas</snm><fnm>CD</fnm></au></aug><source>Genome Res</source><pubdate>2004</pubdate><volume>14</volume><fpage>301</fpage><lpage>312</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1101/gr.1926504</pubid><pubid idtype="pmcid">327106</pubid><pubid idtype="pmpid" link="fulltext">14718379</pubid></pubidlist></xrefbib></bibl><bibl id="B29"><title><p>Genome-scale in silico models of E. coli have multiple equivalent phenotypic states: assessment of correlated reaction subsets that comprise network states</p></title><aug><au><snm>Reed</snm><fnm>JL</fnm></au><au><snm>Palsson</snm><fnm>BO</fnm></au></aug><source>Genome Res</source><pubdate>2004</pubdate><volume>14</volume><fpage>1797</fpage><lpage>1805</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1101/gr.2546004</pubid><pubid idtype="pmcid">515326</pubid><pubid idtype="pmpid" link="fulltext">15342562</pubid></pubidlist></xrefbib></bibl><bibl id="B30"><title><p>Genotype networks in metabolic reaction spaces</p></title><aug><au><snm>Samal</snm><fnm>A</fnm></au><au><snm>Rodrigues</snm><fnm>JFM</fnm></au><au><snm>Jost</snm><fnm>J</fnm></au><au><snm>Martin</snm><fnm>OC</fnm></au><au><snm>Wagner</snm><fnm>A</fnm></au></aug><source>BMC Syst Biol</source><pubdate>2010</pubdate><volume>4</volume><fpage>30</fpage><xrefbib><pubidlist><pubid idtype="doi">10.1186/1752-0509-4-30</pubid><pubid idtype="pmcid">2858107</pubid><pubid idtype="pmpid" link="fulltext">20302636</pubid></pubidlist></xrefbib></bibl><bibl id="B31"><title><p>The Escherichia coli MG1655 in silico metabolic genotype: Its definition, characteristics, and capabilities</p></title><aug><au><snm>Edwards</snm><fnm>JS</fnm></au><au><snm>Palsson</snm><fnm>BO</fnm></au></aug><source>Proc Natl Acad Sci USA</source><pubdate>2000</pubdate><volume>97</volume><fpage>5528</fpage><lpage>5533</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1073/pnas.97.10.5528</pubid><pubid idtype="pmcid">25862</pubid><pubid idtype="pmpid" link="fulltext">10805808</pubid></pubidlist></xrefbib></bibl><bibl id="B32"><title><p>Genome-scale models of microbial cells: evaluating the consequences of constraints</p></title><aug><au><snm>Price</snm><fnm>ND</fnm></au><au><snm>Reed</snm><fnm>JL</fnm></au><au><snm>Palsson</snm><fnm>BO</fnm></au></aug><source>Nature Reviews Microbiology</source><pubdate>2004</pubdate><volume>2</volume><fpage>886</fpage><lpage>897</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1038/nrmicro1023</pubid><pubid idtype="pmpid" link="fulltext">15494745</pubid></pubidlist></xrefbib></bibl><bibl id="B33"><title><p>Towards multidimensional genome annotation</p></title><aug><au><snm>Reed</snm><fnm>JL</fnm></au><au><snm>Famili</snm><fnm>I</fnm></au><au><snm>Thiele</snm><fnm>I</fnm></au><au><snm>Palsson</snm><fnm>BO</fnm></au></aug><source>Nat Rev Genet</source><pubdate>2006</pubdate><volume>7</volume><fpage>130</fpage><lpage>141</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1038/nrg1769</pubid><pubid idtype="pmpid" link="fulltext">16418748</pubid></pubidlist></xrefbib></bibl><bibl id="B34"><title><p>The growing scope of applications of genome-scale metabolic reconstructions using Escherichia coli</p></title><aug><au><snm>Feist</snm><fnm>AM</fnm></au><au><snm>Palsson</snm><fnm>BO</fnm></au></aug><source>Nat Biotechnol</source><pubdate>2008</pubdate><volume>26</volume><fpage>659</fpage><lpage>667</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1038/nbt1401</pubid><pubid idtype="pmcid">3108568</pubid><pubid idtype="pmpid" link="fulltext">18536691</pubid></pubidlist></xrefbib></bibl><bibl id="B35"><title><p>Advances in flux balance analysis</p></title><aug><au><snm>Kauffman</snm><fnm>KJ</fnm></au><au><snm>Prakash</snm><fnm>P</fnm></au><au><snm>Edwards</snm><fnm>JS</fnm></au></aug><source>Curr Opin Biotechnol</source><pubdate>2003</pubdate><volume>14</volume><fpage>491</fpage><lpage>496</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1016/j.copbio.2003.08.001</pubid><pubid idtype="pmpid" link="fulltext">14580578</pubid></pubidlist></xrefbib></bibl><bibl id="B36"><title><p>In silico predictions of Escherichia coli metabolic capabilities are consistent with experimental data</p></title><aug><au><snm>Edwards</snm><fnm>JS</fnm></au><au><snm>Ibarra</snm><fnm>RU</fnm></au><au><snm>Palsson</snm><fnm>BO</fnm></au></aug><source>Nat Biotechnol</source><pubdate>2001</pubdate><volume>19</volume><fpage>125</fpage><lpage>130</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1038/84379</pubid><pubid idtype="pmpid" link="fulltext">11175725</pubid></pubidlist></xrefbib></bibl><bibl id="B37"><title><p>Escherichia coli K-12 undergoes adaptive evolution to achieve in silico predicted optimal growth</p></title><aug><au><snm>Ibarra</snm><fnm>RU</fnm></au><au><snm>Edwards</snm><fnm>JS</fnm></au><au><snm>Palsson</snm><fnm>BO</fnm></au></aug><source>Nature</source><pubdate>2002</pubdate><volume>420</volume><fpage>186</fpage><lpage>189</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1038/nature01149</pubid><pubid idtype="pmpid" link="fulltext">12432395</pubid></pubidlist></xrefbib></bibl><bibl id="B38"><title><p>Analysis of optimality in natural and perturbed metabolic networks</p></title><aug><au><snm>Segr&#232;</snm><fnm>D</fnm></au><au><snm>Vitkup</snm><fnm>D</fnm></au><au><snm>Church</snm><fnm>GM</fnm></au></aug><source>Proc Natl Acad Sci USA</source><pubdate>2002</pubdate><volume>99</volume><fpage>15112</fpage><lpage>15117</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1073/pnas.232349399</pubid><pubid idtype="pmcid">137552</pubid><pubid idtype="pmpid" link="fulltext">12415116</pubid></pubidlist></xrefbib></bibl><bibl id="B39"><title><p>Parallel adaptive evolution cultures of Escherichia coli lead to convergent growth phenotypes with different gene expression states</p></title><aug><au><snm>Fong</snm><fnm>SS</fnm></au><au><snm>Joyce</snm><fnm>AR</fnm></au><au><snm>Palsson</snm><fnm>BO</fnm></au></aug><source>Genome Res</source><pubdate>2005</pubdate><volume>15</volume><fpage>1365</fpage><lpage>1372</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1101/gr.3832305</pubid><pubid idtype="pmcid">1240078</pubid><pubid idtype="pmpid" link="fulltext">16204189</pubid></pubidlist></xrefbib></bibl><bibl id="B40"><title><p>Evolutionary plasticity and innovations in complex metabolic reaction networks</p></title><aug><au><snm>Rodrigues</snm><fnm>JFM</fnm></au><au><snm>Wagner</snm><fnm>A</fnm></au></aug><source>PLoS Comput Biol</source><pubdate>2009</pubdate><volume>5</volume><issue>12</issue><fpage>e1000613</fpage><xrefbib><pubidlist><pubid idtype="doi">10.1371/journal.pcbi.1000613</pubid><pubid idtype="pmcid">2785887</pubid><pubid idtype="pmpid" link="fulltext">20019795</pubid></pubidlist></xrefbib></bibl><bibl id="B41"><title><p>KEGG: Kyoto Encyclopedia of Genes and Genomes</p></title><aug><au><snm>Kanehisa</snm><fnm>M</fnm></au><au><snm>Goto</snm><fnm>S</fnm></au></aug><source>Nucl Acids Res</source><pubdate>2000</pubdate><volume>28</volume><issue>1</issue><fpage>27</fpage><lpage>30</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1093/nar/28.1.27</pubid><pubid idtype="pmcid">102409</pubid><pubid idtype="pmpid" link="fulltext">10592173</pubid></pubidlist></xrefbib></bibl><bibl id="B42"><title><p>An expanded genome-scale model of Escherichia coli K-12 (iJR904 GSM/GPR)</p></title><aug><au><snm>Reed</snm><fnm>JL</fnm></au><au><snm>Vo</snm><fnm>TD</fnm></au><au><snm>Schilling</snm><fnm>CH</fnm></au><au><snm>Palsson</snm><fnm>BO</fnm></au></aug><source>Genome Biology</source><pubdate>2003</pubdate><volume>4</volume><fpage>R54</fpage><xrefbib><pubidlist><pubid idtype="doi">10.1186/gb-2003-4-9-r54</pubid><pubid idtype="pmcid">193654</pubid><pubid idtype="pmpid" link="fulltext">12952533</pubid></pubidlist></xrefbib></bibl><bibl id="B43"><title><p>Neutralism and selectionism: a network-based reconciliation</p></title><aug><au><snm>Wagner</snm><fnm>A</fnm></au></aug><source>Nat Rev Genet</source><pubdate>2008</pubdate><volume>9</volume><fpage>965</fpage><lpage>974</lpage><xrefbib><pubid idtype="pmpid" link="fulltext">18957969</pubid></xrefbib></bibl><bibl id="B44"><title><p>From sequences to shapes and back - a case-study in RNA secondary structures</p></title><aug><au><snm>Schuster</snm><fnm>P</fnm></au><au><snm>Fontana</snm><fnm>W</fnm></au><au><snm>Stadler</snm><fnm>P</fnm></au><au><snm>Hofacker</snm><fnm>I</fnm></au></aug><source>Proc R Soc London Ser B</source><pubdate>1994</pubdate><volume>255</volume><fpage>279</fpage><lpage>284</lpage><xrefbib><pubid idtype="doi">10.1098/rspb.1994.0040</pubid></xrefbib></bibl><bibl id="B45"><title><p>How are model protein structures distributed in sequence space?</p></title><aug><au><snm>Bornberg-Bauer</snm><fnm>E</fnm></au></aug><source>Biophys J</source><pubdate>1997</pubdate><volume>73</volume><fpage>2393</fpage><lpage>2403</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1016/S0006-3495(97)78268-7</pubid><pubid idtype="pmcid">1181141</pubid><pubid idtype="pmpid" link="fulltext">9370433</pubid></pubidlist></xrefbib></bibl><bibl id="B46"><title><p>The protein folding problem</p></title><aug><au><snm>Dill</snm><fnm>KA</fnm></au><au><snm>Ozkan</snm><fnm>SB</fnm></au><au><snm>Shell</snm><fnm>MS</fnm></au><au><snm>Weikl</snm><fnm>TR</fnm></au></aug><source>Annu Rev Biophys</source><pubdate>2008</pubdate><volume>37</volume><fpage>289</fpage><lpage>316</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1146/annurev.biophys.37.092707.153558</pubid><pubid idtype="pmcid">2443096</pubid><pubid idtype="pmpid">18573083</pubid></pubidlist></xrefbib></bibl><bibl id="B47"><title><p>Robustness can evolve gradually in complex regulatory gene networks with varying topology</p></title><aug><au><snm>Ciliberti</snm><fnm>S</fnm></au><au><snm>Martin</snm><fnm>OC</fnm></au><au><snm>Wagner</snm><fnm>A</fnm></au></aug><source>PLoS Comput Biol</source><pubdate>2007</pubdate><volume>3</volume><fpage>e15</fpage><xrefbib><pubidlist><pubid idtype="doi">10.1371/journal.pcbi.0030015</pubid><pubid idtype="pmcid">1794322</pubid><pubid idtype="pmpid" link="fulltext">17274682</pubid></pubidlist></xrefbib></bibl><bibl id="B48"><title><p>Equations of state calculations by fast computing machines</p></title><aug><au><snm>Metropolis</snm><fnm>N</fnm></au><au><snm>Rosenbluth</snm><fnm>A</fnm></au><au><snm>Rosenbluth</snm><fnm>M</fnm></au><au><snm>Teller</snm><fnm>A</fnm></au><au><snm>Teller</snm><fnm>E</fnm></au></aug><source>Journal of Chemical Physics</source><pubdate>1953</pubdate><volume>21</volume><fpage>1087</fpage><lpage>1092</lpage><xrefbib><pubid idtype="doi">10.1063/1.1699114</pubid></xrefbib></bibl><bibl id="B49"><title><p>Community structure in social and biological networks</p></title><aug><au><snm>Girvan</snm><fnm>M</fnm></au><au><snm>Newman</snm><fnm>ME</fnm></au></aug><source>Proc Natl Acad Sci USA</source><pubdate>2002</pubdate><volume>99</volume><fpage>7821</fpage><lpage>7826</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1073/pnas.122653799</pubid><pubid idtype="pmcid">122977</pubid><pubid idtype="pmpid" link="fulltext">12060727</pubid></pubidlist></xrefbib></bibl><bibl id="B50"><title><p>Finding community structure in very large networks</p></title><aug><au><snm>Clauset</snm><fnm>A</fnm></au><au><snm>Newman</snm><fnm>MEJ</fnm></au><au><snm>Moore</snm><fnm>C</fnm></au></aug><source>Physical Review E</source><pubdate>2004</pubdate><volume>70</volume><fpage>066111</fpage></bibl><bibl id="B51"><title><p>Defining and identifying communities in networks</p></title><aug><au><snm>Radicchi</snm><fnm>F</fnm></au><au><snm>Castellano</snm><fnm>C</fnm></au><au><snm>Cecconi</snm><fnm>F</fnm></au><au><snm>Loreto</snm><fnm>V</fnm></au><au><snm>Parisi</snm><fnm>D</fnm></au></aug><source>Proc Natl Acad Sci USA</source><pubdate>2004</pubdate><volume>101</volume><fpage>2658</fpage><lpage>2663</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1073/pnas.0400054101</pubid><pubid idtype="pmcid">365677</pubid><pubid idtype="pmpid" link="fulltext">14981240</pubid></pubidlist></xrefbib></bibl><bibl id="B52"><title><p>Modularity and community structure in networks</p></title><aug><au><snm>Newman</snm><fnm>ME</fnm></au></aug><source>Proc Natl Acad Sci USA</source><pubdate>2006</pubdate><volume>103</volume><fpage>8577</fpage><lpage>8582</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1073/pnas.0601602103</pubid><pubid idtype="pmcid">1482622</pubid><pubid idtype="pmpid" link="fulltext">16723398</pubid></pubidlist></xrefbib></bibl><bibl id="B53"><title><p>Resolution limit in community detection</p></title><aug><au><snm>Fortunato</snm><fnm>S</fnm></au><au><snm>Barthelemy</snm><fnm>M</fnm></au></aug><source>Proc Natl Acad Sci USA</source><pubdate>2007</pubdate><volume>104</volume><fpage>36</fpage><lpage>41</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1073/pnas.0605965104</pubid><pubid idtype="pmcid">1765466</pubid><pubid idtype="pmpid" link="fulltext">17190818</pubid></pubidlist></xrefbib></bibl><bibl id="B54"><title><p>Community detection in graphs</p></title><aug><au><snm>Fortunato</snm><fnm>S</fnm></au></aug><source>Physics Reports-Review Section of Physics Letters</source><pubdate>2010</pubdate><volume>486</volume><fpage>75</fpage><lpage>174</lpage></bibl><bibl id="B55"><title><p>On modularity clustering</p></title><aug><au><snm>Brandes</snm><fnm>U</fnm></au><au><snm>Delling</snm><fnm>D</fnm></au><au><snm>Gaertler</snm><fnm>M</fnm></au><au><snm>Gorke</snm><fnm>R</fnm></au><au><snm>Hoefer</snm><fnm>M</fnm></au><au><snm>Nikoloski</snm><fnm>Z</fnm></au><au><snm>Wagner</snm><fnm>D</fnm></au></aug><source>IEEE Transactions on Knowledge and Data Engineering</source><pubdate>2008</pubdate><volume>20</volume><fpage>172</fpage><lpage>188</lpage></bibl><bibl id="B56"><title><p>Modularity-Maximizing Graph Communities via Mathematical Programming</p></title><aug><au><snm>Agarwal</snm><fnm>G</fnm></au><au><snm>Kempe</snm><fnm>D</fnm></au></aug><source>European Physics Journal B</source><pubdate>2008</pubdate><volume>66</volume><fpage>3</fpage></bibl><bibl id="B57"><title><p>Low degree metabolites explain essential reactions and enhance modularity in biological networks</p></title><aug><au><snm>Samal</snm><fnm>A</fnm></au><au><snm>Singh</snm><fnm>S</fnm></au><au><snm>Giri</snm><fnm>V</fnm></au><au><snm>Krishna</snm><fnm>S</fnm></au><au><snm>Raghuram</snm><fnm>N</fnm></au><au><snm>Jain</snm><fnm>S</fnm></au></aug><source>BMC Bioinformatics</source><pubdate>2006</pubdate><volume>7</volume><fpage>118</fpage><xrefbib><pubidlist><pubid idtype="doi">10.1186/1471-2105-7-118</pubid><pubid idtype="pmcid">1434774</pubid><pubid idtype="pmpid" link="fulltext">16524470</pubid></pubidlist></xrefbib></bibl><bibl id="B58"><title><p>Co-regulation of metabolic genes is better explained by flux coupling than by network distance</p></title><aug><au><snm>Notebaart</snm><fnm>RA</fnm></au><au><snm>Teusink</snm><fnm>B</fnm></au><au><snm>Siezen</snm><fnm>RJ</fnm></au><au><snm>Papp</snm><fnm>B</fnm></au></aug><source>PLoS Comput Biol</source><pubdate>2008</pubdate><volume>4</volume><fpage>e26</fpage><xrefbib><pubidlist><pubid idtype="doi">10.1371/journal.pcbi.0040026</pubid><pubid idtype="pmcid">2211535</pubid><pubid idtype="pmpid" link="fulltext">18225949</pubid></pubidlist></xrefbib></bibl><bibl id="B59"><title><p>Gene ontology: tool for the unification of biology. The Gene Ontology Consortium</p></title><aug><au><snm>Ashburner</snm><fnm>M</fnm></au><au><snm>Ball</snm><fnm>CA</fnm></au><au><snm>Blake</snm><fnm>JA</fnm></au><au><snm>Botstein</snm><fnm>D</fnm></au><au><snm>Butler</snm><fnm>H</fnm></au><au><snm>Cherry</snm><fnm>JM</fnm></au><au><snm>Davis</snm><fnm>AP</fnm></au><au><snm>Dolinski</snm><fnm>K</fnm></au><au><snm>Dwight</snm><fnm>SS</fnm></au><au><snm>Eppig</snm><fnm>JT</fnm></au><etal/></aug><source>Nat Genet</source><pubdate>2000</pubdate><volume>25</volume><fpage>25</fpage><lpage>29</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1038/75556</pubid><pubid idtype="pmcid">3037419</pubid><pubid idtype="pmpid" link="fulltext">10802651</pubid></pubidlist></xrefbib></bibl><bibl id="B60"><title><p>Structural analysis of expanding metabolic networks</p></title><aug><au><snm>Ebenhoh</snm><fnm>O</fnm></au><au><snm>Handorf</snm><fnm>T</fnm></au><au><snm>Heinrich</snm><fnm>R</fnm></au></aug><source>Genome Inform</source><pubdate>2004</pubdate><volume>15</volume><fpage>35</fpage><lpage>45</lpage><xrefbib><pubid idtype="pmpid">15712108</pubid></xrefbib></bibl><bibl id="B61"><title><p>Expanding metabolic networks: scopes of compounds, robustness, and evolution</p></title><aug><au><snm>Handorf</snm><fnm>T</fnm></au><au><snm>Ebenhoh</snm><fnm>O</fnm></au><au><snm>Heinrich</snm><fnm>R</fnm></au></aug><source>J Mol Evol</source><pubdate>2005</pubdate><volume>61</volume><fpage>498</fpage><lpage>512</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1007/s00239-005-0027-1</pubid><pubid idtype="pmpid" link="fulltext">16155745</pubid></pubidlist></xrefbib></bibl><bibl id="B62"><title><p>Lateral gene transfer and the nature of bacterial innovation</p></title><aug><au><snm>Ochman</snm><fnm>H</fnm></au><au><snm>Lawrence</snm><fnm>JG</fnm></au><au><snm>Groisman</snm><fnm>EA</fnm></au></aug><source>Nature</source><pubdate>2000</pubdate><volume>405</volume><fpage>299</fpage><lpage>304</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1038/35012500</pubid><pubid idtype="pmpid" link="fulltext">10830951</pubid></pubidlist></xrefbib></bibl><bibl id="B63"><title><p>Adaptive evolution of bacterial metabolic networks by horizontal gene transfer</p></title><aug><au><snm>Pal</snm><fnm>C</fnm></au><au><snm>Papp</snm><fnm>B</fnm></au><au><snm>Lercher</snm><fnm>MJ</fnm></au></aug><source>Nat Genet</source><pubdate>2005</pubdate><volume>37</volume><fpage>1372</fpage><lpage>1375</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1038/ng1686</pubid><pubid idtype="pmpid" link="fulltext">16311593</pubid></pubidlist></xrefbib></bibl><bibl id="B64"><aug><au><snm>Simon</snm><fnm>HA</fnm></au></aug><source>The Sciences of the Artificial</source><publisher>Cambridge, MA: The MIT Press</publisher><pubdate>1969</pubdate></bibl><bibl id="B65"><title><p>Managing in an age of modularity</p></title><aug><au><snm>Baldwin</snm><fnm>CY</fnm></au><au><snm>Clark</snm><fnm>KB</fnm></au></aug><source>Harvard Business Review</source><pubdate>1997</pubdate><volume>75</volume><fpage>84</fpage><lpage>93</lpage><xrefbib><pubid idtype="pmpid">10170333</pubid></xrefbib></bibl><bibl id="B66"><aug><au><snm>Baldwin</snm><fnm>CY</fnm></au><au><snm>Clark</snm><fnm>KB</fnm></au></aug><source>Design Rules, Vol. 1: The Power of Modularity</source><publisher>Cambridge, MA: The MIT Press</publisher><pubdate>2000</pubdate></bibl><bibl id="B67"><aug><au><snm>Tsang</snm><fnm>E</fnm></au></aug><source>Foundations of Constraint Satisfaction</source><publisher>London and San Diego: Academic Press</publisher><pubdate>1993</pubdate></bibl><bibl id="B68"><title><p>Regulatory on/off minimization of metabolic flux changes after genetic perturbations</p></title><aug><au><snm>Shlomi</snm><fnm>T</fnm></au><au><snm>Berkman</snm><fnm>O</fnm></au><au><snm>Ruppin</snm><fnm>E</fnm></au></aug><source>Proc Natl Acad Sci USA</source><pubdate>2005</pubdate><volume>102</volume><fpage>7695</fpage><lpage>7700</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1073/pnas.0406346102</pubid><pubid idtype="pmcid">1140402</pubid><pubid idtype="pmpid" link="fulltext">15897462</pubid></pubidlist></xrefbib></bibl><bibl id="B69"><title><p>Detecting strictly detailed balanced subnetworks in open chemical reaction networks</p></title><aug><au><snm>Schuster</snm><fnm>S</fnm></au><au><snm>Schuster</snm><fnm>R</fnm></au></aug><source>J Math Chem</source><pubdate>1991</pubdate><volume>6</volume><fpage>17</fpage><lpage>40</lpage><xrefbib><pubid idtype="doi">10.1007/BF01192571</pubid></xrefbib></bibl><bibl id="B70"><title><p>Comparing flux balance analysis to network expansion: producibility, sustainability and the scope of compounds</p></title><aug><au><snm>Kruse</snm><fnm>K</fnm></au><au><snm>Ebenhoh</snm><fnm>O</fnm></au></aug><source>Genome Inform</source><pubdate>2008</pubdate><volume>20</volume><fpage>91</fpage><lpage>101</lpage><xrefbib><pubid idtype="pmpid">19425125</pubid></xrefbib></bibl><bibl id="B71"><title><p>Computational identification of obligatorily autocatalytic replicators embedded in metabolic networks</p></title><aug><au><snm>Kun</snm><fnm>A</fnm></au><au><snm>Papp</snm><fnm>B</fnm></au><au><snm>Szathmary</snm><fnm>E</fnm></au></aug><source>Genome Biol</source><pubdate>2008</pubdate><volume>9</volume><fpage>R51</fpage><xrefbib><pubidlist><pubid idtype="doi">10.1186/gb-2008-9-3-r51</pubid><pubid idtype="pmcid">2397503</pubid><pubid idtype="pmpid" link="fulltext">18331628</pubid></pubidlist></xrefbib></bibl><bibl id="B72"><title><p>KEGG Pathway Database</p></title><url>http://www.genome.jp/kegg/pathway.html</url></bibl><bibl id="B73"><title><p>iJR904 E. coli metabolic network database</p></title><url>http://www.ncbi.nlm.nih.gov/pmc/articles/PMC193654/bin/gb-2003-4-9-r54-s1.xls</url></bibl><bibl id="B74"><title><p>An index to quantify an individual's scientific research output</p></title><aug><au><snm>Hirsch</snm><fnm>JE</fnm></au></aug><source>Proc Natl Acad Sci USA</source><pubdate>2005</pubdate><volume>102</volume><fpage>16569</fpage><lpage>16572</lpage><xrefbib><pubidlist><pubid idtype="doi">10.1073/pnas.0507655102</pubid><pubid idtype="pmcid">1283832</pubid><pubid idtype="pmpid" link="fulltext">16275915</pubid></pubidlist></xrefbib></bibl></refgrp>
</bm></art>