- Research
- Open Access

# Methods for the integration of multi-omics data: mathematical aspects

- Matteo Bersanelli
^{1, 2}, - Ettore Mosca
^{2}, - Daniel Remondini
^{1}, - Enrico Giampieri
^{1}, - Claudia Sala
^{1}, - Gastone Castellani
^{1}and - Luciano Milanesi
^{2}Email author

**17 (Suppl 2)**:S15

https://doi.org/10.1186/s12859-015-0857-9

© Bersanelli et al. 2016

**Published:**20 January 2016

## Abstract

### Background

Methods for the integrative analysis of multi-omics data are required to draw a more complete and accurate picture of the dynamics of molecular systems. The complexity of biological systems, the technological limits, the large number of biological variables and the relatively low number of biological samples make the analysis of multi-omics datasets a non-trivial problem.

### Results and Conclusions

We review the most advanced strategies for integrating multi-omics datasets, focusing on mathematical and methodological aspects.

## Keywords

- Omics
- Multi-omics
- Data integration

## Background

Biological functions are exploited by systems of interacting molecules and macromolecules that take part in physical and biochemical processes in structured environments. Different types of high-throughput technologies allow us to collect information on the molecular components of biological systems. Each of such technologies (e.g. nucleotide sequencing, DNA-chips and protein mass spectrometry) is designed to simultaneously collect a large set of molecular data of a specific kind: e.g. nucleotide sequences, gene expression and protein abundances. Therefore, in order to draw a more comprehensive view of biological processes, experimental data made on different layers have to be integrated and analyzed. The complexity of biological systems, the technological limits, the large number of biological variables and the relatively low number of biological samples make integrative analyses a challenging issue. Hence, the development of methods for the integrative analysis of multi-layer datasets is one of the most relevant problems computational scientists are addressing nowadays.

A few reviews exist on this topic. For example, Berger et al. [1] described integrative approaches in one of the sections of their work, which is also focused on tools for the analysis of single omics layers, while Kristensen et al. [2] presented objectives, methods and computational tools of integrative genomics, with a particular focus on the applications related to cancer research. Conversely, we would like to focus on mathematical aspects and illustrate the solutions found to the problem of multi-omics data integration.

The classification of the approaches presented in the literature as multi-omics methods is a non-trivial task for at least three reasons. First, most of the computational approaches developed so far are pipelines of analysis that apply several methods to carry out a sequence of tasks; therefore, different pipelines share some methods: for example, partial least squares regression is included in both Integromics [3] and sMBPLS [4]. Second, pipelines presented for addressing a particular problem can be also used, with minor modifications, to solve another problem, possibly with other types of omics. Third, several tools can be used in a supervised or unsupervised setting, according to the formulation of the problem.

## Methods

On the basis of methodological aspects, we will consider two main criteria. The first is whether the approach uses graphs to model the interactions among variables. These approaches, designated as “network-based” (NB), take into account currently known (e.g. protein-protein interactions) or predicted (e.g. from correlation analysis) relationships between biological variables. In this class, graph measures (e.g. degree, connectivity, centrality) and graph algorithms (e.g. sub-network identification) are used to identify valuable biological information. Importantly, networks are used in the modeling of the cell’s intricate wiring diagram and suggest possible mechanisms of action at the basis of healthy and pathological phenotypes [5].

The second criterion is whether the approach is bayesian (BY) [6], that is, it uses a statistical model in which, starting from an *a priori* reasonable assumption about the data probability distribution, *parametric* or *non-parametric*, it is possible to compute the updated posterior probability distribution making use of the Bayes’ rule; of course the posterior distribution depends on dataset measurements [7]. In the network-based area, bayesian networks [8]–[10] are another promising framework for the analysis multi-omics data.

Therefore, we will arrange integrative methods in four classes: network-free non-bayesian (NF-NBY), network-free bayesian (NF-BY), network-based non-bayesian (NB-NBY) and network-based bayesian (NB-BY) methods. We will give an overview of the methods that have been proposed for the analysis of at least two different types of omics datasets and describe with more details the specific mathematical grounds. In particular, we choose to consider in detail the mathematical aspects of the most common, representative or promising methods of each category.

## Results and Discussion

### Methods overview

Mathematically, the general problem of analyzing multiple omics datasets can be formulated as the sequential or joint analysis of multiple component-by-sample matrices, possibly using other data that carry prior information on components and samples.

Methods for the analysis of multi-omics datasets

Method | Specificity | Multi-omics approach | Implementation |
---|---|---|---|

Camelot [15] | Specific | Bivariate predictive regression model | NA |

CNAmet [19] | Specific | Multi-omics gene-wise scores | R |

FALDA [21] | General | FA + LDA of a joint matrix | NA |

Integromics [3] | General | Regularized CCA, sparse PLS | R |

iPAC [14] | Specific | Sequential | NA |

MCD [13] | Specific | Sequential | NA |

MCIA [20] | General | Multiple co-inertia analysis | R |

sMBPLS [4] | General | Sparse Multi-Block PLS regression | Matlab |

Coalesce [30] | Specific | Multi-omics probabilities | C ++ |

iCluster [12] | General | Joint Gaussian latent variable models | R |

MDI [28] | General | DMA mixture models | Matlab |

PSDF [29] | General | Hierarchical DMA mixture models | Matlab |

TMD [27] | General | Hierarchical DMA mixture models | Matlab |

Kernel Fusion [18] | General | Integration of omics-specific kernels | Matlab |

Endeavour [37] | General | Integration of omics-specific ranks with order statistics | Webserver |

MOO [16] | General | Sub-network extraction on MWG | R |

Multiplex [38] | General | Joint analysis of multi-layered networks | NA |

NuChart [35] | Specific | Analysis of a MWG | R |

SNF [17] | General | Similarity network fusion | Matlab, R |

SteinerNet [33] | Specific | Sub-network extraction on MWG | Webserver |

