 Software
 Open Access
 Published:
Structural and functional analysis of cellular networks with CellNetAnalyzer
BMC Systems Biology volume 1, Article number: 2 (2007)
Abstract
Background
Mathematical modelling of cellular networks is an integral part of Systems Biology and requires appropriate software tools. An important class of methods in Systems Biology deals with structural or topological (parameterfree) analysis of cellular networks. So far, software tools providing such methods for both massflow (metabolic) as well as signalflow (signalling and regulatory) networks are lacking.
Results
Herein we introduce CellNetAnalyzer, a toolbox for MATLAB facilitating, in an interactive and visual manner, a comprehensive structural analysis of metabolic, signalling and regulatory networks. The particular strengths of CellNetAnalyzer are methods for functional network analysis, i.e. for characterising functional states, for detecting functional dependencies, for identifying intervention strategies, or for giving qualitative predictions on the effects of perturbations. CellNetAnalyzer extends its predecessor FluxAnalyzer (originally developed for metabolic network and pathway analysis) by a new modelling framework for examining signalflow networks. Two of the novel methods implemented in CellNetAnalyzer are discussed in more detail regarding algorithmic issues and applications: the computation and analysis (i) of shortest positive and shortest negative paths and circuits in interaction graphs and (ii) of minimal intervention sets in logical networks.
Conclusion
CellNetAnalyzer provides a single suite to perform structural and qualitative analysis of both massflow and signalflowbased cellular networks in a userfriendly environment. It provides a large toolbox with various, partially unique, functions and algorithms for functional network analysis.CellNetAnalyzer is freely available for academic use.
Background
Systems biology aims at a holistic analysis of biological networks. Mathematical modelling plays a pivotal role for this integrative approach. The arguably most common formalism for cellular networks is kinetic modelling, which has been successfully applied to the study of single pathways and networks of moderate size (e.g. [1, 2]). However, building dynamic models with high predictive power requires an amount of reliable quantitative data which is often not available in largescale networks with hundreds of players and interactions. Structural or qualitative (parameterfree) models relying solely on the often wellknown network structure provide an alternative approach still capable to gain useful insights in the functioning of these networks [3–6].
CellNetAnalyzer (CNA) is a graphical user interface for MATLAB providing a comprehensive toolbox for structural and functional analysis of different types of cellular networks. CNA extends its predecessor FluxAnalyzer, originally developed for metabolic network analysis [7], by new methods for signalling and regulatory networks, i.e. for networks where signal flows are dominating (in contrast to mass flows in metabolic networks). Herein, we will give a general overview on CNA with focus on the new functionalities.
Implementation
The general setup of CNA is shown in Figure 1. CNA is a toolbox for MATLAB ^{®} (Mathworks Inc.), a widelyused software for numerical computations and complex visualisations of numerical data. CNA has been programmed with the MATLAB language enabling to use builtin functions of MATLAB, in particular those for matrix operations. MATLAB also allows to call external C programs via the socalled MEX interface. CNA makes use of this interface for some computationally intensive calculations (see below).
As CNA runs in the MATLAB environment and because MATLAB is available for many operating systems, CNA itself is platformindependent. Upon starting CNA in MATLAB's command window, CNA runs virtually autonomously as a graphical user interface.
Network projects
As a fundamental step, CNA facilitates the construction of network projects which can represent either a massflow (stoichiometric, metabolic) or a signalflow (signal transduction/regulatory) network. For both types of networks, the abstract network model can be setup and edited via a Network Composer and input masks (see Figure 2) or, alternatively, via ASCII (text) files. The network description comprises always the declaration of species and reactions and their respective attributes. The same nomenclature is used for both kinds of networks, but with a different meaning. In massflow networks (MFNs), reactions correspond to the stoichiometric conversions. Therefore, the reaction equation
A + B → C (1)
is interpreted as usual in MFNs, namely that the two reactants A and B are converted into C. A and B are consumed in this process representing the key characteristic of mass flows. MFNs are stored by the stoichiometric matrix and other variables such as the capacity and reversibility constraints of the reactions [5].
In contrast, a reaction (or interaction in this context) in signalflow networks (SFNs) expresses how the "product" (end node) of the reaction can be activated by the "reactants" (start nodes). Accordingly, equation (1) means in SFNs, that C becomes activated if A AND B are active, i.e. "+" is interpreted as a logical AND. As a key characteristic of signal flows, the start nodes A and B on the lefthand side of the reaction equation are not necessarily consumed in this process. For example, eq. (1) could express that C becomes activated (e.g. phosphorylated at two phosphorylation sites) if the two kinases A and B are in an active state. Accordingly, in CNA, an SFN is a logical (Boolean) network, where each reaction represents a Boolean AND clause expressing a condition under which the end node of this reaction becomes activated. If several reactions point at one species S, then they are OR'ed together giving eventually rise to a Boolean function determining the activation state of S. Accordingly, in the example network shown in Figure 2 and Table 1, node c becomes active if a OR d are active. In addition to AND and OR, representing arbitrary Boolean functions requires a NOT operator (indicated by "!"). Furthermore, multivalued logic is possible in CNA. Therefore, the equation
3 A + !B → 2 C (2)
means that "C reaches level 2 if A is at level 3 AND B is inactive (level 0)". Using the formalism described above, CNA represents the logic of SFNs as logical interaction hypergraphs (strongly related with the sumofproduct or disjunctive normal form (DNF) representation of Boolean functions) which can be conveniently stored in two matrices, each having as rows the species and as columns the interactions [8]: an interaction matrix captures the logical coefficients (similar as the stoichiometric matrix the stoichiometric coefficients) and a NOTmatrix stores where a NOT operation occurs.
Interaction graphs (signed directed graphs where each arc connects one start with one end node indicating a causal positive or negative dependency) can also be encoded in this formalism: graphs are treated as special cases without AND connections. In these cases, the interaction matrix coincides with the incidence matrix of this graph.
Specifically for SFNs, CNA also supports a timescale attribute as well as incomplete truth tables for handling interactions with uncertain logical concatenation [8].
In principle, network analysis with CNA can be done without any graphical representation of the network. However, for visualisation purposes, each network project can be assigned one or several network maps (Figures 1, 2, 3, 4). Network maps must be provided by the user, either created with the help of external drawing programs (e.g. CorelDraw) or by using maps available at databases such as KEGG or TRANSPATH. Thus, network maps in CNA are static but offer a high flexibility regarding their design. The link between network maps and network model is realised in CNA by text boxes, which are small user interfaces, each associated to one network element. They can be positioned via draganddrop at a proper place on the maps and enable input and output of context dependent data. In CNA, a network map with text boxes is called interactive network map. Three examples are shown in Figures 2, 3, 4: Figure 2 displays a simple hypothetical SFN whose reactions are given in Table 1, Figure 3 shows a MFN project for the central metabolism of E. coli (studied in [9]), and Figure 4 displays a SFN model of signalling pathways involved in Tcell activation (a larger version of this model is studied in [10]). Notice the different visual representation of these three networks: CNA does not impose any restrictions on the design of these maps what is possible because the maps can be created with arbitrary (external) drawing tools.
An elegant solution for setting up logical network models is provided by a new feature of the modelling tool ProMoT: the model is created in a visual environment, and both the map and the underlying network can be exported to CNA and other formats [11]. ProMoT is a standalone, objectoriented tool to set up modularly and hierarchically structured models of technical and biological systems in a visual manner by a simple draganddrop procedure [12]. A new library containing logical elements (compounds, NOTs, ANDs, etc.) has been developed which allows to set up models according to the sumofproduct formalism as used in CNA. Properties such as the initial value and time scale can be added via a text menu. Once finished, the models can be exported: one obtains a map (as an image file) and CNA text files defining the mathematical model. Importantly, the corresponding positions of the textboxes required for the interactive network maps in CNA are also included. For more details see [11] and ProMoT's website [13]. As an example, the network project shown in Figure 2 has been produced with the new features of ProMoT.
Results and Discussion
CNA provides a powerful battery of methods for functional network analysis, i.e. for characterising functional states, for detecting functional dependencies, for identifying intervention strategies, or for giving qualitative predictions on the effects of perturbations. A typical scenario is to check "whether and how a certain metabolite (transcription factor) can be synthesised (activated) in a metabolic (signalling) network under a certain knockout condition with a given set of external resources (input stimuli)". The user may start computations from a pulldown menu whose content depends on the type of the network project (massflow or signalflow; see Figures 3 and 4). All functions are described in detail in the CNA user's manual, here we shall only give an overview and emphasise novel routines, in particular for signalflow networks.
Metabolic networks
Regarding massflow networks, the majority of methods implemented in CNA belong to the constraintbased approach frequently used for metabolic network analysis [4, 5]. Additionally, some methods for graphtheoretical analysis are provided. The main features are:

