<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Comparing Metabolic Pathways through Potential Fluxes: a Selectively Open Approach</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Paolo Baldan</string-name>
          <email>baldan@math.unipd.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Martina Bocci</string-name>
          <email>martina.bocci@unive.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nicoletta Cocco</string-name>
          <email>cocco@unive.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marta Simeoni</string-name>
          <email>simeoni@unive.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dipartimento di Matematica, Universita di Padova via Trieste 63</institution>
          ,
          <addr-line>35121 Padova</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Dipartimento di Scienze Ambientali, Statistica e Informatica, Universita Ca' Foscari Venezia</institution>
          ,
          <addr-line>via Torino 155, 30172 Venezia Mestre</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2013</year>
      </pub-date>
      <volume>988</volume>
      <abstract>
        <p>In our previous work we developed CoMeta, a tool for comparing metabolic pathways of di erent organisms, using the KEGG database as data source. The similarity measure adopted combines homology of reactions and functional aspects of the pathways. The latter are captured by T-invariants in the Petri net representation, which correspond to potential uxes in the pathways. A Petri net can model a metabolic pathway of an organism either in isolation, focussing on its internal behaviour (isolated net), or as an interactive subsystem of the full metabolic network (open net). Modelling a pathway as an isolated net normally works ne for comparison purposes, but unsatisfactory results can arise as it supplies a partial view on internal uxes. A representation as an open net makes additional information available, but the choice of the interactions of the pathway with the environment is non-trivial. Considering all possible interactions with the environment (an information automatically retrieved from KEGG) is not appropriate. Some interactions may add noise to the model, the size of invariants bases grows up to an order of magnitude and the comparison results might be less precise than with the isolated representation. Here we propose an extension of CoMeta which allows the user to select which metabolites should be considered as interactions of interest, discriminating between input and output metabolites. We illustrate some experiments which show the advantages of this more exible approach. Our experience suggests that in general a good choice is to take as open metabolites those which are the input and output compounds for the pathway.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Subsystems of metabolism dealing with some speci c function are called metabolic
pathways. Comparing metabolic pathways of di erent species yields interesting
information on their evolution and it may help in understanding metabolic
functions. This is important for metabolic engineering and for studying diseases and
drugs design.</p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref6 ref9">9, 6</xref>
        ] we proposed to represent pathways as Petri nets (PNs) and compare
them by considering static aspects, provided by the reactions, and information
on the behaviour, as captured by the T-invariant bases of the corresponding Petri
net models. Petri nets seem to be particularly natural for modelling metabolic
pathways (see, e.g., [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] and references therein). The graphical representations
used by biologists for metabolic pathways and the ones used in PNs are similar;
the stoichiometric matrix of a metabolic pathway is analogous to the incidence
matrix of a PN; the ux modes and the conservation relations for metabolites
correspond to speci c properties of PNs. In particular minimal (semi-positive)
T-invariants correspond to elementary ux modes [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] of a metabolic pathway,
i.e., minimal sets of reactions that can operate at a steady state. The space of
semi-positive T-invariants has a unique basis of minimal T-invariants which is
characteristic of the net and we used it in the comparison.
      </p>
      <p>
        We developed CoMeta, a tool implementing our proposal. Given a set of
organisms and a set of metabolic pathways, CoMeta automatically gets the
corresponding data from the KEGG database [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], builds the corresponding Petri nets,
computes the T-invariants and the similarity measure, and shows the results of
the comparison among organisms as a phylogenetic tree.
      </p>
      <p>
        The prototype version of CoMeta presented in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] produced isolated PN
models. In an isolated model the connections of the metabolic pathway with the
environment are not represented. The potential uxes which can be observed
and compared with thus only the internal ones. According to our experiments,
isolated net models normally work ne, but in some cases they may lead to
unsatisfactory results. This happens when internal uxes do not su ciently
characterise the behaviour of the net, for example when a pathway has very few
internal cycles. In this case neglecting the interactions with the enviroment
becomes problematic.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] an extended version of CoMeta is proposed which gives the choice
of producing either isolated or open PN models. In an open model, in order to
express the interaction of the pathway with the environment, some compounds
are represented as open places, i.e. places where the environment can freely
put/remove substances through corresponding input/output transitions. Open
places may be both the compounds which link the pathway to the rest of the
metabolic network and the compounds which are only substrates or only
products (the sources and the sinks of the net). In [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], by choosing an open model
representation, all the compounds shared with the rest of the network and all the
sources and sinks of a pathway are automatically modelled as open places. But
further experiments show that this choice might lead to unsatisfactory results:
some interactions reported in KEGG may be not precise or they may introduce
noise in the comparison. Moreover, the added open places determine a growth
in the size of invariants bases up to an order of magnitude, with consequences
on the e eciency of the comparison.
      </p>
      <p>The new version of CoMeta presented in this paper extends the previous
