Article
Mass Conservation and Inference of Metabolic Networks from HighThroughput Mass Spectrometry Data
Center for Computational Biology and Bioinformatics, Joint Centers for Systems Biology, and Columbia Initiative in Systems Biology, Columbia University, New York, New York, USA.
Journal of computational biology: a journal of computational molecular cell biology (Impact Factor: 1.74). 02/2011; 18(2):14754. DOI: 10.1089/cmb.2010.0222 Source: PubMed
Get notified about updates to this publication Follow publication 
Fulltext
Available from: Ilya NemenmanMass Conservation and Inference of Metabolic Networks
from HighThroughput Mass Spectrometry Data
Pradeep Bandaru
1,2
, Mukesh Bansal
1
, and Ilya Nemenman
3*
1
Center for Computational Biology and Bioinformatics, Joint Centers for Systems Biology, and
Columbia Initiative in Systems Biology,
2
Department of Biomedical Informatics, Columbia
University, New York, NY 10032, USA
3
Departments of Physics and Biology and Computational and Life Sciences Strategic Initiative,
Emory University, Atlanta, GA 30322
*
Contact: ilya.nemenman@emory.edu
Page 1
2
Abstract
We present a step towards the metabolomewide computational inference of cellular
metabolic reaction networks from metabolic profiling data, such as mass spectrometry. The
reconstruction is based on identification of irreducible statistical interactions among the
metabolite activities using the ARACNE reverseengineering algorithm and on constraining
possible metabolic transformations to satisfy the conservation of mass. The resulting algorithms
are validated on synthetic data from an abridged computational model of Escherichia coli
metabolism. Precision rates upwards of 50% are routinely observed for identification of full
metabolic reactions, and recalls upwards of 20% are also seen.
.
Page 2
3
Introduction
Prior to the widespread availability of annotated metabolic databases, metabolic network
reconstruction was carried out primarily with biochemical assays of enzymatic activity (13)
.
,
resulting in a pathwaycentric depiction of chemical reactions occurring in a cell. For some
organisms, it has been possible to assemble these data into genomewide metabolic networks by
means of various Metabolic Flux Analysis (MFA) techniques (49). Now, recent developments
in the burgeoning field of metabolic profiling (1012) and especially massspectrometry
metabolomics (1317), which aims at highthroughput, realtime characterization of the entire
cellular metabolic state, have opened up yet another way of approaching the metabolic network
reconstruction problem, focusing on statistical interactions among metabolites. This parallels the
transition that had happened in the analysis of transcriptional regulatory networks with the
advent of gene expression profiling (1822), which similarly characterizes the genomewide
transcriptional state of the cell.
Specifically, distinct cellular phenotypes, phases of the cell cycle, or intrinsic and
extrinsic perturbations result in changes in cellular metabolite concentrations. However, even
with such changes, concentrations of metabolites that transform into each other should stay
correlated, and the observed dependencies can be used to predict metabolic reactions
computationally even if the identities of the metabolites are unknown, preventing the application
of MFA methods. We attempted this approach (23) using the ARACNE statistical reverse
engineering method, first developed in the context of inferring transcriptional networks from
mRNA expression profiles (19, 24, 25). However, massspectrometry methods provide a wealth
of information about the metabolites in addition to their abundances: MSMS methods and
isotopic labeling (1317) can recover the molecular structure, and, especially crucial for this
Page 3
4
paper, masses of metabolites are typically measured to the accuracy of
10
4
K 10
5
. Since mass
must be conserved in any metabolic transformation, this information presents an additional
source of data for reverse engineering methods that has not been widely used. Namely, a
statistical dependence among metabolites can indicate an actual metabolic transformation only if
the putative chemical reaction constructed from these metabolites conserves mass. This rule can
be applied even when identities of metabolites are unknown and, therefore, it is especially useful
for highthroughput global metabolic profiling where spectral peaks cannot necessarily be
identified.
In this paper, we present a MassConstrained adaptation of the ARACNE algorithm,
ARACNEMC, which should be considered as a first foray into the field, laying the foundation
for future studies. Note that, in the case of metabolism, we are not content with knowing just the
statistical dependencies among the metabolites, even if they correspond to bonafide metabolic
transformations. Instead we aim at a substantially more complicated task of reconstructing
complete metabolic reactions, identifying all of their substrates and products.
We test the algorithm on reduced toy models of the Escherichia coli metabolome with in
silico simulated metabolic profiles. Applications to realworld biological problems will have to
wait for larger experimental datasets.
Results
Outlines of the algorithms
The ARACNE Algorithm
The basis of the reverse engineering approach we undertake is the notion that molecular
species that participate in biochemical reactions have statistically dependent expressions (23).
Within the ARACNE framework (24, 25), one views metabolite expressions as random variables
Page 4
5
sampled from stationary probability distributions. This randomness accounts for effects of
unknown states of unobserved metabolites and other chemical species and of the experimental
noise. Chemical transformations correspond to nonzero multivariate statistical dependencies
among metabolite concentrations (26). In particular, the relevant measure of statistical
dependency between two variables
c
1
,c
2
is their mutual information (MI) (27)
I c
1
;c
2
log
2
P c
1
,c
2
P c
1
P c
2
P c
1
,c
2
, (1)
where
P c
1
, c
2
denotes their joint probability distribution,
P c
i
are the marginals, and
P
is
the average over the distribution
P
.
The MI is generally nonzero for bona fide interacting metabolites, but it may also be
nonzero for chemicals that are connected through an intermediate and do not transform into each
other directly. In fact such false positives are generally a bigger problem than false negatives
(i.e., missing a true interaction) in computational networks reverse engineering: false positives
are plentiful and lower the confidence in the validity of every specific prediction.
The ARACNE algorithm (24, 25) eliminates some of the false positives by using the data
processing inequality (DPI) (27) to isolate statistical interactions that have the highest chance of
corresponding to true biological transformations. Specifically, under certain assumptions that are
often applicable in transcriptional (24) and metabolic (23) contexts, if
I c
1
;c
3
min I c
1
;c
2
, I c
2
;c
3
(2)
then the
c
1
c
3
interaction is indirect. Hence ARACNE starts with a fully connected graph of
the measured chemical species as putative interaction partners, compares MIs for every triplet of
chemical species in the dataset, and removes the weakest pairwise interaction in every such
triplet from further consideration. Practical complications in the application of ARACNE revolve
Page 5
6
around accurate, unbiased estimation of MI and of the threshold (515% for typical applications)
above which a difference between two MI values becomes significant for the DPI application
(19, 24). Though developed for reverse engineering transcriptional networks, ARACNE has also
been validated in the context of synthetic metabolic networks (23).
The ARACNEMC Algorithm
As we have emphasized, massspectrometry provides additional information about the
metabolic state of a cell, namely, masses of the metabolites. This creates extra means for
eliminating false positive metabolic transformations: even if statistical dependencies suggest an
interaction, the implied putative chemical reaction may not conserve mass and hence be
impossible. To use this additional constraint, we propose the ARACNEMC algorithm (MC
stands for Mass Constrained). Like the original ARACNE, ARACNEMC aims at reducing false
positives, potentially at the cost of increasing the false negatives.
For a list of metabolites
a
with masses
m
a
and metabolic activities in
i
’th spectrometer
run
c
ai
, we start by building a list of putative metabolic reactions allowed by mass conservation,
focusing on a limited set of template reactions that are allowed in the analysis. In this paper, we
consider only three templates (a) 1x1,
l
1
r
2
; (b) 1x2,
l
1
r
1
r
2
; and (c) 2x2,
l
1
l
2
r
1
r
2
(indexes
l
and
r
stand for left and right, respectively). See Fig. 1 for
example reactions of each template. Eliminating more complicated reactions from consideration
will result in the elimination of bona fide statistical interactions, and hence in extra false
negatives, which we accept. We build a list of all putative reactions that fall into the allowed
template classes and satisfy the mass conservation,
m
l
i
m
r
i
m
l
i
, where
is the
mass equality tolerance, set to
10
4
throughout this paper. We refer to such reactions as
Page 6
7
conforming reactions. Identifying them has a computational complexity of
O(M
)
, where
is
the maximum number of metabolites on either side of the template (2 in this paper).
While possible in principle, a conforming reaction may not exist in a real cell due to a
multitude of factors. If present, it should result in statistical dependencies among its reactants and
products. There will be up to one such dependence for a 1x1 reaction (two choose two), three for
a 1x2 reaction (three choose two), and six for a 2x2 reaction (four choose two). Therefore, we
prune the list of conforming reactions by identifying those that are supported by statistical
dependencies. To do so, we apply ARACNE to metabolite activity profiles,
c
ai
. Specifically, we
estimate the pairwise MIs
I c
a
,c
b
using the algorithms of (19) and then apply the DPI to the list
of MIs to select the interactions that have the highest chance of being direct. Then the
conforming reactions are ranked by how many of their pairwise member metabolite interactions
are identified as direct by ARACNE. We expect that reactions that are conforming and supported
statistically will have a high chance to be bona fide metabolic reactions. The ARACNEMC1
algorithm thus requires selection of the threshold for the number of ARACNEsupported
metabolite pairwise interactions, and identifies all of the conforming reactions passing the
threshold as putative reactions.
We notice that the same metabolic statistical interaction may be a part of multiple
reactions. One “strong” reaction may be responsible for much of the MI associated with a
particular link, and thus for the corresponding interaction surviving the ARACNE DPI
application. However, ARACNEMC1 would count this interaction in support of every
conforming reaction to which it belongs. To avoid this multiple counting, we sort all conforming
reactions by their “strength” as measured by the cumulative mutual information in all of its
Page 7
8
interactions. We then ensure that an interaction is counted as supporting only the strongest of its
associated reactions; this is the ARACNEMC2 algorithm.
Flowcharts of both algorithms are illustrated in Fig 2.
The algorithms, implemented in MATLAB, are available at
http://menem.com/~ilya/wiki/index.php/Bandaru_et_al,_2010. The performance of the
algorithms will depend on a variety of choices, such as the DPI and mass comparison tolerances,
MI estimation parameters, or thresholds for the number of interaction supports needed to
proclaim a reaction as existing. Some of these choices are explored later in the paper. For others,
which we believe may differ dramatically for synthetic and for experimental data, we leave the
detailed analysis to future publications.
Synthetic Tests of ARACNEMC
Data Generation and Performance Metrics
To validate performance of ARACNEMC, we used the Kyoto Encyclopedia of Genes
and Genomes (KEGG) (31) to create synthetic metabolic networks, which then served as a
source of simulated data for tests. KEGG provides a detailed description of metabolites and
reactions found in the metabolic pathways of various model organisms. The entirety of the
metabolic pathways of Escherichia coli were downloaded and pruned to include only mass
balanced reactions of the three types shown in Figure 1. Two different synthetic networks were
constructed to test the performance of ARACNEMC on metabolic networks of different sizes: a
small network, containing 86 unique metabolites and 50 metabolic reactions, and a large
network with 218 metabolites and 136 reactions. Detailed specifications of the networks are
available at http://menem.com/~ilya/wiki/index.php/Publications/Bandaru_et_al.,_2010.
Page 8
9
Since a majority of kinetic rates are unknown in KEGG, for each of the reactions we
randomly generated forward and backward rates, with the forward to backward ratio being, on
average, a hundred. We used the opensource COPASI software (28) to simulate the dynamics of
the network multiple times, perturbing the kinetic rates each time by a random multiplicative
factor with a standard deviation of 15%. This is similar to the approach in (24) and is supposed
to represent changes to the rates due to different extracellular environments and phenotypic and
metabolic states of the cells. Each simulation started with equal metabolite concentrations of
1uM and was run to a steady state. One thousand steady states were simulated this way and used
as synthetic metabolic profiles for input to ARACNEMC.
To measure the algorithm performance, we choose the metrics of precision and recall.,
Precision,
N
TP
/ N
TP
N
FP
, measures the fraction of true predictions among all predictions
(where indices
T , F, P, and N
stand for true, false, positives, and negatives). Precision
corresponds to the expected success rate in the experimental validation of computational
predictions. Similarly, recall,
N
TP
/ N
TP
N
FN
, indicates the fraction of all reactions
recovered by the algorithm. Precision and recall values of 1 indicate perfect performance.
However, there is generally a tradeoff between the two. We emphasize that all of these metrics
are calculated based on recovery of complete metabolic reactions, rather than simple statistical
correlations among the metabolites, as in (23).
ARACNEMC Performance
We performed two tests to verify that accurate knowledge of both the metabolite profiles
and the mass constraints is necessary for ARACNEMC1 and 2 performance. Firstly, we
randomized entries in the massconforming reactions while leaving the statistical relations intact.
Secondly, we randomized metabolic profiles while preserving the correct mass constraints. In
Page 9
10
both cases, ARACNEMC1 and 2 failed to predict metabolic reactions beyond chance, indicating
an equal reliance on the two types of data (results not shown).
Table 1 details the results from the ARACNEMC1 algorithm in the reconstruction of the
large (218 metabolites) and small (86 metabolites) synthetic networks. Precisions well over 50%
with significant recall rates are seen for many parameter combinations. The results suggest that
the ARACNE algorithm is robust to changes in network size and topology. We emphasize again
that, for our performance metrics, all substrates and products of a reaction must be predicted
correctly for the reaction to be counted as correct. This is a very stringent performance test.
Performance of ARACNEMC2 is illustrated in Table 2. We see that removing double
counting of interactions has an effect of increasing the precision (sometimes to the maximum
level of 1) with only a marginal loss in the recall.
To illustrate the dependence of the ARACNEMC reconstruction on the DPI tolerance
parameter, Table 3 shows performance of ARACNEMC1 for the tolerance of 1 (i.e., no DPI
applied). While performance is weaker compared to the tolerance of 0, the effect is not dramatic,
suggesting weak sensitivity to the parameters. The specific best value of the parameter will likely
depend on the size of the dataset and on the experimental noise, and will need to be established
for each particular application independently as in (29)
Finally, a crucial feature of any computational reverse engineering algorithm is the
dependence of its performance on the size of the experimental dataset. We test this for
ARACNEMC2 in Table 4. Specifically, both the precision and the recall degrade gracefully as
the data set size decreases from 1000 to 100, and no meaningful reconstruction is possible when
the size becomes comparable to the number of the analyzed metabolic species. This explains, in
particular, why our application of the algorithms to the existing experimental data set of Ishii, et
Page 10
11
al. (17), which includes approximately 30 steadystate metabolic profiles of Escherichia coli and
195 metabolites in each profile, has failed.
Discussion
The ARACNEMC1 and 2 algorithms represent the first computational step towards
identification of metabolic reaction networks from highthroughput massspectrometry profile
data, armed with detailed knowledge of metabolite masses. Performance of the algorithm on
synthetic data sets is encouraging, warranting further development and application to reallife
data sets, when available. Selection of optimal values of many parameters of the algorithm,
which we expect to depend on the details of the experimental data, will need to be performed at
that time. Further, depending on the experimental resolution for many small, common
metabolites, additional modifications of ARACNEMC will need to be considered. In particular,
to reduce the rate of false negatives, frequent interactions among common substrates (ATP,
water, NADP, etc.) can be treated as supported statistically for every conforming reaction.
As implemented now, the algorithm is dataintensive, requiring more metabolic profiles
than the number of considered metabolites. Current absence of such large datasets is the biggest
obstacle in application of the algorithm to realworld problems. However, we expect that ion
mobility mass spectrometry with nanoliter chemostat cultures (30) will be able to provide the
necessary amounts of data in the immediate future.
Page 11
12
Methods
Synthetic Networks Generation
Synthetic metabolic networks were created from the KEGG database. Using Escherichia
coli as a model system for these synthetic networks, we downloaded massbalanced reactions
randomly, so that the final analyzed network is representative of the metabolism of E. coli. A
small synthetic network containing 86 unique metabolites and 50 metabolic reactions and a large
synthetic network containing 218 metabolites and 136 metabolic reactions were generated. See
the appendices for detailed descriptions of the metabolites in each network and their
corresponding masses.
Analysis and Simulation Parameters
Two main parameters of ARACNE algorithm are the pvalue for accepting an MI
estimate as nonzero and the DPI tolerance threshold. For the purposes of this study, the DPI
tolerance was varied between 1 (no DPI application) and 0 (stringent edge elimination), and the
pvalue threshold was set to the default level of 1e4. Additionally, the mass comparison relative
tolerance was 1e4.
Acknowledgements
We especially thank Andrea Califano, who has been an invaluable help in the early stages
of this research. We also thank William Hlavacek, Fangping Mu, Joel Berendzen, and
Manjunath Kustagi for important contributions. PB and IN were partially supported by
NIH/NIGMS under 1R21GM080216.
Page 12
13
Figure 1. Examples of three types of metabolic reactions included in the synthetic network and
generated by the mass constraints algorithm. Type 1 reactions are termed twobytwo reactions,
Type 2a and 2b reactions are termed onebytwo reactions, and Type 3 reactions are termed one
byone reactions. Chemical structures from KEGG are provided for illustration.
Page 13
14
Figure 2. Flowchart of the ARACNEMC algorithm.
Page 14
15
Template
ARACNE
Interactions
TP
FP
Precision
Recall
1x1
1
1/0/15
4/0/11
0.20/0/0.58
0.50/0/0.71
2x1
3
2/7/6
1/8/10
0.67/0.47/0.38
0.11/0.37/0.16
2
6/14/20
2/17/33
0.75/0.45/0.38
0.32/0.74/0.53
2x2
6
0/5/9
0/21/2
0/0.19/0.82
0/0.17/0.12
5
1/10/14
3/31/2
0.25/0.24/0.88
0.03/0.34/0.18
4
4/18/20
6/98/29
0.40/0.16/0.41
0.14/0.62/0.26
3
12/23/48
28/369/355
0.30/0.06/0.12
0.41/0.79/0.62
2
21/28/61
227/969/77
0.08/0.03/0.02
0.72/0.97/0.79
Table 1: Performance of ARACNEMC1 for different networks and DPI tolerances. The first
value in each cell in the four right columns corresponds to the small networks with zero
tolerance; the second value is for the small network with the tolerance of one, and the third value
is for the large network. All data is for 1000 simulated metabolic profiles. When the DPI
tolerance is 0, precisions over 80% are possible with recalls in the teens when large ARACNE
support for a conforming reaction is requested, and recall of 2550% still leaves the precision
around 40%.
Template
ARACNE
Interactions
Surviving ARACNE
Interactions
TP
FP
Precision
Recall
Page 15
16
1x1
1
N/A
0/0
0/0
0/0
0/0
2x1
3
3
1/3
0/0
1/1
0/05/0/08
2
2/6
0/0
1/1
0.11/0.16
1
2/6
0/0
1/1
0.11/0.16
2
2
1/5
0/0
1/1
0.05/0.13
1
3/12
0/0
1/1
0.16/0.32
2x2
6
6
0/5
0/2
0/0.71
0/0.06
5
0/9
0/2
0/0.82
0/0.12
5
5
0/14
0/2
0/0.88
0/0.28
4
0/14
0/2
0/0.88
0/0.28
3
0/14
0/2
0/0.88
0/0.28
4
4
3/12
7/14
0.43/0.46
0.1/0.16
3
4/19
9/16
0.44/0.54
0.14/0.25
2
4/20
10/18
0.4/0.53
0.14/0.26
3
3
8/21
17/40
0.47/0.34
0.28/0.27
2
10/35
28/62
0.36/0.36
0.35/0.45
1
10/38
34/91
0.29/0.29
0.35/0.49
2
2
10/22
66/178
0.15/0.11
0.34/0.29
1
13/41
113/305
0.12/0.12
0.45/0.53
Table 2. Performance of ARACNEMC2 for the small and the large networks. The DPI
tolerance is 0.
2x1/3/2
2x2/4/3
Page 16
17
Number of
Samples
Precision
Recall
Precision
Recall
1000
1
0.16
0.54
0.25
500
1
0.13
0.58
0.25
250
1
0.13
0.43
0.19
100
1
0.03
0
0
Table 3: Precision and recall results for selected reaction template / ARACNE supports /
surviving ARACNE supports from the large network against a varying number of input
metabolic profiles using the ARACNEMC2 algorithm.
Page 17
18
1. S. Schuster, D. Fell, T. Dandekar, Nat. Biotech. 18, 326 (2000).
2. C. Francke, R. Siezen, B. Teusink, Trends Microbiol 13, 550 (2005).
3. S. Paley, P. Karp, Bioinformatics 18, 715 (2002).
4. C. H. Schilling, J. S. Edwards, D. Letscher, B. O. Palsson, Biotechnol Bioeng 71, 286
(2000).
5. K. Kauffman, P. Prakash, J. Edwards, Curr. Opin. Biotech. 14, 491 (2003).
6. J. Forster, I. Famili, P. Fu, B. Palsson, J. Nielsen, Genome Res. 13, 244 (2003).
7. H. Bonarius, G. Schmidt, J. Tramper, Trends Biotech. 15, 308 (1997).
8. J. Edwards, B. Palsson, Proc. Natl. Acad. Sci. USA 97, 5528 (2000).
9. J. Edwards, R. Ibarra, B. Palsson, Nat. Biotech. 19, 125 (2001).
10. D. Steinhauser, J. Kopka, EXS 97, 171 (2007).
11. R. Trethewey, A. Krotzky, L. Willmitzer, Curr. Opin. Plant Biol. 2, 83 (1999).
12. A. Saghatelian et. al, Biochemistry 43, 14332 (2004).
13. J. Enders et al., IET Syst. Biol 3, (2010 (Accepted)).
14. J. Rabinowitz, Expert Rev. Proteomics 4, 187 (2007).
15. R. De Vos et. al., Nat. Protoc. 2, 778 (2007).
16. B. Bennett et al., Nat. Chem. Biol. 5, 593 (2009).
17. N. Ishi et al., Science 316, 593 (2007).
18. N. Friedman, Science 303, 799 (Feb 6, 2004).
19. A. A. Margolin et al., Nat Protoc 1, 662 (2006).
20. T. Ideker, T. Galitski, L. Hood, Annu Rev Genomics Hum Genet 2, 343 (2001).
21. M. Bansal, V. Belcastro, A. AmbestiImpiombato, D. di Bernardo, Mol. Syst. Biol. 3, 78
(2007).
22. J. Faith et. al., PLoS Biol. 5, 54 (2007).
23. I. Nemenman et al., Ann N Y Acad Sci 1115, 102 (Dec, 2007).
24. A. Margolin et al., BMC Bioinformatics 7, S7 (2006).
25. K. Basso et al., Nat Genet 37, 382 (Apr, 2005).
26. A. A. Margolin, K. Wang, A. Califano, I. Nemenman, IET Syst Biol in press, (2010).
27. T. M. Cover, J. A. Thomas, Elements of Information Theory. (John Wiley & Sons, New
York, 1991).
28. S. Hoops et al., Bioinformatics 22, 3067 (2006).
29. K. Wang et al., Nat Biotechnol 27, 829 (Sep, 2009).
30. J. R. Enders et al., IET Syst Biol in press, (2010).
Page 18
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

 "Others (Nemenman et al., 2007) analyzed in silico metabolome data of red blood cell metabolism by ARACNE approach (Margolin et al., 2006), which is based on pruning mutual information scores. An elegant improvement on ARACNE based reverse engineering of metabolic profiling data was suggested later (Bandaru et al., 2011). The approach puts a constraint on the possible metabolic transformations to satisfy the mass conservation between the connected metabolites. "