general topological properties: (dead ends, blocked reactions, parallel reactions, enzyme subsets, etc)

(elementary) conservation relations

graphtheoretical features: shortest path lengths, connectivity analysis, network diameter etc.

metabolic flux analysis: computing steadystate flux distributions from a set of given reaction rates (see example in Figure 3); handling redundant systems including gross error detection; feasibility check of flux scenarios

flux balance analysis: find optimal flux distributions for arbitrary linear objective functions

metabolic pathway analysis with elementary modes

minimal cut set analysis: intervention strategies for repressing a certain functionality in the network
Most of these functions were already part of FluxAnalyzer [7]. The tools provided for a comprehensive analysis of elementary modes (EMs) and minimal cut sets (MCSs) are a particular strength of CNA and have been revised and algorithmically improved. EMs represent the minimal functional units (pathways) of a metabolic network [14], whereas minimal cut sets (MCSs) can be seen as minimal failure modes [15, 16]. EMs and MCS are actually dual descriptions of a network's functionality [16], each providing different applications. In particular EM analysis has become a standard tool in metabolic network analysis [14, 5]. However, the inherent combinatorial complexity makes the calculation of EMs and MCSs in large networks a computationally hard task. CNA offers stateoftheart algorithms and uses the MEX interface of MATLAB to call (faster) external Cfiles [17] (see Figure 1). In particular, CNA provides an interface to Metatool [18] enabling to compute EMs on the fly with the probably fastest algorithm currently available. The computation of MCSs has been revised; it relies now on the Berge algorithm known from the theory of minimal hitting sets [19, 16] outperforming the original algorithm introduced in [15] by about two orders of magnitudes.
Apart from displaying EMs and MCSs directly in the interactive maps, CNA facilitates a detailed statistical assessment of large sets of MCSs and EMs. An important feature is the opportunity to select subsets of EMs or MCSs by specifying a set of criteria (e.g. "select all EMs involving reaction R1 but not R2"). Then, statistical properties can be calculated for the current selection and compared with other selections, useful e.g. to assess the importance of a reaction under different growth conditions. Such calculations include (relative) reaction participation, structural couplings, or optimal product yields.
Signalling and regulatory networks
CNA provides new algorithms designed for a functional analysis of signalflow networks (most of the implemented methods were detailed in [8]). Basically, each function operates either directly on the logical network model of the SFN or on the underlying interaction graph. The latter can be derived automatically from the logical hypergraph representation by splitting all the AND connections. For example, the reaction in eq. (2) would be decomposed into one positive (A→C) and one negative arc (B→C).
Interaction graphs
The main features of CNA for studying interaction graphs comprises the computation and analysis of:

general graphtheoretical network properties

signalling paths and feedback loops (circuits)

distance matrices capturing the lengths of the shortest negative/shortest positive path between all ordered pairs of species

the dependency matrix
General graphtheoretical properties that can be computed include the number of components, the network diameter and others. A more sophisticated feature is the computation of signalling paths and of the network's feedback loops (circuits). For example, one can compute all (directed) signalling paths connecting a species i with a species k each representing a path along which i can influence k. Feedback loops represent subnetworks along which a species k can influence itself (without visiting a node twice except k). They govern network dynamics and stability and are the driving force of fundamental physiological process such as differentiation, oscillations or homeostasis [20, 21]. A sign indicating a positive (even number of involved negative arcs) or negative (odd number) overall influence is assigned to each path and circuit.
For computing paths and circuits, CNA utilises the same algorithmic approach as for EMs in metabolic networks [8]. The only difference is that each path and circuit gets an overall sign. As for EMs in MFNs, paths and circuits can be displayed in the maps and statistically assessed (see Figure 4). Furthermore, again in close analogy to metabolic networks, MCSs interrupting e.g. a given set of feedback loops or/and paths can be computed. This feature can also be used to decompose a network into monotone dynamical subsystems in the sense as discussed in [22].
In very large networks, a full enumeration of paths and circuits becomes infeasible since the number of these objects depends exponentially on the network size. Instead of computing all paths and circuits, one may then focus on the shortest paths and shortest circuits, whose computation is much less expensive but still provides important functional insights. Shortest paths algorithms are wellknown from graph theory (e.g. Dijkstra algorithm [23]), however, interaction graphs are signed directed graphs and a special procedure is required for computing the length of the shortest positive and of the shortest negative path from a node i to a node k, denoted with P_{ik} and N_{ik}, respectively. Here we also allow i = k, i.e. P_{kk} and N_{kk} represent the length of the shortest positive/negative circuit involving k. Note that P_{ik} and N_{ik} are usually different (sometimes only one of both is finite) and the minimum of both gives the (unsigned) shortest path length. For example, in Figure 5(a), we have P_{ik} = 2, N_{ik} = 3, N_{kk} = 4 and P_{kk} = ∞ (no positive circuit running over k exists). In Figure 5(b), one arc has been removed implying N_{ik} = ∞ (a negative path from i to k does no longer exist, i.e. the length is infinite).
The importance of shortest positive/negative paths and circuits has been emphasised in [8], however an algorithmic scheme for computing them has neither been given in this reference nor could the authors find one in the literature. The algorithm implemented in CNA extends the Dijkstra algorithm and determines simultaneously P_{ik} and N_{ik} for all ordered pairs of nodes (i,k). Again, i = k is also considered, i.e. shortest positive/negative feedback circuits are computed concurrently. In the jth iteration, all the P_{ik} and N_{ik} of length j are identified using the shortest paths identified in iteration j1. For example, in Figure 5(a), in the 2^{nd} iteration, a path length of 2 would be found for N_{ib}, P_{ik}, N_{ak}, P_{bd}, P_{cd}, P_{ke}, N_{df}, N_{ek}, P_{fd}. Hereby it is important to keep track of the predecessor node p of k through which the shortest path (separately for positive and negative path) from i is running before reaching k. For example, in Figure 5(a), we would store node c for P_{ik}, node b for N_{ik}, node a for N_{ib} and so on. This information can be used to reconstruct, at the end, the determined shortest path from i to k (by travelling back from k to i along the predecessor nodes). Moreover, as a key feature of our algorithm, this information is required to check for each shortest path candidate (again, by travelling back along the predecessor nodes) that no circuit is contained. In usual shortest path algorithms, this can not happen but due to the parallel determination of P_{ik} and N_{ik} it may here. For example, in Figure 5(b), a positive path from i to k exists (P_{ik}= 2) and k is a node in a negative circuit. The algorithm finds first the positive path from i to k. Then it will further look for a negative path and while running through the negative circuit, it would find, in total, a negative walk from i to k which is, however, not a path in the graphtheoretical sense (k is visited twice) and has therefore to be discarded.
With the algorithm described above, all the shortest positive/negative paths and circuits can be computed efficiently in largescale networks (within seconds). They not only provide distance measures, but also show (i) whether any positive or/and negative path between a pair of nodes or (ii) whether any positive/negative circuit involving a certain species exists at all. For example, in Figure 2, there is a positive path from rec3 to tf2 and tf3 and no negative path to any of the sink nodes ("transcription factors") tf1, tf2, tf3. From rec2 all sink nodes can be reached via a positive path, and tf2 also along a negative one. Species c and d are the only ones involved in a (negative) feedback loop. Such relationships, classified for all pairs of nodes, are represented by CNA in the socalled dependency matrix [8] which reveals networkwide interdependencies (Figure 6 shows the dependency matrix displayed by CNA for the network in Figure 2). Each row of the dependency matrix characterises how the corresponding species influences the other nodes, whereas each column indicates how the corresponding species is influenced by the others. Intuitively, i is called an activator of k if P_{ik}<∞ and N_{ik} = ∞ (there are only positive paths from i to k) and marked as an inhibitor of k if P_{ik} = ∞ and N_{ik}<∞ (all paths from i to k are negative). More precisely, the dependency matrix as introduced in [8] characterises for each ordered pair of nodes (i,k) the effect of i on k by one of the 6 following cases (D_{ik} denotes the distance between i and k, i.e. the minimum of P_{ik} and N_{ik}):