stSVM [34] | Specific | MWG | R |

Paradigm [51] | General | Multi-omics bayesian factor graphs | C ++ |

Conexic [11] | Specific | Sequential | Java |

As already mentioned, a distinction can be done between *sequential* and *simultaneous* analysis of multiple layers. In the former case, the results of the analysis of one layer are refined by means of the subsequent analyses of further layers. This is the case, for example, of methods that are designed assuming a causal effect of an omics (e.g. genomics) on another (e.g. transcriptomics), like MCD [13] and iPAC [14]. The joint analysis of multiple omics can be carried out by means of models that consider each layer as a separate entity: two examples are multivariate regression [15] and multi-objective optimization [16]. Simultaneous analysis may require a preliminary step of data fusion, which usually involves objects derived from single-layer analysis: two examples are the fusion of sample-sample similarity matrices [17] and of gene-gene kernels matrices [18] calculated on different omics.

### Network-free non-bayesian (NF-NBY)

Among the approaches that have been developed for specific types of omics there are iPAC [14], MCD [13], CNAmet [19], sMB-PLS [4] and Camelot [15]. iPAC [14] is an unsupervised approach for the sequential analysis of CNV and gene expression data on the basis of a series of gene selection criteria: aberrant genes identified by the analysis of CNV are further studied by correlation analysis of gene expression in order to find the subset of aberrant genes potentially leading to a substantial shift in transcriptional programs. MCD [13] (Multiple Concerted Disruption) is another sequential approach. CNVs, loss of heterozygosity (LOH) and DNA methylations are analyzed sequentially in order to find changes in gene copy number accompanied by allelic imbalances and variations in DNA methylation resulting in gene expression differences. CNAmet [19] uses gene-wise weights calculated considering the gene expression in classes of samples with different CNVs or DNA methylation pattern; weights for CNV and DNA methylation are then linearly combined to define gene-wise statistics, whose significance is assessed by permutation analysis. In 2012 Li et al. presented the sparse Multi-Block Partial Least Squares (sMB-PLS) regression method [4] for the identification of regulatory modules from multiple omics. Common weights are found in order to maximize the covariance between summary vectors of the input matrices (CNV, DNA methylation and miRNA expression) and the summary vector of the output matrix (mRNA expression). A multi-dimensional regulatory module contains sets of regulatory factors from different layers that are likely to jointly contribute to a “gene expression factory”. Camelot [15] finds the optimal regression model for phenotype prediction (drug response) on the basis of matched genotype and gene expression data. This method suggests the molecular mechanisms that predict the phenotype under analysis.

Conversely from the methods above, Integromics [3], MCIA [20] and the approach of Liu et al. [21] are based on models of data integration that can be easily applied to different types of omics. Integromics [3] performs integrative analysis of two types of omics with the main objective of finding similarities among samples and correlation among molecular components. It uses a regularized version of canonical correlation analysis to highlight correlations between the two datasets and a sparse version of partial least squares regression that includes simultaneous variable selection in both datasets. In principle, it can be applied to any pairs of omics that can be encoded as continuous sample-by-components matrices. Multiple co-inertia analysis MCIA [20] is an exploratory data analysis method that identifies co-relationships between multiple high-dimensional datasets. Based on a covariance optimization criterion, MCIA simultaneously projects several datasets into the same dimensional space, transforming diverse sets of features onto the same scale. This analysis leads to the identification of biological markers and clusters of samples. Liu et al. [21] presented a method (shortly FALDA) based on standardization and merger of several omics (namely mRNA, miRNA and protein data) into a joint (standardized) molecule-by-sample matrix. Then, factor analysis (FA) and linear discriminant analysis (LDA) are used to highlight molecular mechanisms that discriminate different classes of samples.

Many variations of PLS, a common dimensionality reduction method, have been introduced for the integration of complex datasets: for example, Integromics [3] relies on a sparse version of PLS (sPLS), and other variants of PLS, such as Orthogonal PLS [22], Kernel PLS [23] or O2-PLS [24], have been described in the literature. The idea of weighting the behavior of a gene at different levels and then combining such weights in order to get an integrated picture, applied so far for gene expression, CNV and methylation data [19], is a versatile approach that can be applicable to other types of datasets (e.g. gene expression, somatic mutations and protein expression). Thus, below we will describe in more detail Partial Least Squares (PLS) and the use of signal-to-noise statistics for the integrative analysis of multiple datasets [19].

#### Partial least squares

PLS and PCA (Principal Component Analysis) are techniques that seek to identify a small set of features that work as predictors of the response dataset. While PCA works in a purely unsupervised fashion, PLS makes use of the response in order to find appropriate linear combinations of the predictors that define a new set of features. In PLS the coefficients of the linear combination are chosen so that the highest weight is assigned to variables that are most strongly correlated to the response. In this sense we can say that PLS is a supervised alternative to PCA, for details see [25].

*n*(e.g.

*n*=3) input layers

*X*

_{1},

*X*

_{2},

*X*

_{3}and a response dataset

*Y*, where observations are made on the same set of samples. The goal is to identify MDRMs (Multi dimensional regulatory modules) that are column subsets of the input datasets on the same samples that are strongly associated to the response. First each layer is represented as the first PLS predictor for

*i*=1,2,3, (

**Z**

_{ i }=

*X*

_{ i }·

**w**

_{ i }) and the response

*Y*is treated the same way (

**U**=

*Y*·

**v**), where

**w**

_{ i },

**v**are the loadings and

**Z**

_{ i }and

**U**are the summary vectors or latent variables of respectively the input and response datasets. Then sMBPLS defines

**Z**=

*b*

_{1}

**Z**

_{1}+

*b*

_{2}

**Z**

_{2}+

*b*

_{3}

**Z**

_{3}that is a summary vector of the three datasets. The weights

*b*

_{ i }are supposed to account for the contribution of the