Article: Metabolic Network Discovery by TopDown and BottomUp Approaches and Paths for Reconciliation
[Show abstract] [Hide abstract] ABSTRACT: The primary focus in the networkcentric analysis of cellular metabolism by systems biology approaches is to identify the active metabolic network for the condition of interest. Two major approaches are available for the discovery of the conditionspecific metabolic networks. One approach starts from genomescale metabolic networks, which cover all possible reactions known to occur in the related organism in a conditionindependent manner, and applies methods such as the optimizationbased FluxBalance Analysis to elucidate the active network. The other approach starts from the conditionspecific metabolome data, and processes the data with statistical or optimizationbased methods to extract information content of the data such that the active network is inferred. These approaches, termed bottomup and topdown, respectively, are currently employed independently. However, considering that both approaches have the same goal, they can both benefit from each other paving the way for the novel integrative analysis methods of metabolome data and fluxanalysis approaches in the postgenomic era. This study reviews the strengths of constraintbased analysis and network inference methods reported in the metabolic systems biology field; then elaborates on the potential paths to reconcile the two approaches to shed better light on how the metabolism functions.  [Show abstract] [Hide abstract] ABSTRACT: A better understanding of the pathophysiology should help deliver drugs whose targets are involved in the causative processes underlying the disease. Biological network inference uses computational methods for deducing from highthroughput experimental data, the topology and the causal structure of the interactions among the drugs and their targets. Therefore, biological network inference can support and contribute to the experimental identification of both gene and protein networks causing a disease as well as the biochemical networks of drugs metabolism and mechanisms of action. The resulting highlevel networks serve as a foundational basis for more detailed mechanistic models and are increasingly used in drug discovery by pharmaceutical and biotechnology companies. We review and compare recent computational technologies for network inference applied to drug discovery.