i has no effect on k if P_{ik}= N_{ik} = ∞, i.e. D_{ik} = ∞ and there is no path from i to k (example: rec3 has no effect on tf1 in Figure 2)

i is a strong (or total) activator of k if P_{ik}<∞ and N_{ik} = ∞ and there is no node z such that D_{iz}<∞ and D_{zk}<∞ and N_{zz}<∞ (example: rec3 is a strong activator of tf2 and tf3)

i is a weak (or nontotal) activator of k if P_{ik}<∞ and N_{ik} = ∞ and there is a node z such that D_{iz}<∞ and D_{zk}<∞ and N_{zz}<∞ (example: rec2 is a weak activator of tf1)

i is a strong (or total) inhibitor of k if P_{ik} = ∞ and N_{ik}<∞ and there is no node z such that D_{iz}<∞ and D_{zk}<∞ and N_{zz}<∞ (example: rec2 is a strong inhibitor for a)

i is a weak (or nontotal) inhibitor of k if P_{ik} = ∞ and N_{ik}<∞ and there is a node z such that D_{iz}<∞ and D_{zk}<∞ and N_{zz}<∞ (example: rec1 is a weak inhibitor of tf1)

i is an ambivalent factor for k if P_{ik}<∞ and N_{ik}<∞ (example: rec2 is an ambivalent factor for tf2)
The global dependencies collected in the dependency matrix facilitate valuable qualitative predictions about the effects of perturbation or knockout experiments [8]. For example, the effect of strong activators and strong inhibitors is strictly monotone. Thus, starting from a resting state, increasing the level of (active) rec3 should lead to an increase in the activation level of tf2 and tf3 since rec3 is a strong activator of tf2 and tf3. In contrast, it should have no effect on tf1 since there is no connection from rec3 to tf1. Predictions on the effects of weak activators and weak inhibitors are more limited due to the involvement of negative feedback loops, however, we can at least predict that there exists a time window (of unknown length) where the affected species can only increase (weak activators) or decrease (weak inhibitors) after a (positive) perturbation. Only for ambivalent factors nothing at all can be said regarding perturbation effects since then positive and negative influence paths are competing and the overall effect will depend on kinetic parameters and concentrations.
Note that this type of analysis is related to the theory on monotone systems and the notion of consistent graphs [24, 22].
In general, when computing (all or shortest) paths and feedback loops, CNA allows the user to exclude nodes or edges for testing knockouts effects.
Logical networks
Boolean or logical networks have been extensively used for modelling small or mediumscale (gene) regulatory networks, typically characterised by having few (or no) inputs but many feedback circuits [20, 25–28]. Main aspects that have been studied focus on the discrete dynamics of the system including its attractors, global stability, and the potential transition paths. GINsim, a recently developed software tool, supports this type of analyses [28]. Although the functions provided by CNA for logical network analysis are in principle applicable to gene regulatory networks, they are especially useful in networks which are structured in input, intermediate, and output layer as typical in signal transduction networks [8]. Logical analysis in CNA aims to a characterisation of the input/output behaviour of the system and to search for interventions that can change the natural behaviour into a desired one:
(1) Logical steady states
CNA computes the logical steady state that follows from a userdefined scenario (consisting of a set of input stimuli, e.g. receptor X is activated and receptor Y not). This functionality enables to study how signals are propagated through the network and how a network responses to certain stimuli [8]. Again, the user may fix some signal flows or states (off/on) mimicking deactivation (e.g. by inhibitors or knockouts) or permanent activation, respectively. In Figure 2, such a scenario is displayed: receptors rec1 and rec3 were considered to be activated and rec2 not. The logical steady state was then computed showing the response of the network elements to this activation pattern.
Note that, sometimes, the logical steady state resulting from a given input pattern may be not unique for all nodes or a logical steady state does even not exist [8]. In such a case, CNA will indicate for which compounds a unique logical steady state can not be determined.
(2) Minimal intervention sets
CNA provides a complex routine for computing (logical) minimal intervention sets (MISs; [8]). Similar to MCSs in metabolic networks, a MIS is a minimal set of interventions by which a userdefined intervention goal (e.g. the permanent activation/deactivation of certain compounds) will be satisfied. The user may define (i) an intervention goal by setting desired on/off values for the respective states and signal flows and (ii) a scenario (e.g. a pattern of inputs) to which the network is exposed. CNA searches then for combinations of interventions so that the resulting logical steady state will satisfy the intervention goal. In contrast to minimal cut sets, an intervention may represent not only the permanent deactivation (knockout) but also a permanent activation (e.g. knockin mutation) of a compound.
To illustrate the concept of MISs consider Figure 2: assume we want to have transcription factors tf1 inactivated and tf2 activated (and don't care about tf3). In total, there are 21 MISs. One example is {rec1 = 1, rec2 = 0, rec3 = 1} which indicates (the only) set of input stimuli that would satisfy the intervention goal. Another one is {a = 1, rec2 = 1}, where a and rec2 are permanently hold in an active state (e.g. by knockin mutation). Here, the inputs at rec1 and rec3 are irrelevant for achieving the intervention goal.
For computing MISs, CNA uses an almost bruteforce approach, since it checks systematically all minimal combinations of interventions (first of size 1, then size 2 and so on) whether they lead to a fulfilment of the intervention goal when the network reaches the logical steady state. However, some important heuristics are exploited. For example, only those species are subject to interventions that have an influence on compounds being part of the intervention goal (can be checked quickly via the dependency matrix). As one is typically interested in the (small) MISs with only few interventions and because the computation of MISs with higher cardinality is the most timeconsuming part, CNA allows to set a maximum cardinality.
MISs can be displayed in the maps and assessed statistically. As outlined in [8] and demonstrated in [10], MISs provide a powerful tool for analysing signalling networks. Some applications are:
(i) searching for intervention strategies for repressing/provoking certain behaviours.
(ii) identifying fragile points in the network and estimating the importance of network elements for different functions (example: activated b is mandatory for getting tf2 and tf3 activated in the network in Figure 2)
(iii) identifying failure modes which might cause an observed abnormal (pathological) behaviour of the network (example (Figure 2): if tf1 is on and tf2 off in experiments under all possible combinations of input stimuli then a failure (e.g. caused by a mutation) in node c is likely since {c = 0} is a MISs for the intervention goal tf1 = on and tf2 = off)
(iv) searching for candidates of missing links in the network by which experimental data not consistent with the current network model could be explained (for examples see [10])
Additional features
A number of features, most of them available for both types of network projects, make work with CNA easier. Scenarios, e.g. representing flux distributions or a set of logical states and signal flows, can be saved and then later reloaded. A clipboard enables to store the currently displayed scenario temporarily in memory; it can be pasted back afterwards or compared with other scenarios. The size, contextdependent colours and visibility of the text boxes (see Figures 2, 3, 4) are definable by the user. Massflow networks may be exported in ASCII (plain text) format (stoichiometric matrix, names of species and reactions) as well as imported and exported in SBML format. In signalflow networks, the interaction/incidence matrix and names of species and reactions can be exported in ASCII format. Note that exchange of logical models is not supported (yet) by SBML.
Integrating signalflow and massflow networks
An important issue towards a holistic analysis of cellular networks is network integration, i.e. to facilitate the analysis of networks with mass and signal flows in one coherent topological model. This would enable to relate events in the metabolism with events in signaling and regulatory networks. The key question is how to design conceptually the interface for connecting signal flows with mass flows and vice versa. Some approaches have been proposed in the literature. Covert et al. [28] connected a regulatory network, controlling the activity of some metabolic pathways, with a metabolic network model. The regulatory network, hierarchically on top of the metabolic model, was represented as a Boolean network whose inputs are the external conditions (e.g. substrate and oxygen availability) and whose outputs are the reactions to be switched on or off in the metabolic (stoichiometric) network model. This type of modelling is possible in CNA and requires only one intermediate step: the regulatory (as SFN) and the metabolic network (as MFN) are represented in two separate models. The inputs of the regulatory network are the environmental conditions and the outputs of the regulatory network are the states (on/off) of the reactions in the metabolic network. Defining a given set of stimuli in the regulatory model will result in a corresponding logical steady state. Then, one exports the reactions with state 0 (with "Save scenario"). By using the same reaction identifiers in the metabolic model, this scenario can be loaded showing all the reactions in the metabolic network which have been switched off (all others are potentially available). Then, calculations such as elementary modes or optimal flux distributions can be conducted.
Though this approach is useful for a number of applications, it is unidirectional and is not able to close the loop, i.e. to account for the different kinds of interactions going from the metabolic network back to the regulatory or signalling part.
A quite different approach for connecting massflow with signalflow networks, relying on interaction graphs, has been introduced recently [30]. At least some of the techniques proposed in this work can already be employed with CNA in a straightforward manner by using the functions provided for interaction graphs. Furthermore, in [31] another method was introduced called "network expansion" which relies on a Boolean description of metabolic networks and might have the potential to integrate also signalling networks. Again, this approach is already supported by CNA since network expansion relies on computing logical steady states in Boolean networks [8].
In our opinion, all of the above mentioned approaches enable the analysis of specific features of integrated massflow/signal flow networks but seem not yet general enough to consider all of the potential types of interactions that may occur. Accordingly, conceiving a more general conceptual framework for combining signal and mass flows and implementing it in CNA is a major aspect of our future work.
Conclusion
An increasing number of software tools is available for Systems Biology (see e.g. [32]). Some of them are devoted to topological or qualitative analysis of cellular networks, including Metatool [17] for metabolic and GINsim [28] for gene regulatory networks.CellNetAnalyzer is a single suite to perform structural and functional analysis of both massflow and signalflowbased cellular networks in a userfriendly environment. CNA exploits that stoichiometric networks, (interaction) graphs and logical networks can all be represented internally as hypergraphs, albeit the methods for analysing these networks have then to be chosen according to the type of flows that are carried by the reactions (i.e. by the hyperarcs). CNA offers a comprehensive toolbox with various, partially unique, functionalities and algorithms for analysing both types of networks. CNA (and its predecessor FluxAnalyzer) has been downloaded by more than 600 independent researchers worldwide. Recently, the new functions for signalflow networks have been successfully applied to a largescale logical model of signalling pathways involved in Tcell activation [10], comprising 94 compounds and 123 interactions. Using the methods implemented in CNA, this model was able to provide deeper insights in the functioning of the signalling network governing Tcell activation and to unravel important and previously unknown aspects of this complicated process.
Availability and Requirements
CellNetAnalyzer requires MATLAB^{®} version 6.1 or higher. For a few calculations, the MATLAB Optimisation toolbox is required.
For academic purposes,CellNetAnalyzer including its manual can be obtained for free via the website
http://www.mpimagdeburg.mpg.de/projects/cna/cna.html
Commercial licenses are available for nonacademic users.
Abbreviations
 CNA:

CellNetAnalyzer
 MFNs:

massflow networks
 SFNs:

signalflow networks
 EMs:

elementary modes
 MCSs:

minimal cut sets
 MISs:

minimal intervention sets
References
 1.
Alon U, Surette MG, Barkai N, Leibler S: Robustness in bacterial chemotaxis. Nature. 1999, 397: 168171. 10.1038/16483.
 2.
Wiley HS, Shvartsman SY, Lauffenburger DA: Computational modeling of the EGFreceptor system: a paradigm for systems biology. Trends Cell Biol. 2003, 13: 4350. 10.1016/S09628924(02)000090.
 3.
Bornholdt S: Systems Biology: Less is more in modelling large genetic networks. Science. 2005, 310: 449451. 10.1126/science.1119959.
 4.
Price ND, Reed JL, Palsson BO: Genomescale models of microbial cells: evaluating the consequences of constraints. Nat Rev Microbiol. 2004, 2: 886897. 10.1038/nrmicro1023.
 5.
Klamt S, Stelling J: Stoichiometric and constraintbased modeling. System Modeling in Cellular Biology: From Concepts to Nuts and Bolts. Edited by: Szallasi Z, Periwal V, Stelling J. 2006, Cambridge, MIT Press, 7396.
 6.
Papin JA, Hunter T, Palsson BO, Subramaniam S: Reconstruction of cellular signalling networks and analysis of their properties. Nat Rev Mol Cell Biol. 2005, 6: 99111. 10.1038/nrm1570.
 7.
Klamt S, Stelling J, Ginkel M, Gilles ED: FluxAnalyzer: exploring structure, pathways, and flux distributions in metabolic networks on interactive flux maps. Bioinformatics. 2003, 19: 261269. 10.1093/bioinformatics/19.2.261.
 8.
Klamt S, SaezRodriguez J, Lindquist JA, Simeoni L, Gilles ED: A methodology for the structural and functional analysis of signaling and regulatory networks. BMC Bioinformatics. 2006, 7: 5610.1186/14712105756.
 9.
Stelling J, Klamt S, Bettenbrock K, Schuster S, Gilles ED: Metabolic network structure determines key aspects of functionality and regulation. Nature. 2002, 420: 190193. 10.1038/nature01166.
 10.
SaezRodriguez J, Simeoni L, Lindquist JA, Hemenway R, Bommhardt U, Arndt B, Haus U, Weismantel R, Gilles ED, Klamt S, Schraven B: A comprehensive logical model predicts key events in the Tcell signaling network. 2006, Submitted
 11.
SaezRodriguez J, Mirschel S, Hemenway R, Klamt S, Gilles ED, Ginkel M: Visual setup of logical models of signaling and regulatory networks with ProMoT. BMC Bioinformatics. 2006, 7: 50610.1186/147121057506.
 12.
Ginkel M, Kremling A, Nutsch T, Rehner R, Gilles ED: Modular modeling of cellular systems with ProMoT/Diva. Bioinformatics. 2003, 19: 11691176. 10.1093/bioinformatics/btg128.
 13.
 14.
Schuster S, Fell DA, Dandekar T: A general definition of metabolic pathways useful for systematic organization and analysis of complex metabolic networks. Nat Biotechnol. 2000, 18: 326332. 10.1038/73786.
 15.
Klamt S, Gilles ED: Minimal cut sets in biochemical reaction networks. Bioinformatics. 2004, 20: 226234. 10.1093/bioinformatics/btg395.
 16.
Klamt S: Generalized concept of minimal cut sets in biochemical networks. Biosystems. 2006, 83: 233247. 10.1016/j.biosystems.2005.04.009.
 17.
Klamt S, Gagneur J, von Kamp A: Algorithmic approaches for computing elementary modes in large biochemical reaction networks. IEE Systems Biology. 2005, 152: 249255. 10.1049/ipsyb:20050035.
 18.
von Kamp A, Schuster S: Metatool 5.0: fast and flexible elementary modes analysis. Bioinformatics. 2006, 22: 19201931. 10.1093/bioinformatics/btl267.
 19.
Kavvadias DJ, Stavropoulos EC: An efficient algorithm for the transversal hypergraph generation. Journal of Graph Algorithms and Applications. 2005, 9: 239264.
 20.
Thomas R, D'Ari R: Biological feedbacke. 1990, Boca Raton, CRC Press
 21.
Cinquin O, Demongeot J: Positive and negative feedback: striking a balance between necessary antagonists. J Theor Biol. 2002, 216: 229241. 10.1006/jtbi.2002.2544.
 22.
DasGupta B, Enciso GA, Sontag E, Zhang Y: Algorithmic and complexity results for decompositions of biological networks into monotone subsystems. Biosystems. 2006.
 23.
Cormen TH, Leiserson CE, Rivest RL, Stein C: Introduction to Algorithms. 2001, MIT Press and McGrawHill, Second
 24.
Sontag ED: Molecular Systems Biology and Control. European Journal of Control. 2005, 11: 396435.
 25.
Kauffman SA: Metabolic stability and epigenesis in randomly constructed genetic nets. J Theor Biol. 1969, 22: 437467. 10.1016/00225193(69)900150.
 26.
Mendoza L, Thieffry D, AlvarezBuylla ER: Genetic control of flower morphogenesis in Arabidopsis thaliana: a logical analysis. Bioinformatics. 1999, 15: 593606. 10.1093/bioinformatics/15.7.593.
 27.
de Jong H: Modeling and simulation of genetic regulatory systems: a literature overview. J Comp Biol. 2002, 9: 67103. 10.1089/10665270252833208.
 28.
Gonzalez AG, Naldi A, Sanchez L, Thieffry D, Chaouiya C: GINsim: a software suite for the qualitative modelling, simulation and analysis of regulatory networks. Biosystems. 2006, 84: 91100. 10.1016/j.biosystems.2005.10.003.
 29.
Covert MW, Schilling CH, Palsson BO: Regulation of gene expression in flux balance models of metabolism. J Theor Biol. 2001, 213: 7388. 10.1006/jtbi.2001.2405.
 30.
Yeang CH, Vingron M: A joint model of regulatory and metabolic networks. BMC Bioinformatics. 2006, 7: 33210.1186/147121057332.
 31.
Ebenhöh O, Handorf T, Heinrich R: Structural analysis of expanding metabolic networks. Genome Inform. 2004, 15: 3545.
 32.
SBML. [http://www.sbml.org]
Acknowledgements
The authors thank support of the German Ministry of Research and Education (HepatoSys), the German Research Society (FOR521), and the Ministry of Education of SaxonyAnhalt (Research Focus Dynamical Systems). SK thanks Marcin Imielinski for drawing the attention to the Berge algorithm for computing minimal cut sets.
Author information
Affiliations
Corresponding author
Additional information
Authors' contributions
SK developed CellNetAnalyzer and conceived and implemented the algorithms. JSR tested and applied CellNetAnalyzer and gave proposals for new features. EDG gave suggestions for improvements of CNA. All authors read and approved the final manuscript.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Klamt, S., SaezRodriguez, J. & Gilles, E.D. Structural and functional analysis of cellular networks with CellNetAnalyzer. BMC Syst Biol 1, 2 (2007). https://0doiorg.brum.beds.ac.uk/10.1186/1752050912
Received:
Accepted:
Published:
DOI: https://0doiorg.brum.beds.ac.uk/10.1186/1752050912
Keywords
 Boolean Function
 Metabolic Network
 Cellular Network
 Boolean Network
 Logical Network