*i*-th dataset to the total covariance. Mathematically the problem can be described as finding the optimal parameters so that the covariance between input and response (summarized in

**Z**and

**U**) is optimized. The results improve substantially by introducing a constraint or a penalization to the objective function that needs to be optimized: sMBPLS uses a Lasso penalization - many different penalization choices are possible (for details see e.g. [25]). The effect of this penalization is often called sparsity, meaning that negligible coefficients tend to be drawn to zero. So the final function to be maximized can be expressed as

with the further restrictions that vectors **w** _{
i
} ,**v**,**b** must have norm equal to 1; here ${P}_{{\lambda}_{i}}$ are the Lasso penalizations. In order to estimate the optimal parameters in (1) Li et al. develop an ad hoc algorithm [4].

#### Gene-wise weights

*s*

_{ i }are defined using gene expression, DNA methylation and CNV data:

*i*-th gene between samples with high and low values of DNA methylation ${w}_{i}^{\mathit{\text{me}}}$ and CNV ${w}_{i}^{\mathit{\text{cn}}}$, while

*ε*

_{ i }is a normalization term. More precisely, layer-specific weights for each gene are calculated using the mean and standard deviation of gene expression

where the suffixes 1 and 0 indicate, respectively, samples having high and low values of the other omics (DNA methylation or CNV). In summary, each variable is associated with the sum of a set of signal-to-noise scores, each of which is calculated considering the means and standard deviations of the variable using two subsets of samples of a given dataset (e.g. gene expression) defined on the basis of the values of the same variable in another layer (e.g. CNV or methylation).

### Network-free bayesian (NF-BY)

Parametric or “strict” bayesian frameworks assume that the prior probability distribution follows a specific model dependent on one or more parameters. If the prior fits the data well parametric bayesian methods usually outperform non-parametric ones. On the other hand, if the initial guess for the prior is hard or even impossible to formalize, non-parametric or distribution-free methods are preferred [7]. It is important to remark that non-parametric or distribution-free methods are characterized by the fact that - unlike their parametric counterpart - the priors are not identifiable with a given family of probability distributions depending on one or more parameters, since this family would be too large, therefore introducing the need of an alternative definition of the priors in which - roughly speaking - the parameters themselves are supposed to be random. In this context, Antoniak [26] defined Mixtures of Dirichelet Processes (DPM) a useful set of priors for many non-parametric problems, that was taken as a starting point for many recent works aiming at the integration of multi-omics, such as TMD [27], MDI [28], PSFD [29], while, for example, iCluster [12] is a parametric method. The choice between parametric and non-parametric models is often not arbitrary, but it is driven by the type of data to be modeled.

iCluster [12] and MDI [28] have been developed with the main objective of sample clustering and can be applied to different types of omics. iCluster [12] takes as input two or more matrices and finds multi-omics clusters jointly estimating, by means of a prior-posterior bayesian structure, the clustering *Z*, which is modeled as a Gaussian latent variable having layer-specific weights and parameters. MDI (multiple dataset integration) [28] carries out the same objective (clustering) using a bayesian approach to jointly estimate the parameters of Dirichelet Process Mixture models. These models are applied to find clusters and relevant genes (features).

An approach closely related to MDI is Savage’s Transcriptional Modules Discovery (TMD) [27] who also adopts a mixture modeling approach, using hierarchical Dirichelet process to perform integrative modeling of two datasets. Conversely to MDI, TMD aims at the identification of molecular mechanisms.

Patient-Specific Data Fusion (PSDF) [29] extends the TMD model for assessing the concordance of biological signals of samples in the two datasets taken into account (CNV and gene expression data). PSDF can be used to shed light on molecular mechanisms and cluster samples.

Coalesce [30] is a combinatorial algorithm specifically developed for the identification of regulatory modules from the analysis of gene expression and DNA sequence data. The multi-omics probability for a gene to be included into a module is calculated combining omics specific probabilities through the Bayes’ rule.

Since iCluster was introduced, it is often being cited by subsequent works as an innovative reference approach for multi-omics clustering of samples, while, as already said, MDI shares a multi-layer analysis approach (based on Dirichelet Process Mixture models) with other recent methods. Hence, we will focus on iCluster and MDI in the following.

#### Bayesian latent variable models

*N*datasets referred to the same group of samples, iCluster formulates sample clustering as a joint latent variable that needs to be simultaneously estimated from multiple genomic data types. The first step is to capture the similarities among genomic information in each data set, so that the within-cluster variance is minimized. This task is performed by an optimization through PCA of the classical

*K*-means clustering algorithm, with the additional advantage of reducing the dimensionality of the data: if

*k*is the number of clusters, the dimensionality

*n*of the genomic data is basically reduced to the first

*k*-1 principal directions. Second, the clustering scheme in each layer is represented as a Gaussian latent variable model with the Gaussian latent component

*Z*capturing the dependencies across the data types. Dealing with

*N*different omics measurements on the same

*p*samples

*X*

_{1},

*X*

_{2},…,

*X*

_{ N }, each one of dimension

*p*×

*n*

_{ i }with usually

*p*<<

*n*

_{ i }, the model can be written in the following fashion:

where the matrices *W* _{
i
} are the *p*×*k*−1 weight matrices and *ε* _{
i
} are the independent error terms. After taking a continuous parametrization *Z* ^{∗} of *Z* and assuming *Z* ^{∗}∼*N*(0,*I*) and *ε*=(*ε* _{1},…,*ε* _{
N
} )∼*N*(0,*cov*(*ε*)), likelihood-based inference is obtained through the Expectation-Maximization (EM) algorithm [31]. iCluster requires the number of desired clusters *k* as input for the algorithm.

*N*-components mixture model, the probability density for the data

*p*(

*X*) is modeled using Dirichelet-multinomial allocation mixture model,