ones with the possibility, for the user, to selectively open the model. The set
of potentially open compounds is proposed to the user, who can decide, on
the basis of her/his knowledge, which should be the open input and output
metabolites. Then, in addition to the internal uxes, potential uxes involving
the chosen input/output metabolites will be considered in the comparison. From
our experience it is always convenient to open the sources and the sinks in the
networks. Hence currently in CoMeta this is the default choice proposed to the
user, which is however free to add or remove metabolites as open places.</p>
      <p>The paper is organised as follows. In Section 2 we show how a Petri net can
model a metabolic pathway in the isolated and open approach. In Section 3 we
brie y illustrate the new version of CoMeta and in Section 4 we present some
experiments with it. A short conclusion follows in Section 5.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Petri net representation of a metabolic pathway</title>
      <p>
        PNs are a well known formalism originally introduced in computer science for
modelling discrete concurrent systems. PNs have a sound theory and many
applications both in computer science and in real life systems (see [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] and [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
for surveys on PNs and their properties). A large number of tools have been
developed for analysing properties of PNs. A quite comprehensive list can be
found at the Petri Nets World site [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>
        Starting with [
        <xref ref-type="bibr" rid="ref14 ref19">19, 14</xref>
        ], Petri nets have been used as a model for
representing and analysing metabolic pathways. A large body of literature exists on the
topic (see, e.g, [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] for a survey). The structural representation of a metabolic
pathway by means of a PN can be obtained by exploiting the natural
correspondence between PNs and biochemical networks. In fact places are associated with
molecular species, such as metabolites, proteins or enzymes; transitions
correspond to chemical reactions; input places represent the substrate or reactants;
output places represent reaction products. The incidence matrix of the PN is
identical to the stoichiometric matrix of the system of chemical reactions. The
number of tokens in each place indicates the amount of substance associated
with that place. Quantitative data can be added to re ne the representation. In
particular, extended PNs can be enriched with a transition rate which depends
on the kinetic law of the corresponding reaction.
      </p>
      <p>When metabolic pathways are represented as Petri nets, we may consider
their behavioural aspects as captured by the T-invariants (transition invariants)
of the nets which, roughly, represent potential cyclic behaviours in the system.
More precisely a T-invariant is a multiset of transitions whose execution starting
from a state will bring the system back to the same state. Therefore presence
of T-invariants in a metabolic pathway is biologically of great interest as it can
reveal the presence of steady states, in which concentrations of substances have
reached a possibly dynamic equilibrium.</p>
      <p>
        The set of semi-positive T-invariants of a nite PN N admits a nitary
representation by means of the so-called Hilbert basis [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], denoted B(N ), which
consists of the set of minimal T-invariants. Any T-invariant can be obtained as
a linear combination (with positive integer coe cient) of elements of the basis.
out
p1
p3
(c)
p2
2
B
D
Uniqueness of the basis B(N ) allows us to take it as a characteristic feature of
the net.
      </p>
      <p>
        In a PN model of a metabolic pathway, a minimal T-invariant corresponds to
an elementary ux mode, a term introduced in [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] to refer to a minimal set of
reactions that can operate at a steady state. It can be interpreted as a minimal
self-su cient subsystem which is associated to a function. Minimal T-invariants
have been used in Systems Biology as fundamental tool in model validation
techniques (see, e.g., [
        <xref ref-type="bibr" rid="ref13 ref15">13, 15</xref>
        ]) and in analysis and decomposition techniques (see,
e.g., [
        <xref ref-type="bibr" rid="ref11 ref12">12, 11</xref>
        ]).
      </p>
      <p>
        The Petri nets corresponding to the metabolic pathways of an organism are
subnets of a larger net representing its full metabolic network. They can be
considered as isolated subnets, by ignoring their interactions with the
environment, or as open subnets, i.e., interactive subsystems which exchange compounds
with the environment. This is obtained by taking their input/output metabolites
as open places, where the environment can freely put/remove substances. The
minimal T-invariants of these subnets have a clear relation with (minimal)
Tinvariants of the full network. It can be easily seen that modelling the pathway as
an isolated subsystem guarantees correctness: minimal T-invariants of the
pathway are minimal T-invariants of the full network, but they capture only internal
uxes. If, instead, we consider the pathway as an open subsystem, then we get
completeness: any invariant of the full network, once projected onto the
pathway, is an invariant of the open pathway. The converse does not hold, i.e., there
may be invariants of the open pathway which do not correspond to invariants of
the full network. Hence, in the open approach, we may loose correctness, but,
still, as shown in [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], minimal T-invariants of the full network can be obtained
compositionally from those of the subnetworks.
      </p>
      <p>As an example, consider the simple Petri net in Fig. 1(a). It has two minimal
invariants, namely I1 = fA; C; Eg and I2 = fC; Dg. Note that fB; C; Eg is
not an invariant, since B requires two tokens in p1. Assume that the subnet
of interest consists of the dark red transitions A, B, C, D (with their
preand post-places, i.e., p1, p2 and p3). The isolated representation of this subnet
is given in Fig. 1(b). It is obtained by just removing transition E. Note that
invariant I2 is still there, while I1 is lost. In the open representation of Fig. 1(c),
places p1 and p2 are opened in input and output, respectively, meaning that the
environment can put and remove arbitrarily many tokens in such places. This is
represented by inserting the transitions in and out. As a consequence, there are
three invariants in the open subnet: I2, which was already in the original net,
fin; A; C; outg, which is the projection of I1 over the subnet, and f2 in; B; C; outg
which, instead, does not correspond to any invariant of the original net.</p>
      <p>The present version of CoMeta allows the user to choose either the isolated
or the open view, and, in the latter case, to nely tune the representation of the
compounds on which the interaction with the environment takes place.
3</p>
    </sec>
    <sec id="sec-3">
      <title>The tool CoMeta</title>
      <p>CoMeta, (COmparing METAbolic pathways) is a tool for comparing metabolic
pathways in di erent organisms relying on their PN representation. The
comparison is based on the combination of two distances, a \static" one, dR, taking
into account the reactions in the pathways and a \behavioural" one, dI , taking
into account potential uxes in the pathways at steady state, as expressed by
the T-invariants of the corresponding PNs. Given two pathways represented as
PNs, P1 and P2, each distance is derived from a corresponding similarity score:
dX (P1; P2) = 1 scoreX (P1; P2), with X 2 fR; Ig.</p>
      <p>
        When computing dR, scoreR(P1; P2) represents the similarity between the
reactions in P1 and the ones in P2. Each reaction is represented by the enzymes
which catalyse it and, in turn, each enzyme is identi ed by its EC number [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ].
The similarity between enzymes is simply the identity, but ner similarity
measures between enzymes could be easily accommodated in our setting. Concretely,
scoreR(P1; P2) is a similarity index between the multisets of the EC numbers
associated to the reactions in P1 and P2, respectively. The present version of
CoMeta o ers the choice between the S rensen [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] and the Tanimoto [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]
index extended to multisets.
      </p>
      <p>
        When computing dI , the sets of minimal T-invariants (Hilbert bases) B(P1)
and B(P2) of the two nets are compared. Each invariant is represented as a
multiset of EC numbers, corresponding to the reactions in the invariant, and the
similarity between two invariants is given, as before, by a similarity index. The
similarity score is computed through a heuristic match between the two Hilbert
bases and it represents the similarity of the matching pairs. In CoMeta the two
distances may be combined: dC (P1; P2) = dR(P1; P2) + (1 ) dI (P1; P2); with
2 [0; 1], to move the focus between reactions and functional components, and
two organisms can be compared on n metabolic pathways P1; : : : ; Pn by
considering their average distance on the n pathways. More details on the distances
may be found in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] where a prototype version of CoMeta was presented.
      </p>
      <p>CoMeta is a user-friendly tool written in Java and running under Linux
and Mac. CoMeta o ers a set of integrated functionalities through a graphical
user interface shown in Figure 2(a). In the upper part of the window the desired
KEGG organisms and pathways can be selected. In the lower part a tabbed
panel o ers the commands to be performed. The rst tab of the panel is shown
in the main window, while the others are shown in Figure 2(b), 2(c), and 2(d),
respectively. The main functionalities of the tool are the following ones:
(a) CoMeta main window
(b) Second tab: Generate PNs
(c) Third tab: Compute Distances
(d) Fourth tab: Combined Distance
{ Select organisms and pathways (Figure 2(a)): CoMeta proposes the lists of
all KEGG organisms and pathways and allows the user to select the ones to
be compared by double-clicking them.
{ Retrieve KEGG information: CoMeta automatically downloads from the</p>
      <p>
        KEGG database the selected organisms and pathways.
{ Translate into PNs (Figure 2(b)): CoMeta translates the selected
organisms and pathways into corresponding PNs by using the tool MPath2PN [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
MPath2PN produces a translation enzyme-based and without ubiquitous
substances from KGML (KEGG Markup Language) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] to PNML [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], a
standard format for PNs tools. CoMeta produces the stoichiometric matrix of
the net in a text le.
      </p>
      <p>
        Currently Cometa o ers the possibility of representing the pathways either
as an isolated or as an open subnet of the full metabolism. The user can
model the pathway as an isolated subsystem and focus only on internal
uxes, or he can consider an open net and choose the open places among the
compounds shared with the rest of the network and the compounds which
are sources/sinks for the pathway. To assist the user, the tool proposes a
canonical choice of open places, namely the sources and the sinks of the
net, but this choice can be modi ed by adding and removing places in the
list of potential open places of the speci c pathway and organism. Figure 3
shows the selectively open window for the organism Vitis vinifera wrt. the
Sulfate metabolism pathway. Note that the rst three checkbox columns in
the window specify which metabolites link to other pathways and which
ones are sources or sinks. By clicking on the checkboxes in the two rightmost
columns the user can select to open in input or in output any metabolite
in the pathway. The canonical choice, sources in input and sinks in output,
automatically selected and proposed to the user, is shown in Figure 3.
{ Compute Distances (Figure 2(c)): dR and dI are computed as previously
described. The user can select either the S rensen or the Tanimoto index. For
computing Hilbert bases CoMeta resorts to 4ti2 [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], an e cient tool o ered
in a software package for solving algebraic, geometric and combinatorial
problems on linear spaces. The details of the comparison between any pair of
organisms (T-invariants bases, invariants matches, reactions and invariants
scores, etc.) can be displayed to be analysed by the user.
{ Show Phylogenetic trees (Figure 2(d)): CoMeta computes dC , the distance
which combines dR and dI according to a weight parameter speci ed by the
user. Such a distance may be used to produce and visualise corresponding
phylogenetic trees. The user can specify the method for the generation of
the phylogenetic trees. Currently CoMeta o ers the UPGMA [
        <xref ref-type="bibr" rid="ref22 ref23">23, 22</xref>
        ] and
Neighbour Joining methods [
        <xref ref-type="bibr" rid="ref17 ref22">17, 22</xref>
        ]. The matrices for dR; dI and dC can be
exported as text les for further analyses.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Experiments</title>
      <p>In this section we discuss some experiments performed with CoMeta in order
to illustrate how the choice of the isolated or the open approach may a ect the
results of the comparison of metabolic pathways. We consider a small group of
organisms and analyse dI , the distance based on T-invariants, with the S rensen
index, when modelling the pathways as isolated, fully open and selectively open
PNs. By fully open we mean a model in which all potentially open places, namely
the ones linking the pathway to the rest of the metabolic network and the ones
which are only substrates (sources) or only products (sinks), are indeed open.
In the selectively open approach we use the default choice, i.e., we open in input
source places by adding an input transition to each source, and we open in output
sink places by adding an output transition to each sink.</p>
      <p>The following experiments have a common feature: the pathways of the
organisms we compare have few reversible reactions and few internal cycles. As
a consequence, the comparison of the isolated PN models is not very detailed
because of the small number of internal T-invariants and it produces only a
rough classi cation of the organisms. On the other hand, by considering fully
open models the information on the links among pathways given by KEGG
become mostly relevant in the comparison, even if they are imprecise or not so
important for distinguihing the speci c functionalities. The classi cation of the
organisms results distorted. In such cases, the selectively open approach seems
to give the best results in the comparison, in fact it permits to add relevant
information to the pathway model without overweighting boundary information.
The resulting classi cation is more precise than in the other two approaches. In
particular the canonical choice, i.e. opening in input source places and in output
sink places, can be used with good results when no special knowledge on the
pathway boundary is available.
4.1</p>
      <p>Sulfur metabolism pathway
The Sulfur metabolism pathway describes the sulfur metabolism, including
reduction and xation processes. Sulfur enters in the composition of proteins
(amino acids cysteine and methionine) and from the catabolism of these amino
acids, it is liberated in the form of hydrogen sulphide (H2S). Bacteria in soils and
waters oxidise hydrogen sul de in various steps, to its highest oxidation state
sulphate (SO42 ). Algae, Plants and Bacteria are capable to take the sulfur as
sulphate and to process it to the most reduced form (sul de) for incorporation
into amino acids (cysteine and methionine). Animals are not able to synthesise
methionine which is an essential amino acid to be assumed with the diet.</p>
      <p>We report here on two di erent experiments performed with Sulfur metabolism.
The rst experiment aims at evaluating the ability of dI to discriminate among
very di erent groups of organisms. The second experiment aims at checking
whether dI is able to identify ne-grained di erences among organisms.
First experiment. For this experiment we consider Archaea, Bacteria, Fungi,
Plants (that are able to utilise sulfur as sulphate), Birds and Mammals (Animals,
other than ruminants, take up sulfate only in reduced form in amino acids).
The organisms are therefore expected to show similarity within each group and
strong dissimilarity between groups. The list of selected organisms is shown in
the following table.
Code Organism Reign
hsa Homo sapiens Mammals
ecb Equus caballus Mammals
gga Gallus gallus Birds
tgu Taeniopygia guttataa Birds
ath Arabidopsis thaliana Plants
osa Oryza sativa japonica Plants
bdi Brachypodium distachyon Plants
n Neosartorya scheri Fungi
ang Aspergillus niger Fungi
cpw Coccidioides posadasii Fungi
cow Caldicellulosiruptor owensensis Bacteria
toc Thermosediminibacter oceani Bacteria
hsl Halobacterium salinarum R1 Archaea
hvo Haloferax volcanii Archaea
pto Picrophilus torridus Archaea
By using CoMeta, we compute dI , the distance based on T-invariants, for
the isolated, selectively open and fully open approaches. The Sulfur metabolism</p>
      <p>Top: isolated approach
Middle: canonical selectively open approach</p>
      <p>Bottom: fully open approach
pathway has very small PN models. Depending on the organism, in the isolated
models there are at most 9 enzymes/reactions and at most 1 T-invariant, in
the fully open models at most 19 enzymes/reactions and 6 invariants and in the
canonical selectively open models at most 15 enzymes/reactions and 5 invariants.
The selection is among 13 compounds at most.</p>
      <p>Figure 4 shows the UPGMA tree corresponding to dI in the isolated (top
tree), selectively open (middle tree) and fully open (bottom tree) approaches.
Note that in the isolated approach (top tree) Archaea and Bacteria are rst
discriminated from Fungi, Plants and Animals. At a second level, two out of three
Fungi species are discriminated from Plants and Animals. No other grouping is
evident and the classi cation is rather coarse. The selectively open approach
(middle tree) discriminates at a rst level the Animals (Mammals and Birds)
from other groups. At a lower classi cation level all the three Fungi species
are grouped together, as well as the three Plants species and four out of ve
Archaea and Bacteria species. Only the Archaea pto is not corectly grouped
with the other Archaea (hsl and hvo) and Bacteria (cow, toc). Finally, with the
fully open approach (bottom tree) the Archaea and Bacteria groups are not so
well de ned as in the previous case, i.e. toc and cow are not grouped together.
Hence, in this experiment, the selectively open approach seems to better identify
and group together organisms according to major taxonomic groups.
Second experiment We consider the Sulfur metabolism and the organisms in
the following table.</p>
      <p>Code Organism Reign
pae Pseudomonas aeruginosa PAO1 Bacteria
pfo Pseudomonas uorescens Pf0-1 Bacteria
tin Thiomonas intermedia Bacteria
tcx Thiomicrospira crunogena Bacteria
cpr Clostridium perfringens SM101 Bacteria
cst Clostridium stricklandii Bacteria
ddn Desulfovibrio desulfuricans ND132 Bacteria
vvi Vitis vinifera Plants
zma Zea mays Plants
For this experiment we select within the Bacteria Reign some species having
different sulfur metabolism and playing di erent roles within the bio-geo-chemical
cycle of sulfur. The organisms pae and pfo are capable to oxidize elemental
sulfur to sulfate. Sulfate can be assimilated by Plants and by Bacteria, such as the
Clostridium species considered in the experiment. The sulfate-reducing bacteria,
as ddn, are able to reduce sulfate to sulphide and responsible of bio-corrosion.
On the contrary, tin and tcx oxidize sulphide back to sulfur. By using CoMeta,
we compute dI , the distance based on T-invariants. Figure 5 shows the UPGMA
tree corresponding to dI in the isolated (top tree), selectively open (middle tree)
and fully open (bottom tree) approaches. Note that with the isolated approach
(top tree) Plants, which assimilate sulfur as sulphate from the soil, are
classied together with Bacteria (Pseudomonas genus) which are capable of oxidising
sulfur to sulphate. On the right side of the tree, decomposing Bacteria (cst and
cpr ) are grouped together with other oxidising Bacteria (tcx and tin). The
selectively open approach (middle tree) provides a better classi cation, with all
the sulphide/sulfur oxidising Bacteria grouped together (tcx and tin; pfo and
pae). Desulfovibrio desulfuricans (ddn), a sulfate-reducing Bacteria is also well
discriminated, as well as the two Plant species (zma and vvi ), which assimilate
sulphate, and the two decomposing Bacteria species (cpr and cst ). The fully
open approach (bottom tree) does not provide a well de ned grouping of
organisms as in the selectively open approach (e.g., cst and cpr are not grouped
together; pae is erroneously grouped with ddn). In this experiment the
canonical selectively open approach shows the ability to distinguish organisms at a ne
classi cation level. In this case it is able to discriminate organisms belonging to
the Bacteria Reign, having di erent ecological roles within the biological sulfur
cycle.</p>
      <p>Top: isolated approach.</p>
      <p>Middle: canonical selectively open approach.</p>
      <p>Bottom: fully open approach.
Note that, by considering together all the organisms of the two experiments
on the Sulfur metabolism the classi cation follows the same pattern: the more
detailed classi cation is obtained by using the canonical selectively open approach,
the isolated approach produces a rudimentary classi cation and the fully open
approach does not produce a well de ned classi cation. We preferred to
analyse the two groups separately in order to be able to show more precisely the
granularity of the obtained classi cations.
4.2</p>
      <p>Carbon</p>
      <p>xation pathway
In this experiment we consider the pathway Carbon xation in photosynthetic
organisms. This cycle consists of a series of reactions that lead to the
biosynthesis of carbohydrates in the so called \dark phase" of photosynthesis. In most
photosynthetic organisms this cycle is denominated Calvin cycle or reductive
pentose-phosphates cycle. Some plants, in relation to environmental adaptations,
exhibit speci c variants of this cycle (C4 plants, CAM plants). A peculiarity of
this pathway is that it is mainly composed by irreversible reactions.</p>
      <p>We consider the organisms in Fig. 6 and we compute dI , with the S rensen
index, for the isolated, selectively open and fully open approaches. Depending
on the organism, the PN models contain at most 35 enzimes/reactions and 5
invariants in the isolated case, at most 52 enzimes/reactions and 42 invariants in
the open case and at most 41 enzimes/reactions and 9 invariants in the canonical
selectively open. In the selectively open approach the choice is among at most
34 compounds.</p>
      <p>Code Organism Reign
gmx Glycine max Plants, Eudicots
pop Populus trichocarpa Plants, Eudicots
vvi Vitis vinifera Plants, Eudicots
osa Oryza sativa japonica Plants, Monocots
zma Zea mays Plants, Monocots
bdi Brachypodium distachyon Plants, Monocots
cre Chlamydomonas reinhardtii Plants, green algae
vcn Volvox carteri f. nagariensis Plants, green algae
npu Nostoc punctiforme Bacteria
acy Anabaena cilindrica Bacteria
oni Oscillatoria nigro-viridis Bacteria
mar Microcystis aeruginosa Bacteria</p>
      <p>Figure 7 shows the UPGMA tree corresponding to dI in the isolated (top
tree), canonical selectively open (middle tree) and fully open (bottom tree)
approaches. Note that the isolated approach produces a rough classi cation,
separating the bacteria from the other organisms. The selectively open approach
permits the discrimination among the photosynthetic bacteria. The organism
vcn is isolated due to its very simpli ed cycle, with a reduced number of
intermediate products and enzymes involved. It is well-known that this genus is
a very ancient group of organisms, originated from unicellular organisms. The</p>
      <sec id="sec-4-1">
        <title>Top: isolated approach</title>
      </sec>
      <sec id="sec-4-2">
        <title>Middle: canonical selectively open approach</title>
      </sec>
      <sec id="sec-4-3">
        <title>Bottom: fully open approach</title>
        <p>Fig. 7. Third experiment: UPGMA trees based on dI wrt. Carbon xation in
photosynthetic organisms
fully open approach gives similar results to the selectively open one, but it does
not group all the photosynthetic Bacteria together (npu is separated from all
other organisms).
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>
        Metabolic pathways are subsystems of the full metabolic network. When
constructing a model of a pathway this fact has to be taken into account and
it requires some choices: the pathway can be represented in isolation or as a
subsystem of the full network, interacting with its environment through some
common compounds. In [
        <xref ref-type="bibr" rid="ref6 ref9">9, 6</xref>
        ] we proposed to use Petri net models for pathway
comparisons based on reaction homology and functional aspects as captured by
T-invariants. In this paper we consider the two modelling alternatives, isolated
or open to any interaction with the environment, and conclude that neither of
them is de nitively better than the other. An isolated PN model guarantees
correctness, namely minimal T-invariants of the pathway are minimal T-invariants
of the full network, and it works well in most cases, but it captures only internal
uxes. Sometimes this is not su cient to characterise the potential behaviours
of the pathway, for example when a pathway has few internal cycles. In a fully
open PN model all potentially open places, namely the ones linking the
pathway to the rest of the metabolic network and the ones which are sources or
sinks, are indeed open. This approach may loose the correctness of T-invariants
and in general it increases the size of the model without guaranteeing a better
characterisation of the potential behaviours of the pathway. The information on
the links among pathways becomes very relevant, even when they are not so
important for distinguishing the functionalities associated to the pathway and,
unfortunately, link informations is sometimes imprecise in KEGG. The most
useful approach seems to be an intermediate one, in which a pathway is considered
as an open subsystem, but the compounds on which the interaction takes place
can be selected by the user. Our experience suggests a canonical choice of the
open places which seems to produce the best results even in the absence of
speci c knowledge on a pathway, i.e., opening in input source places and opening
in output sink places. We presented an extension of CoMeta, a tool for
comparing metabolic pathways in di erent organisms, implementing our proposal.
The tool retrieves the information about each selected pathway from the KEGG
database, it determines the compounds which may potentially interact with the
environment of the pathway and it o ers to the user the possibility to select the
interactions of interest, discriminating between input and output metabolites.
CoMeta proposes the canonical choice in the selection (sources open in input
and sinks open in output), but the user can freely add and delete open
compounds. We presented some experiments which, although the work is still in a
preliminary stage, suggest the appropriateness of this approach.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Kegg</given-names>
            <surname>Markup</surname>
          </string-name>
          <article-title>Language manual</article-title>
          . http://www.genome.ad.jp/kegg/docs/xml.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>2. KEGG pathway database - Kyoto University Bioinformatics Centre. http://www.genome.jp/kegg/pathway.html.</mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Petri</given-names>
            <surname>Net</surname>
          </string-name>
          Markup Language. http://www.pnml.org.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <article-title>Petri net tools</article-title>
          . http://www.informatik.uni-hamburg.de/TGI/PetriNets/tools.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <article-title>5. 4ti2 team. 4ti2|a software package for algebraic, geometric and combinatorial problems on linear spaces</article-title>
          . Available at www.4ti2.de.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>P.</given-names>
            <surname>Baldan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Cocco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Giummole</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M</given-names>
            <surname>Simeoni</surname>
          </string-name>
          .
          <article-title>Comparing Metabolic Pathways through Reactions and Potential Fluxes</article-title>
          . In W. van der Aalst and A. Yakovlev, editors,
          <source>Special Issue of ToPNoC(Workshops and Tutorials)</source>
          ,
          <source>LNCS</source>
          . Springer,
          <year>2013</year>
          .
          <article-title>Accepted for publication</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>P.</given-names>
            <surname>Baldan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Cocco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Marin</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M</given-names>
            <surname>Simeoni</surname>
          </string-name>
          .
          <article-title>Petri nets for modelling metabolic pathways: a survey</article-title>
          .
          <source>Natural Computing</source>
          ,
          <volume>9</volume>
          (
          <issue>4</issue>
          ):
          <volume>955</volume>
          {
          <fpage>989</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>P.</given-names>
            <surname>Baldan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Cocco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>De Nes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Llabres</given-names>
            <surname>Segura</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Simeoni</surname>
          </string-name>
          .
          <article-title>MPath2PN - Translating metabolic pathways into Petri nets</article-title>
          . In M. Heiner and H. Matsuno, editors,
          <source>BioPPN2011 Int. Workshop on Biological Processes and Petri Nets, CEUR Workshop Proceedings</source>
          , pages
          <volume>102</volume>
          {
          <fpage>116</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>P.</given-names>
            <surname>Baldan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Cocco</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M</given-names>
            <surname>Simeoni</surname>
          </string-name>
          .
          <article-title>Comparison of metabolic pathways by considering potential uxes</article-title>
          . In M. Heiner and R. Hofestadt, editors,
          <fpage>BioPPN2012</fpage>
          - 3rd
          <source>International Workshop on Biological Processes and Petri Nets, satellite event of Petri Nets</source>
          <year>2012</year>
          , Hamburg, Germany, June 25,
          <year>2012</year>
          ,
          <string-name>
            <given-names>CEUR</given-names>
            <surname>Workshop</surname>
          </string-name>
          Proceedings - Vol-
          <volume>852</volume>
          , pages
          <fpage>2</fpage>
          <lpage>{</lpage>
          17. ceur-ws.org,
          <year>2012</year>
          . ISSN 1613-0073, online: http://ceurws.org/Vol-
          <volume>852</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>J.</given-names>
            <surname>Esparza</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Nielsen</surname>
          </string-name>
          .
          <article-title>Decidability issues for Petri Nets - a survey</article-title>
          .
          <source>Journal Inform. Process. Cybernet. EIK</source>
          ,
          <volume>30</volume>
          (
          <issue>3</issue>
          ):
          <volume>143</volume>
          {
          <fpage>160</fpage>
          ,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. E.
          <string-name>
            <surname>Grafahrend-Belau</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Schreiber</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Heiner</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Sackmann</surname>
            ,
            <given-names>B. H.</given-names>
          </string-name>
          <string-name>
            <surname>Junker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Grunwald</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Speer</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Winder</surname>
            ,
            <given-names>and I. Koch.</given-names>
          </string-name>
          <article-title>Modularization of biochemical networks based on classi cation of Petri net t-invariants</article-title>
          .
          <source>BMC Bioinformatics</source>
          ,
          <volume>9</volume>
          (
          <issue>90</issue>
          ),
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>S.</given-names>
            <surname>Hardy</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.N.</given-names>
            <surname>Robillard</surname>
          </string-name>
          .
          <article-title>Petri net-based method for the analysis of the dynamics of signal propagation in signaling pathways</article-title>
          .
          <source>Bioinformatics</source>
          ,
          <volume>24</volume>
          (
          <issue>2</issue>
          ):
          <volume>209</volume>
          {
          <fpage>217</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>M.</given-names>
            <surname>Heiner</surname>
          </string-name>
          and
          <string-name>
            <given-names>I.</given-names>
            <surname>Koch</surname>
          </string-name>
          .
          <source>Petri Net Based Model Validation in Systems Biology. In Petri Nets and Other Models of Concurrency - ICATPN</source>
          <year>2004</year>
          , volume
          <volume>3099</volume>
          <source>of LNCS</source>
          , pages
          <volume>216</volume>
          {
          <fpage>237</fpage>
          . Springer,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>R.</given-names>
            <surname>Hofesta</surname>
          </string-name>
          <article-title>dt. A Petri net application of metbolic processes</article-title>
          .
          <source>Journal of System Analysis, Modelling and Simulation</source>
          ,
          <volume>16</volume>
          :
          <fpage>113</fpage>
          {
          <fpage>122</fpage>
          ,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15. I. Koch and
          <string-name>
            <given-names>M.</given-names>
            <surname>Heiner</surname>
          </string-name>
          .
          <article-title>Petri nets</article-title>
          . In
          <string-name>
            <given-names>B. H.</given-names>
            <surname>Junker</surname>
          </string-name>
          and F. Schreiber, editors,
          <source>Analysis of Biological Networks</source>
          , Book Series in Bioinformatics, pages
          <fpage>139</fpage>
          {
          <fpage>179</fpage>
          . Wiley &amp; Sons,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>T.</given-names>
            <surname>Murata</surname>
          </string-name>
          . Petri Nets:
          <article-title>Properties, Analysis, and Applications</article-title>
          .
          <source>Proceedings of IEEE</source>
          ,
          <volume>77</volume>
          (
          <issue>4</issue>
          ):
          <volume>541</volume>
          {
          <fpage>580</fpage>
          ,
          <year>1989</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Saitou</surname>
            <given-names>N.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Nei</surname>
            <given-names>M.</given-names>
          </string-name>
          <article-title>The neighbor-joining method: a new method for reconstructing phylogenetic trees</article-title>
          .
          <source>Molecular Biology and Evolution</source>
          ,
          <volume>4</volume>
          (
          <issue>4</issue>
          ):
          <volume>406</volume>
          {
          <fpage>425</fpage>
          ,
          <year>1987</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <given-names>M.</given-names>
            <surname>Pedersen</surname>
          </string-name>
          .
          <article-title>Compositional de nitions of minimal ows in Petri nets</article-title>
          . In M. Heiner and A. M. Uhrmacher, editors,
          <source>Proceeedings of CMSB'08</source>
          , volume
          <volume>5307</volume>
          of Lecture Notes in Computer Science, pages
          <volume>288</volume>
          {
          <fpage>307</fpage>
          . Springer,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <given-names>V. N.</given-names>
            <surname>Reddy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. L.</given-names>
            <surname>Mavrovouniotis</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M. N.</given-names>
            <surname>Liebman</surname>
          </string-name>
          .
          <article-title>Petri net representations in metabolic pathways</article-title>
          .
          <source>In ISMB93: First Int. Conf. on Intelligent Systems for Molecular Biology</source>
          , pages
          <volume>328</volume>
          {
          <fpage>336</fpage>
          . AAAI press,
          <year>1993</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <given-names>A.</given-names>
            <surname>Schrijver</surname>
          </string-name>
          .
          <article-title>Theory of linear and integer programming</article-title>
          .
          <source>Wiley-Interscience series in discrete mathematics and optimization</source>
          . Wiley,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <given-names>S.</given-names>
            <surname>Schuster</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Hilgetag</surname>
          </string-name>
          .
          <article-title>On elementary ux modes in biochemical reaction systems at steady state</article-title>
          .
          <source>Journal of Biological Systems</source>
          ,
          <volume>2</volume>
          :
          <fpage>165</fpage>
          {
          <fpage>182</fpage>
          ,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <given-names>P.</given-names>
            <surname>Sestoft</surname>
          </string-name>
          .
          <article-title>Programs for biosequence analysis</article-title>
          . http://www.itu.dk/people/sestoft/bsa.html.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <given-names>R.</given-names>
            <surname>Sokal</surname>
          </string-name>
          and
          <string-name>
            <surname>Michener C.</surname>
          </string-name>
          <article-title>A statistical method for evaluating systematic relationships</article-title>
          .
          <source>University of Kansas Science Bulletin</source>
          ,
          <volume>38</volume>
          :
          <fpage>14091438</fpage>
          ,
          <year>1958</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>T.</surname>
          </string-name>
          <article-title>S rensen. A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on danish commons</article-title>
          .
          <source>Biologiske Skrifter / Kongelige Danske Videnskabernes Selskabg</source>
          ,
          <volume>5</volume>
          (
          <issue>4</issue>
          ):1{
          <fpage>34</fpage>
          ,
          <year>1948</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25. T.T. Tanimoto.
          <source>Technical report, IBM Internal Report, November 17</source>
          <year>1957</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <given-names>E. C.</given-names>
            <surname>Webb</surname>
          </string-name>
          .
          <article-title>Enzyme nomenclature 1992: recommendations of the Nomenclature Committee of the International Union of Biochemistry and Molecular Biology on the nomenclature and classi cation of enzymes</article-title>
          . San Diego: Published for the
          <source>International Union of Biochemistry and Molecular</source>
          Biology by Academic Press,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>