where *w* _{
k
} are the mixture proportions, *θ* _{
k
} are the parameters associated to the *k*-th component and *π* is a parametric density. Component allocation variables and some additional parameters - conversely from the TMD model [27] - are introduced in order to capture the dependencies among these models and find clusters of genomic entities having the same behavior in different datasets. The modeling structure of the multi-layer dataset exploits the mathematical connection between mixture models and Dirichelet Processes, a non-trivial problem: for details see [32]. In this way is possible to construct a prior probability for each dataset where the probability distribution is parametrized by component allocation variables. Inference on such parameters is performed through Gibbs sampling. Finally, in order to identify groups that tend to cluster together in multiple datasets, it is natural to exploit the posterior probability as a metric in order to decide whether or not a connection among each couple of genes is strong enough across the dataset.

Both MDI and iCluster carry out simultaneous integrative clustering of multiple omics datasets. However, in contrast to MDI, iCluster seeks to find a single common clustering structure for all datasets.

### Network-based non-bayesian (NB-NBY)

Methods that we have assigned to this category make either use of molecular interaction data or use networks defined from correlation analysis.

SteinerNet [33], the method proposed by Mosca et al. [16], stSVM [34] and nuChart [35] share a common strategy: the analysis of a multi-weighted graph that carry multi-omics information. SteinerNet [33] is a method that identifies molecular sub-networks using omics datasets and a given molecular network. In order to reconstruct response pathways, SteinerNet finds a solution to the prize-collecting Steiner tree (PCST) problem, a minimum-weighted subtree that find an optimal network subject to weights assigned to vertexes and edges on the basis of input datasets. Similarly, multi-objective optimization (MOO) has been recently proposed for the extraction of sub-networks enriched in multi-omics information [16]. Sub-networks are extracted on the basis of multiple criteria applied to a network that encodes several layers of biological information as vertex and edge weights. Also stSVM (smoothed *t*-statistic support vector machine) method [34] loads gene-wise statistics from multiple omics (miRNA and mRNA) on a molecular network known *a priori*. Then, a network diffusion method is used to smooth the statistics according to network topology. Significant genes are then used to train a classifier (a SVM) that predicts the type of sample (e.g. early versus late disease relapse). NuChart [35] is a method for the annotation and statistical analysis of a list of genes with information relying on Hi-C data (genome-wide data of chromosomal interactions [36]). NuChart identifies Hi-C fragments by means of DNA sequencing data and creates gene-centric neighborhood graphs on which other omics data (e.g. gene expression) are mapped and jointly analyzed.

ENDEAVOUR [37] calculates gene-wise statistics from heterogeneous genome-wide data sources (including molecular interactions) and ranks genes according to their similarity to known genes involved in the biological process under analysis. Single layer prioritizations are then integrated into a global ranking by means of order statistics. In 2007 De Bie et al. [18] proposed a kernel-based data fusion method for gene prioritization, which operates in the same setting of ENDEAVOUR. Kernels representing gene information in each layer are linearly combined in order to fuse the information and identify disease genes.

SNF (Similarity Network Fusion) [17] is a method that computes and fuses patient similarity networks obtained from each omics separately, in order to find disease subtypes and predict phenotypes. Conversely from the other methods of this section, SNF uses sample-sample networks obtained from correlation analysis. The key step of SNF is to iteratively and simultaneously update the global patient similarity matrix of each layer using a local *K*-nearest neighbours (KNN) approach combined with the global similarity matrices of the other layers. Fusion is then completed by averaging the similarity matrices once the iterative upgrading is performed.

Recently, a type of multi-partite network (multiplex) has been introduced as a novel theoretical framework for network-based multi-layer integrative analysis [38]. Multiplex networks are multi-layer systems of vertexes that can be linked in multiple interacting and co-evolving layers. This approach has been proposed for the analysis of gene expression data in brain [39] and cancer [40]. In the second example, a sample-sample duplex (two-layers network) has been generated based on correlation between gene expression profiles, revealing structural similarities and differences between two classes of samples. Thanks to their general formalism, in principle multiplex networks can be applied to the joint analysis of several types of omics (e.g. one type of omics for each layer), also for multi-level clustering purposes [41].

In the following subsections, we will discuss in more detail network diffusion, fusion of similarity networks and heterogeneous/multiplex networks. Methods that simulate the diffusion of information throughout a network are being increasingly used, since they allow to study how the information (e.g. differential expression, sequence variations) initially available in one or more network components (vertexes) affects other network regions [42]. SNF [17] is a diffusion-based strategy that can be easily extended to the analysis of a wide range of multi-omics data. Heterogeneous and multiplex networks are promising frameworks for innovative multi-omics data analysis.

#### Diffusion processes on networks

Network diffusion algorithms define a vector of scores *σ* associated with network vertexes on the basis of initial conditions **x** _{0} and network topology *τ*, usually represented by the adjacency matrix *A* or the Laplacian matrix *L* of the graph.

*p*-step random walk kernel

*K*is used in order to smooth the

*t*-statistics

**x**

_{0}, which assess the differential expression of genes. The kernel is defined as

*α*is a constant,

*L*

^{′}is the symmetrically normalized Laplacian matrix of the graph and

*p*is the number of random walk steps. The smoothing of the

*t*-statistic

**x**is simply computed using the kernel

*K*:

In this case the influence of a node on the network is controlled by the parameter *p*. Basically, the information initially available in each vertex is distributed to its neighbors by means of the application of *K*. For a deeper insight of diffusion kernels see [43].

*σ*=

*σ*(

*X*

_{0},

*τ*) are the steady state solution of a discrete or continuous diffusion process on the network that can have either a deterministic or a stochastic interpretation. An example of such a technique is the network propagation algorithm exploited in the work of Hofree et al. [44]: after mapping a patient mutation profile onto a molecular network, network propagation is used to “smooth” the mutation signal across the network. Network propagation uses a process that simulates a random walk on a network with restarts according to the function:

where **x** _{0} is a vector representing some kind of genomic information about a patient (in this case mutation signal), *A* ^{′} is the symmetrically normalized adjacency matrix capturing correlations among genes, and *α*∈(0,1) controls how much information is retained in the nodes with respect to how much is not. For *t*→*∞* for each patient, the discrete array **x** _{0} is smoothed into a real-valued array *σ*=**x**(*∞*).

Network diffusion processes are often based on an actual physical model, having the benefit of exploiting physical quantities and concepts to drive the setting of the parameters. For example Vandin and Upfal [45] presented a computationally efficient strategy for the identification of sub-networks considering the hydrodynamic model introduced by Qi et al. [46]: fluid is pumped into the source node *s* at a constant rate, diffuses through the graph along the edges, and is lost from each node at a constant first-order rate until a steady-flow solution is reached.

The presence of random walks on a graph allows connections to many other physical models. For example, another interesting framework is represented by electric circuits [47], where the relation between the random walk of electrons on a circuit and Kirkhoff laws is exploited. eQed is a recent application of the latter [48]. Recently Mirzaev and Gunawardena have collected and rigorously demonstrated some of the most important mathematical results in the context of information dynamics in a linear framework, also suggesting a possible stochastic interpretation of such diffusion processes on the network in the Chemical Master Equation formalism [49].

#### Fusion of similarity networks

*N*of different patient similarity networks with associated global similarity matrices

*P*

_{ i }

_{,0}are defined from

*N*datasets. Let’s assume

*N*=2 for the sake of clarity. Then, for each layer a KNN local similarity matrix

*S*

_{ i }is introduced in order to retain only robust information. Subsequently, global similarity matrices are smoothed by two parallel interchanging diffusion processes that consist of the upgrading of the global similarity matrices with respect to the local similarity matrices of the other layer:

having initial condition *P* _{
i
} (0)=*P* _{
i
}_{,0}. After convergence, the fused similarity matrix is then defined as the average of *P* _{1} and *P* _{2}. The result is a similarity matrix that can be viewed as the weighted adjacency matrix of a network built by fusing the similarity networks associated with each layer [17].

#### Heterogeneous networks and multiplex

In the context of multi-omics data analyses, multiple (*k*) layers can be represented by means of *k* networks. In this context, we can distinguish between two kinds of formalism: heterogeneous networks and multiplex networks.

*k*different kinds of nodes, each type corresponding to a different layer of biological information. In this framework, intra-layer connections and inter-layer connections are formally treated in the same way, even if they can be weighed differently. The multi-layered information is therefore somehow squeezed on just one dimension and the properties of the resulting graph can be used to manipulate the data. For example, for

*k*=2 we can have vertexes of genes layer

*g*

_{1},

*g*

_{2},…,

*g*

_{ n }and proteins layer

*p*

_{1},

*p*

_{2},…,

*p*

_{ m }. The Laplacian matrix of this heterogeneous network is a (

*n*+

*m*)×(

*n*+

*m*) matrix:

where *L* _{
g
} and *L* _{
p
} are the Laplacian matrices of respectively gene and protein layers, while the matrices *B* _{
gp
} and *B* _{
pg
} contain the information about inter-layer connections; in the case the graph is undirected ${B}_{\mathit{\text{pg}}}={B}_{\mathit{\text{gp}}}^{T}$. An example of application of heterogeneous network for modeling gene-phenotype networks was presented by Li and Patra [50].

Multiplex networks [38] are instead multi-partite networks in which each of the *k* layers models a different information about the same set of vertexes *v* _{1},*v* _{2},…,*v* _{
n
} . For example, let us consider two omics, represented as a two-layered multiplex composed of two sample × sample networks, where the edges of each network are placed in function of the sample-sample correlations found in the associated omics. Then, it is possible to analyze inter-layer correlations by means of multilnks, a quantity that summarizes the connectivity of each pair of samples across the layers. More precisely, a multilink is a *k*-dimensional binary array whose *i*-th component is set to 1 if the two samples are connected in the *i*-th layer and 0 otherwise. The formalism of multilink is the basis to define weighted measures and overlaps of the multiplex networks and other physical quantities, such as entropy, which introduces a theoretical framework to quantify and detect the information stored in complex networks [38], [40].

### Network-based bayesian (NB-BY)

In this section we deal with methods that can be classified as both network-based and bayesian; these features select mainly those methods that are somehow related to bayesian networks (BNs). BNs are probabilistic models composed of a graph and a local probability model that can be either parametric or not. BNs represent an important area of machine learning theory and many applications of this topic are found in diverse fields. BNs can be thought as a combination of network theory and probability theory.

Within the BN framework an important method for multi-omics data integration is Paradigm [51]. Its goal is the definition of patient-specific pathway activities by means of probabilistic inference. Each biological entity (gene, protein, etc.) is modeled as a factor graph that can be defined to host a wide range of multi-omics information, and is associated with a prior probability of being activated in a given pathway.

Conexic, a bayesian network-based algorithm, has been introduced for the identification of driver mutations in cancer through the integration of gene expression and CNVs [11]. Conexic is based on a bayesian scoring function that evaluates how each candidate gene, or a combination of genes, predicts the behavior of a gene expression module across tumor samples. Networks, more precisely regression trees, are used to encode regulation programs.

Below, we will focus on the theoretical setup of the BN developed by Paradigm [51].

#### Paradigm: an application of bayesian networks

The goal of Paradigm is the definition of an entities × samples matrix called IPA (inferred pathway activity) where IPA _{
ij
} reports a score that accounts for how likely the biological entity *i* is activated/null/deactivated in sample *j*.

*Φ*=(

*ϕ*

_{1},…,

*ϕ*

_{ m }) that are used for assigning a probability for the genomic entities or variables

**X**=(

*X*

_{1},…,

*X*

_{ n }):

*Z*is a normalization constant accounting for all of the possible settings of the variables

**X**and

**X**

_{ j }is a set constituted by

*x*

_{ j }and its “parents”

*Pa*(

*x*

_{ j }) that are the nodes that have a link directed to

*x*

_{ j }in the network. It is important to underline that the number of features

*m*is much less than 2

^{ n }−1 (the number of possible edges in the graph): this “sparsity” facilitates integration. In this way it is possible to assign to each gene’s

*x*

_{ i }activity

*a*first a prior probability distribution and then probability distribution consistent with the dataset measurements

*D*:

where *Φ* is the fully specified factor graph, $S{\subset}_{{A}_{i}\left(a\right)\cup D}{X}_{j}$ are all the possible configurations consistent with both the dataset measurements *D* and the fact that gene *i* is activated (*A* _{
i
} (*a*) is the the singleton assignment set {**x** _{
i
} =*a*}); the proportionality constant is the same as Eq. (11). The junction free inference algorithm and the belief propagation algorithm are used to infer the probabilities while EM algorithm [31] is used to learn the parameters. After inference log odds of the posterior probability distribution are used to measure the activity of each gene.

## Conclusions

Methods for the analysis of multiple layers of biological information pave the way for a more comprehensive and deeper understanding of biological systems. Indeed, several authors were able to show that the integration of multi-dimensional datasets leads to better results from a statistical and a biological point of view than single layer analyses. For example, using MCD, Charj et al. [13] showed that the integration of DNA copy number, LOH, DNA methylation and gene expression data permits the identification of a higher number of DNA explained gene expression changes and a set of genes that would have been missed in standard single layer analysis; Liu et al. [21] reported an improvement in the identification of pathways and networks integrating miRNA, mRNA and proteins; Wang et al. [17] showed that their network fusion approach applied to gene expression and DNA methylation lead to clusters of patients (corresponding to cancer subtypes) with significantly different survival rates.

A better understanding of the algorithms underlying integrative approaches is important for their correct application and further development. Network-based approaches use graphs for modeling and analyzing relationships among variables and are one of the most important classes of multi-omics methods. These approaches take advantage of algorithms for graph analysis. In particular, algorithms that propagate information on networks are being proposed in several applications and are often related to actual physical models. Networks allow to model the intricate cell’s wiring diagram and to use it as a framework for the integrated analysis of layers of biological information. However the incompleteness of experimentally detected molecular interactions is still a significant limit. Further, better tools of analysis are required, because assumptions like normality and variable independence are often not fulfilled [5]. Multi-layer network-based frameworks, such as heterogeneous and multiplex networks, allow the definition of novel tools for the integration of omics. For example, the already mentioned methods of network diffusion can be extended to such frameworks in order to get multi-omics propagation scores, and new clustering algorithms could be developed based on these multi-layer relationships. Moreover, multiple omics data can be naturally embedded in a heterogeneous network framework, for example metabolomics and genomics data, considering genes that codify for enzymes as inter-layer links, and intra-layer relationship given by *a priori* biological knowledge (like protein-protein interaction network) or by network reconstruction based on metabolomics and transcriptomics data.

Another class of interesting approaches relies on Bayes’ rule. Multilevel bayesian models (parametric or not) are facing the multi-omics challenge by building frameworks that facilitate a biologically appropriate formalism for the assumptions on the prior distribution (e.g. factor graphs, mixture models) and by programming non-trivial and efficient algorithms for parameter estimation. Assuming the bayesian framework is an interesting choice because it reduces the integration to the estimate of a smaller set of parameters, simultaneously suggesting a clear integration scheme. A limitation of such models is that for parametric methods the output strongly depends on how well the prior distribution assumption is able to capture the core information of the given dataset. Distribution-free approaches do not have such a problem but sometimes tend to lack in accuracy. In the network-based context the application of bayesian networks represents an interesting compromise between networks and probability theory. The bayesian framework is promising also regarding the issue of noise, because errors have the possibility to be formally taken into account from the beginning of the analysis.

Not surprisingly, genomics and transcriptomics are the two omics for which many and more established approaches of multi-layer analysis exist. However, the availability of methods that are not tailored for specific types of omics extends the applicability of integrative approaches also to omics that are still less covered by specific methods, such as proteomics, metabolomics or glycomics.

One of the main limitations of integrative approaches is related to dimensionality. In fact, if on one hand more layers correspond to a more complete picture of the biological system, on the other hand the dimensionality of the problem increases. However, *a priori* information on the relationships among the components of the biological system should help in reducing false discoveries.

Several methods are implemented using R [52], confirming the prominent role of this programming language in the analysis of biological data, and Matlab [53]. The availability of well-documented and user-friendly implementations is a crucial factor for the usability and spread of interesting methods. However, there are still several cases in which software packages are not provided.

## Funding

The work has been supported by the Italian Ministry of Education and Research through the Flagship InterOmics (PB05) and HIRMA (RBAP11YS7K) projects, and the European MIMOmics (305280) project. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Publication costs for this article were funded by InterOmics (PB05) project.

## Declarations

This article has been published as part of BMC Bioinformatics Volume 17 Supplement 2, 2016: Bringing Maths to Life (BMTL). The full contents of the supplement are available online at http://www.biomedcentral.com/bmcbioinformatics/supplements.

## Declarations

## Authors’ Affiliations

## References

- Berger B, Peng J, Singh M: Computational solutions for omics data. Nat Rev Genet. 2013, 14 (5): 333-46.View ArticlePubMedPubMed CentralGoogle Scholar
- Kristensen VN, Lingjærde OC, Russnes HG, Vollan HKM, Frigessi A, Børresen-Dale A-L: Principles and methods of integrative genomic analyses in cancer. Nat Rev Cancer. 2014, 14 (5): 299-313.View ArticlePubMedGoogle Scholar
- Lê Cao K-A, González I, Déjean S: Integromics: an r package to unravel relationships between two omics datasets. Bioinformatics. 2009, 25 (21): 2855-6. 10.1093/bioinformatics/btp515.View ArticlePubMedPubMed CentralGoogle Scholar
- Li W, Zhang S, Liu C-C, Zhou XJ: Identifying multi-layer gene regulatory modules from multi-dimensional genomic data. Bioinformatics. 2012, 28 (19): 2458-66.View ArticlePubMedPubMed CentralGoogle Scholar
- Barabási A-L, Gulbahce N, Loscalzo J: Network medicine: a network-based approach to human disease. Nat Rev Genet. 2011, 12 (1): 56-68.View ArticlePubMedPubMed CentralGoogle Scholar
- Skilling J: Data analysis: a Bayesian tutorial. 2006, Oxford University Press, New York, USAGoogle Scholar
- Ferguson TS: A bayesian analysis of some nonparametric problems. Ann Stat. 1973, 1: 209-30. 10.1214/aos/1176342360.View ArticleGoogle Scholar
- Heckerman D: A tutorial on learning with Bayesian networks, Learning in Graphical Models. 1998, Springer, NetherlandsGoogle Scholar
- Gevaert O, De Smet F, Timmerman D, Moreau Y, De Moor B: Predicting the prognosis of breast cancer by integrating clinical and microarray data with bayesian networks. Bioinformatics. 2006, 22 (14): 184-90.View ArticleGoogle Scholar
- Friedman N, Linial M, Nachman I, Pe’er D: Using bayesian networks to analyze expression data. J Comput Biol. 2000, 7 (3-4): 601-20.View ArticlePubMedGoogle Scholar
- Akavia UD, Litvin O, Kim J, Sanchez-Garcia F, Kotliar D, Causton HC, et al: An integrated approach to uncover drivers of cancer. Cell. 2010, 143 (6): 1005-17.View ArticlePubMedPubMed CentralGoogle Scholar
- Shen R, Olshen AB, Ladanyi M: Integrative clustering of multiple genomic data types using a joint latent variable model with application to breast and lung cancer subtype analysis. Bioinformatics. 2009, 25 (22): 2906-12.View ArticlePubMedPubMed CentralGoogle Scholar
- Chari R, Coe BP, Vucic EA, Lockwood WW, Lam WL: An integrative multi-dimensional genetic and epigenetic strategy to identify aberrant genes and pathways in cancer. BMC Syst Biol. 2010, 4 (1): 67-10.1186/1752-0509-4-67.View ArticlePubMedPubMed CentralGoogle Scholar
- Aure MR, Steinfeld I, Baumbusch LO, Liestøl K, Lipson D, Nyberg S, et al: Identifying in-trans process associated genes in breast cancer by integrated analysis of copy number and expression data. PLoS One. 2013, 8 (1): 53014-View ArticleGoogle Scholar
- Chen B-J, Causton HC, Mancenido D, Goddard NL, Perlstein EO, Pe’er D: Harnessing gene expression to identify the genetic basis of drug resistance. Mol Syst Biol. 2009, 5: 310-PubMedPubMed CentralGoogle Scholar
- Mosca E, Milanesi L: Network-based analysis of omics with multi-objective optimization. Mol Biosyst. 2013, 9 (12): 2971-80.View ArticlePubMedGoogle Scholar
- Wang B, Mezlini AM, Demir F, Fiume M, Tu Z, Brudno M, et al: Similarity network fusion for aggregating data types on a genomic scale. Nat Methods. 2014, 11 (3): 333-7.View ArticlePubMedGoogle Scholar
- De Bie T, Tranchevent L-C, van Oeffelen LMM, Moreau Y: Kernel-based data fusion for gene prioritization. Bioinformatics. 2007, 23 (13): 125-32.View ArticleGoogle Scholar
- Louhimo R, Hautaniemi S: Cnamet: an r package for integrating copy number, methylation and expression data. Bioinformatics. 2011, 27 (6): 887-8. 10.1093/bioinformatics/btr019.View ArticlePubMedGoogle Scholar
- Meng C, Kuster B, Culhane AC, Gholami AM: A multivariate approach to the integration of multi-omics datasets. BMC Bioinformatics. 2014, 15: 162-View ArticlePubMedPubMed CentralGoogle Scholar
- Liu Y, Devescovi V, Chen S, Nardini C: Multilevel omic data integration in cancer cell lines: advanced annotation and emergent properties. BMC Syst Biol. 2013, 7: 14-View ArticlePubMedPubMed CentralGoogle Scholar
- Trygg J, Wold S: Orthogonal projections to latent structures (o-pls). J Chemometrics. 2002, 16 (3): 119-28. 10.1002/cem.695.View ArticleGoogle Scholar
- Rosipal R, Trejo LJ: Kernel partial least squares regression in reproducing kernel hilbert space. J Mach Learn Res. 2002, 2: 97-123.Google Scholar
- Bylesjö M, Eriksson D, Kusano M, Moritz T, Trygg J: Data integration in plant biology: the o2pls method for combined modeling of transcript and metabolite data. Plant J. 2007, 52 (6): 1181-91.View ArticlePubMedGoogle Scholar
- James G, Witten D, Hastie T, Tibshirani R: An introduction to statistical learning. 2013, Springer, New York, USAView ArticleGoogle Scholar
- Antoniak CE: Mixtures of dirichlet processes with applications to bayesian nonparametric problems. Ann Stat. 1974, 2: 1152-74. 10.1214/aos/1176342871.View ArticleGoogle Scholar
- Savage RS, Ghahramani Z, Griffin JE, de la Cruz BJ, Wild DL: Discovering transcriptional modules by bayesian data integration. Bioinformatics. 2010, 26 (12): 158-67.View ArticleGoogle Scholar
- Kirk P, Griffin JE, Savage RS, Ghahramani Z, Wild DL: Bayesian correlated clustering to integrate multiple datasets. Bioinformatics. 2012, 28 (24): 3290-7.View ArticlePubMedPubMed CentralGoogle Scholar
- Yuan Y, Savage RS, Markowetz F: Patient-specific data fusion defines prognostic cancer subtypes. PLoS Comput Biol. 2011, 7 (10): 1002227-View ArticleGoogle Scholar
- Huttenhower C, Mutungu KT, Indik N, Yang W, Schroeder M, Forman JJ, et al: Detailing regulatory networks through large scale data integration. Bioinformatics. 2009, 25 (24): 3267-74.View ArticlePubMedPubMed CentralGoogle Scholar
- Dempster AP, Laird NM, Rubin DB: Maximum likelihood from incomplete data via the em algorithm. J R Stat Soc Ser B Methodol. 1977, 39: 1-38.Google Scholar
- Green PJ, Richardson S: Modelling heterogeneity with and without the dirichlet process. Scand J Stat. 2001, 28 (2): 355-75. 10.1111/1467-9469.00242.View ArticleGoogle Scholar
- Tuncbag N, McCallum S, Huang S-SC, Fraenkel E: Steinernet: a web server for integrating ‘omic’ data to discover hidden components of response pathways. Nucleic Acids Res. 2012, 40 (Web Server issue): 505-9.View ArticleGoogle Scholar
- Cun Y, Fröhlich H: Netclass: an r-package for network based, integrative biomarker signature discovery. Bioinformatics. 2014, 30 (9): 1325-6.View ArticlePubMedGoogle Scholar
- Merelli I, Lió P, Milanesi L: Nuchart: an r package to study gene spatial neighbourhoods with multi-omics annotations. PLoS One. 2013, 8 (9): 75146-View ArticleGoogle Scholar
- van Berkum NL, Lieberman-Aiden E, Williams L, Imakaev M, Gnirke A, Mirny LA, et al. Hi-c: a method to study the three-dimensional architecture of genomes. J Vis Exp. 2010;39. doi:10.3791/1869.
- Aerts S, Lambrechts D, Maity S, Van Loo P, Coessens B, De Smet F, et al: Gene prioritization through genomic data fusion. Nat Biotechnol. 2006, 24 (5): 537-44.View ArticlePubMedGoogle Scholar
- Menichetti G, Remondini D, Panzarasa P, Mondragón RJ, Bianconi G: Weighted multiplex networks. PLoS One. 2014, 9 (6): 97857-View ArticleGoogle Scholar
- Castellani G, Intrator N, Remondini D: Systems biology and brain activity in neuronal pathways by smart device and advanced signal processing. Front Genet. 2014, 5: 1-20. 10.3389/fgene.2014.00253.View ArticleGoogle Scholar
- Menichetti G, Remondini D, Bianconi G: Correlations between weights and overlap in ensembles of weighted multiplex networks. Phys Rev E Stat Nonlin Soft Matter Phys. 2014, 90 (6-1): 062817-10.1103/PhysRevE.90.062817.View ArticlePubMedGoogle Scholar
- Dong X, Frossard P, Vandergheynst P, Nefedov N: Clustering with multi-layer graphs: a spectral perspective. IEEE Trans Signal Process. 2012, 60 (11): 5820-31. 10.1109/TSP.2012.2212886.View ArticleGoogle Scholar
- Wang X, Gulbahce N, Yu H: Network-based methods for human disease gene prediction. Brief Funct Genomics. 2011, 10 (5): 280-93.View ArticlePubMedGoogle Scholar
- Kondor RI, Lafferty J: Diffusion kernels on graphs and other discrete input spaces. ICML, vol. 2. 2002, Morgan Kaufmann Publishers Inc., San Francisco, CA, USAGoogle Scholar
- Hofree M, Shen JP, Carter H, Gross A, Ideker T: Network-based stratification of tumor mutations. Nat Methods. 2013, 10 (11): 1108-15.View ArticlePubMedPubMed CentralGoogle Scholar
- Vandin F, Upfal E, Raphael BJ: Algorithms for detecting significantly mutated pathways in cancer. J Comput Biol. 2011, 18 (3): 507-22.View ArticlePubMedGoogle Scholar
- Qi Y, Suhail Y, Lin Y-y, Boeke JD, Bader JS: Finding friends and enemies in an enemies-only network: a graph diffusion kernel for predicting novel genetic interactions and co-complex membership from yeast genetic interactions. Genome Res. 2008, 18 (12): 1991-2004. 10.1101/gr.077693.108.View ArticlePubMedPubMed CentralGoogle Scholar
- Doyle PG, Snell JL: Random walks and electric networks. AMC. 1984, 10: 12-Google Scholar
- Suthram S, Beyer A, Karp RM, Eldar Y, Ideker T: Eqed: an efficient method for interpreting eqtl associations using protein networks. Mol Syst Biol. 2008, 4: 162-View ArticlePubMedPubMed CentralGoogle Scholar
- Mirzaev I, Gunawardena J: Laplacian dynamics on general graphs. Bull Math Biol. 2013, 75 (11): 2118-49.View ArticlePubMedGoogle Scholar
- Li Y, Patra JC: Genome-wide inferring gene-phenotype relationship by walking on the heterogeneous network. Bioinformatics. 2010, 26 (9): 1219-24.View ArticlePubMedGoogle Scholar
- Vaske CJ, Benz SC, Sanborn JZ, Earl D, Szeto C, Zhu J, et al: Inference of patient-specific pathway activities from multi-dimensional cancer genomics data using paradigm. Bioinformatics. 2010, 26 (12): 237-45.View ArticleGoogle Scholar
- R Development Core Team. R: A Language and Environment for Statistical Computing. Vienna, Austria: R Foundation for Statistical Computing;. 2008, http://www.R-project.org, . ISBN 3-900051-07-0.
- MATLAB. Version 7.10.0 (R2010a). Natick, Massachusetts: The MathWorks Inc; 2010.Google Scholar

## Copyright

This article is published under license to BioMed Central Ltd. **Open Access** This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.