extfieldsofstudy:
Computer Science
Biology
Medicine

text:
Recent Advances in Network-based Methods for Disease Gene Prediction

Disease-gene association through Genome-wide association study (GWAS) is an arduous task for researchers. Investigating single nucleotide polymorphisms (SNPs) that correlate with specific diseases needs statistical analysis of associations, considering the huge number of possible disease mutations. The most important drawback of GWAS analysis in addition to its high cost is the large number of false-positives. Thus, researchers search for more evidence to cross-check their results through different sources. To provide the researchers with alternative low-cost disease-gene association evidence, computational approaches come into play. Since molecular networks are able to capture complex interplay among molecules in diseases, they become one of the most extensively used data for disease-gene association prediction. In this survey, we aim to provide a comprehensive and an up-to-date review of network-based methods for disease gene prediction. We also conduct an empirical analysis on 14 state-of-the-art methods. To summarize, we first elucidate the task definition for disease gene prediction. Secondly, we categorize existing network-based efforts into network diffusion methods, traditional machine learning methods with handcrafted graph features and graph representation learning methods. Thirdly, an empirical analysis is conducted to evaluate the performance of the selected methods across seven diseases. We also provide distinguishing findings about the discussed methods based on our empirical analysis. Finally, we highlight potential research directions for future studies on disease gene prediction.

Introduction
Genetic diseases are mostly caused by gene mutations, although recent studies reveal that epigenetic factors can also play a role [1]. Among the existing methods, linkage analysis and genome-wide association studies (GWAS) are the most fundamental approaches in disease gene prediction, as they can provide predictive biomarkers through the genetic variation studies among humans, known as single nucleotide polymorphisms (SNPs). Nevertheless, statistical analysis and biological validation of the biomarkers are costly and time consuming, as a large amount of false positives need to be analyzed further [2]. Additionally, these techniques are simply based on direct genotype-phenotype associations. However, biological molecules perform their functions in corresponding pathways in a collaborative fashion. Projecting and characterizing their specific roles and collaborations onto a wired network/graph structure can reveal more useful knowledge and provide more systematical aspects. Furthermore, in a network-based environment, the disease causing factors, such as genetic mutations, epigenetic factors and pathogens, can be tracked more efficiently by chasing network perturbations, i.e., edge or node removals, in the molecular networks [3]. Therefore, molecular networks are efficient and effective data representations, which are able to model complex interplay among the molecules through a wider viewpoint and track the potential disruptions on the biological pathways due to the disease-causing factors. As such, they have been extensively used by the computational approaches to complement and enrich existing linkage analysis and GWAS studies.
Currently, there are several molecular networks available to describe relationships between genes, such as protein-protein interaction (PPI) networks, gene regulatory networks, gene co-expression and metabolic interaction (MI) networks. Among these networks, PPI networks are the most extensively leveraged for disease-gene association prediction.
One key reason is that proteins perform a vast array of critical functions to sustain an organism's well-being. Some of these functions include biochemical reactions, metabolic reaction catalysing, DNA replication, transmission of signals between cells, and maintaining structure for cells and tissues. More specifically, proteins collaborate and interact with each other to perform biological functions, leading to many protein interactions, which can be integrated and modelled as a graph/network data structure. Given a protein interaction, a corresponding gene mutation from one of the two proteins could make existing interaction impossible, and thus loses certain important biological functions and causes diseases. Another reason is, several studies using a PPI network embody the assumption that the position of a protein is not random. Proteins associated with a common set of biological properties tend to have common topological properties in the network such as node degree and centrality [4,5]. Therefore, PPI networks can be employed in revealing protein-disease associations through the useful network-based features for proteins. However, existing PPI networks are incomplete, i.e., only a fraction of real protein interactions are detected through high-throughput experiments. Likewise they are noisy due to biased experimental evidence towards much studied disease genes [6]. Thus, an integrative approach covering various aspects of proteins such as GWAS, gene-expression, gene ontology, and other domain knowledge is both important and necessary.
In this survey, we focus on reviewing the computational methods leveraging network/graph data for disease gene prediction. First, we introduce the problem definition (i.e., node classification and link prediction) for disease gene prediction with different types of graph inputs. Second, we classify the network-based methods into three categories and provide a brief introduction for these methods. Third, we select representative methods from each category and conduct a comprehensive empirical study on them. The three categories are listed in the following.
• Network diffusion methods. The diffusion methods employ random walk techniques for influence propagation in different networks (e.g., PPI networks or phenotype-gene networks) for disease gene prediction. • Machine learning methods with handcrafted graph features.
Various features for diseases and genes are first extracted from input graph data, and then fed into traditional machine learning models (e.g., Random Forest) for predicting disease-gene associations. • Graph representation learning methods. Instead of using handcrafted features for disease gene prediction, graph representation learning methods automatically learn the latent features or embeddings for diseases and genes by matrix factorization, graph embedding and graph neural network techniques.
Former surveys on network-based methods [3,5,7], which were published about ten years ago, present pioneering endeavours on network analysis and bring to light the importance of network data for disease gene prediction. Nowadays, we witness the usefulness of incorporating network data in several areas ranging from drug discovery to disease gene identification through novel network-based algorithms. In this survey, we aim to bring together up-to-date methods for disease gene prediction and provide a wider perspective to this important problem. In addition, there are two recent surveys which review the recent network embedding efforts on biomedical networks [8,9]. In [8], the authors present an overview of the existing network embedding methods and their applications in biomedical data science, e.g., pharmaceutical data analysis, multi-omics data analysis and clinical data analysis. However, they do not conduct any empirical evaluation for the introduced methods. In [9], the authors introduce the recent graph embedding methods and their applications in biomedical networks. In particular, they further select 11 graph embedding methods and perform a systematic evaluation on 5 different tasks, i.e., drug-disease association prediction, drug-drug interaction prediction, PPI prediction, protein function prediction and medical term semantic type classification. Yet, they do not touch the task on disease gene prediction and its various state-of-the-art approaches. In this survey, we aim to conduct an empirical analysis on disease gene prediction task using different methods from the above three categories. Besides, we further apply and evaluate recent graph embedding methods including heterogeneous network embedding and multi-view network embedding for disease gene prediction.
The rest of this survey is organized as follows. In Section 'Problem Definition for Disease Gene Prediction', we cast the task of disease gene prediction as an instance of node classification or link prediction based on different graph inputs. Then, we introduce various network-based diseasegene prediction methods in details in Section 'Network-based Methods for Disease Gene Prediction'. Next, in Section 'Empirical Comparison', we perform a comprehensive empirical evaluation for 14 representative methods. Finally, in Section 'Future Perspectives', we discuss potential future research directions in disease-gene association prediction problem and we conclude this paper in Section 'Conclusion'.

Problem Definition for Disease Gene Prediction
Network-based disease gene prediction leverages graph/network data as inputs to predict disease-causing genes. In particular, different types of graphs have been exploited for this purpose, including homogeneous graphs, heterogeneous graphs and multi-view/multiplex graphs. A homogeneous graph refers to a graph with a single type of nodes and a single type of edges, while a heterogeneous graph contains different types of nodes and edges. In addition, a multi-view or multiplex graph is a collection of graphs with the same set of nodes and different types of edges (e.g., edges from different views). Figure 1 shows the examples of different types of graph inputs. PPI network in Figure 1(a) is a homogeneous graph, while phenotype-gene network in Figure 1(b) is a heterogeneous graph. Figure 1(c) shows a multi-view graph for proteins, containing three views from the perspectives of PPI, GO similarity and gene expression.
Based on the above graph inputs, network-based disease gene prediction can be treated as a node classification or link prediction task. Node classification aims to infer the disease label of the unlabelled genes by utilizing the known disease genes, whereas link prediction aims to predict disease causing genes by utilizing gene-disease associations. Next, we give a formal definition for these two tasks from the perspective of disease gene prediction.

Node Classification
Figure 2(a) shows the node classification tasks, which is to predict the label of the genes of which disease associations are unknown, given known labels on some genes/nodes.
More formally, assume that we have a homogeneous graph G = (V, E) where V is the set of nodes/genes and E shows relationships between nodes. A subset of genes V labeled ⊂ V represents known disease-causing genes, while V unknown = V \ V labeled represents the set of genes of which disease associations are unknown. The formulation of node classification on G is to predict the labels for the nodes in V unknown .  This node classification task in a heterogeneous graph or multi-view graphs can be similarly defined.

Link Prediction
The link prediction is a common task to reveal relationships between the objects especially in recommendation systems and social network analysis. Given a network G, denoted as G = (V, E) and the nodes v i , v j ∈ V , the task of link prediction is to provide a measure of proximity/similarity between the nodes v i and v j . In particular, we consider a heterogeneous graph G = (U, V, E) for gene-disease association prediction. The vertices are grouped into two sets U and V , representing the set of genes and the set of diseases, respectively. E includes the edges in U , the edges in V and the edges between U and V (i.e., known disease-gene associations). The goal of gene-disease association prediction is to predict unknown links between U and V . Figure 2(b) shows the disease-gene association prediction in a heterogeneous disease-gene network. The edges in black show the existing associations between diseases and genes. Meanwhile, the dashed line represents a potential association between the pair of g 4 and d 3 , which is to be predicted by computational methods.

Network-based Methods for Disease Gene Prediction
In this section, we present a comprehensive review of network-based methods for disease gene prediction, namely diffusion-based methods, traditional feature-based methods and graph representation learning methods as illustrated in Figure 3.

Network Diffusion Methods
Diffusion-based methods working on biological networks are mostly adopted from pioneer graph-based semi-supervised algorithms such as [10][11][12]. In disease gene prediction problem, they are widely exploited in the analysis of the biological pathways especially the pathways that are closest to the known disease genes. Starting from known disease genes, they diffuse along the biological network through random walks. Next, we introduce diffusion methods by walking in different networks.

Random Walk in PPI Network
Random walk with restart (RWR) is the most extensively used algorithm especially in prioritization of disease genes. Differently than a basic random walk, it is able to jump back to any seed node with probability r at each iteration. Formally, it is defined as follows: where W is the column-wise normalized adjacency matrix of the network. In particular, p t is the probability vector of being at node i at time step t in its i-th entry and p 0 is the initial probability vector holding the probabilities of being at known disease nodes (seeds) [13]. Initially, each known disease protein has a uniformly distributed probability as the sum of the probabilities equal to 1. Total number of iterations is determined by the condition which satisfies the L1 norm difference between p t and p t+1 smaller than a pre-defined threshold (e.g., 10 −6 ).
PRINCE [14] adopts RWR to a weighted PPI network through a weight function and also utilizes the disease similarities as prior probabilities. On an unweighted PPI network, PRINCE basically performs random walk with restart (Eq. 1) with adjusted prior probabilities based on the disease similarity scores. VAVIEN [15] is proposed to measure the topological similarity of proteins by formulating their interactions with Pearson correlation coefficient as a topological profile. To compute this profile, they employ the random walk proximity as a feature between seed and candidate proteins, so that the proteins with similar interactions will have a similar topological profile. Then, they prioritize the candidate disease genes based on the topological profile scores. In [16], the authors introduce a method called ORIENT, which prioritizes the candidate disease genes with RWR. They perform RWR on the adjacency matrix where the weights of interactions close to the known disease genes are properly reinforced by computing the shortest path distance to the disease genes. In [17], the authors propose a method called DP-LCC to construct diffusion profiles for the disease genes and the candidate genes separately based on their RWR on the PPI and the phenotype similarity network. Candidate genes are prioritized according to their diffusion profile similarities with the query disease. NPDE [18] utilizes non-disease essential proteins by formulating a dual flow network propagation method to prioritize candidate disease genes. It uses the assumption that if non-disease essential proteins exist as neighbors of a candidate protein, the protein is unlikely to cause a disease. Eventually it formulates this assumption as the negative flow in the prior information of the network propagation and the positive flow is allocated for the disease proteins.

Random Walk in Heterogeneous Network
For diffusion methods in heterogeneous networks, we further divide them into two categories with respect to their task as node classification or link prediction.
We start with node classification methods. BioGraph, [19], is a data integration and data mining platform. It utilizes stochastic model of random walks with restarts for a given candidate gene prioritization query as incorporating multiple data sources such as disease, pathway and GO annotation. In [20], two methods, CrossRank and CrossRankStar, formulate disease gene prioritization problem as optimization problems based on network propagation. They model two types of networks, network of networks (NoN) for CrossRank and networks of star networks (NoSN) model for CrossRankStar and both models incorporate tissue specific molecular networks. In SLN-SRW [21], the authors first aim to integrate biomedical data from heterogeneous sources including multiple ontologies and databases. For this propose, a simplified Laplacian normalization based supervised random walk algorithm is employed to learn the edge weights of the integrated network. RWR is then performed on this integrated network for disease gene prediction.
Link prediction methods aim to predict disease-gene associations in heterogeneous phenotype-gene network, where PPI network and phenotype network are connected through known phenotype-gene relationships. RWRH [22] aims to prioritize proteins based on their relevance to disease proteins. Basically, RWRH extends RWR algorithm to the heterogeneous phenotype-gene network through inter and intra transitions between PPI network and phenotype network. It is performed for a given query disease and corresponding disease genes are considered as seed nodes. In [23], a RWRH-based method called RWPCN is proposed to predict and prioritize disease genes on an integrated network comprising human protein complexes, protein interaction network, and phenotype similarity network. The basic difference from RWRH is that RWPCN operate random walks in an additional protein-complex networks. Likewise, a RWRH-based approach to predict malaria-associated genes on an integrated network by integrating human-human, parasite-parasite and human-parasite protein interactions in [24]. BiRW [25], aims to capture circular bigraph patterns based on the assumption that the relation among phenotype-gene associations can be characterized by these patterns. For this purpose, they employ a bi-random walk algorithm and aim to Network propagation on a PPI network. VAVIEN [15] Random walk and correlation on a PPI network. ORIENT [16] Neighbor-favoring RWR on a PPI network. DP-LCC [17] RWR-based diffusion profiles based on PPI and phenotype similarity network. NPDE [18] Network propagation with dual flow on a PPI network.

RW in heterogeneous network (Node classification)
BioGraph [19] Stochastic RW on an integrated network containing 21 publicly available curated databases. CrossRank [20] Optimization based on network propagation on a heterogeneous network with various aspects. SLN-SRW [21] Supervised RW to learn edge weights of the integrated network and RWR for prediction.

RW in heterogeneous network (Link prediction)
RWRH [22] RWR on a heterogeneous phenotype-gene network. RWPCN [23] RWR on a heterogeneous network with phenotypes, genes and protein complexes. RWRH-Malaria [24] RWR on cross-species PPI networks for human and parasite. BiRW [25] RWR on a heterogeneous network with a phenotype, gene and the phenotype-gene associations. RWRMH [26] RWR on a multiplex heterogeneous network of protein interactions and disease networks.
reconstruct the missing associations globally through the gene-disease association prediction. In a recent study [26], the authors propose two extensions of RWRH, which are RWRM and RWRMH. Former method performs RWR on a multiplex network (i.e., all nodes are same type) composed of three layers of networks containing PPI, co-expression and pathway associations of proteins. Latter method incorporates a disease-disease network based on phenotype similarities, and gene-disease bipartite associations in addition to the aforementioned multiplex network as multiplex-heterogeneous network so that the random walker can jump to a network containing different sets of edges and nodes. Overall, a summary of different diffusion-based methods is presented in Table 1.

Machine Learning Methods with Handcrafted Features
Supervised machine learning methods Supervised machine learning methods employ features and/or kernels to integrate various biological concepts, thus have been extensively studied in disease gene prediction. In [27], DERanking is proposed to benchmark four different strategies and prioritize candidate genes according to network analysis of their differential expression. The reason of incorporating differential expression as prior knowledge is based on the assumption that the strong disease candidates tend to be surrounded by differentially expressed neighbors. Three of the four benchmarking strategies are distinct random walk-based strategies from exponential diffusion kernel approach and one of them is direct neighborhood analysis. These strategies are performed on four networks comprising functional or psychical interactions of proteins for disease gene prediction. In [28], a method called BRIDGE is introduced for prioritization of disease genes by integrating various gene aspects including PPI, protein sequence data, gene expression data, KEGG database and GO, through a weighting scheme. This scheme is attained through a multiple linear regression model with lasso penalty, which determines the phenotypic similarity between two diseases based on the functional similarities between their associating genes. Accordingly, the model is capable of identifying genes associated with the diseases whose genetic bases are completely unknown. In [29], multiple aspects of proteins including known gene-disease associations, protein complexes, PPIs, pathways and gene expression profiles are integrated by Markov random field (MRF) and Bayesian analysis for disease gene prioritization. Initial prior probability of the MRF is set by Gibbs sampling. Metagraph representations [30] are proposed for disease gene prediction, which utilize both PPI network and biological annotations called keywords through heterogeneous subgraphs. By counting the occurrences of proteins within a specific subgraph type in terms of connectivity patterns, feature vectors of proteins are constructed, so that the proteins, which are functionally similar but located far away in a PPI network still have a chance to have similar representations in case they co-occur within the same subgraph type. In [31], the authors employ a multimodal deep belief net named dgMDL to predict diseaseâŁ"gene associations for all known diseases instead of predicting associated genes for a specific disease. This could alleviate the risk of overfitting due to the small number of positives and a large number of features in disease gene prediction problem. They first train two multimodal DBN, one on PPI network and the other on GO-based similarity network, and then they train a final joint DBN for prediction based on the outputs of the initial DBNs.
PU learning methods Supervised models in disease gene prediction may suffer due to all provided evidence serves as positive samples and the negative samples remain unlabeled. Thus, positive-unlabeled (PU) methods arise to tackle this problem. They are usually based on weighting the positive samples and unlabeled samples to promote the prediction performance during the learning. ProDiGe [32] is a PU learning method for prioritization of candidate genes by enabling multiple data source integration such as PPI network and phenotype similarities through multitask learning strategy. In this way, scoring of the genes for prioritization is performed by considering disease-gene pairs instead of the individual genes. PUDI [34] partitions unlabeled set (i.e., negatives) into four sets namely, reliable negative set RN, likely positive set LP, likely negative set LN and weak negative set WN based on features extracted from PPI, GO terms and protein domain. The weighted support vector machines are then used to build a multi-level classifier based on these sets and positive training set. CATAPULT [35] performs a biased SVM to classify gene-phenotype pairs on a combined heterogeneous gene-trait network including gene-phenotype, gene-gene interactions across multiple species. Features for SVM are derived from walks in the network. EPU [36] is an ensemble-based PU learning method, which integrates data from multiple biological sources for training PU learning classifiers consists of weighted KNN, weighted naive Bayes and multi-level support vector machine. It starts with individual label propagation on gene expression network, PPI network and GO similarity network. Then, the obtained gene weights are combined and fed into the ensemble learner. PEGPUL [37] is an ensemble PU learning model to combine a multi-level SVM, a weighted KNN and a weighted decision tree for disease gene prediction. First, it extracts reliable negative genes by utilizing a co-training algorithm. Then, it constructs a similarity graph through metric learning by using PPI, protein domain and GO terms and performs a multi-rank-walk on the constructed graph to propagate labels prior to feeding the genes into the ensemble. A summary of supervised methods and PU learning methods is presented in Table 2.

Graph representation learning methods
Recall that we need to manually extract various features for the methods introduced in Table 2, which is tedious and requires domain knowledge.
Recently, graph representation learning methods [38,39], which can automatically learn the latent features/representations for the nodes, have acclaimed wide attentions in bioinformatics and biomedical applications DERanking [27] 4 ranking strategies based on whether a gene is surrounded by highly differentially expressed genes. BRIDGE [28] A regression model with lasso penalty to weight 5 genomic data sources. IMRF [29] An improved MRF method on multiple networks, e.g., PPI, pathways, protein complexes, etc. Metagraph+ [30] Using metagraph features extracted from a heterogeneous network with PPI and gene keywords. dgMDL [31] Multi-modal deep belief nets on PPI network and gene network based on GO similarities.

PU learning
ProDiGe [32] Biased SVM using features derived from multiple data sources [33] including PPI. PUDI [34] Multi-level classification with biased SVM on features extracted from PPI, protein domain and GO. CATAPULT [35] Biased SVM with features derived from walks in a heterogeneous phenotype-gene network. EPU [36] Ensemble PU learning using various features derived from PPI and GO similarity networks. PEGPUL [37] A perceptron ensemble of graph-based PU learning from 3 base classifiers SVM, KNN and CART. [8,9]. In this section, we review graph representation learning methods designed for disease gene prediction. In particular, we divide them into four categories, namely, matrix factorization, graph embedding, graph neural network and hybrid methods as shown in Figure 3.

Matrix factorization
Matrix factorization (MF) techniques have been widely used for link prediction in bioinformatics, e.g., PPI prediction [40], drug-target prediction [41,42], miRNA-disease association prediction [43,44], drugpathway association prediction [45], etc. Here, we introduce various MF methods developed for disease-gene association prediction. Basically, MF methods in gene-disease association prediction, such as inductive matrix completion (IMC) [46], probability-based collaborative filtering (PCFM) [47] and manifold learning [48], aim to learn the latent factors for diseases and genes from the gene-disease association matrix. In addition, they can also specify the factorization process by including additional constraints into the objective function and thus MF techniques are useful for revealing important associations between diseases and genes.
In [46], IMC constructs gene and disease features using different sources including human geneâŁ"disease associations, gene-expression from different tissue samples, functional interactions between genes, geneâŁ"phenotype associations of other species, disease similarities and disease-related textual data from OMIM database. Then, they form the geneâŁ"disease association matrix using these features and formulate an optimization problem to recover unknown low-rank matrix using observations from the constructed associations matrix. Their inductive approach is capable of making predictions for a query disease with no previously known gene associations. In [47], PCFM exploits the geneâŁ"gene, geneâŁ"disease relationships, gene-disease linkages between orthologous genes and eight non-human species diseases and diseaseâŁ"disease similarity associations. They propose two probabilitybased collaborative filtering models, one with an average heterogeneous regularization and another with personal heterogeneous regularization using vector space similarity to predict gene-disease associations. The advantage of PCFM than the collaborative filtering is that PCFM enables probabilistic consideration in gene-disease associations instead of binary evaluation. Manifold learning [48] uses gene-disease association data for prediction and assumes that the geodetic distance between any associated gene-disease pairs are shorter than non-associated gene-disease pairs in a lower dimensional manifold. An optimization function is defined based on this assumption and singular value decomposition is employed to solve the optimization problem. Collage [49] applies collective matrix factorization (CMF) to combine a wide range of 14 data sets including RPKM-normalized RNA-seq transcriptional profiles and phenotype ontology annotations. Then, it performs chaining on the learned latent matrices to obtain gene profiles for prioritizing bacterial response genes in Dictyostelium. Similarly, Medusa [50] also builds a collective matrix factorization model for data fusion of a large-scale collections of heterogeneous data and performs chaining on the learned latent matrices to establish connections between non-neighboring nodes in the fusion graph. It formulates the growing of the modules as a sub-modular optimization program. The proposed method is capable of both associating genes with diseases and detecting disease modules. In [51], an unsupervised learning model based on matrix tri-factorization (tri-NMF) framework is proposed to detect disease causing genes from pan-cancer data. In particular, it exploits both the similarities of mutation profiles of different cancer types and gene interaction network. A method called GeneHound [52] adopts Bayesian probabilistic matrix factorization (BPMF) for disease gene prioritization problem. GeneHound uses gene-disease associations as partially observed data and a raw fusion is employed to integrate multiple genomic data sources including literature-based phenotypic and literature-based genomic information. Then, the Bayesian data fusion model jointly learns gene and disease latent factors and corresponding gene and disease-association matrices for disease-gene association prediction.

Graph embedding methods
Graph embedding methods learn low-dimensional and continuous vector representations of nodes through a neural network. For example, SkipGram [53] architecture is an extensively used architecture to construct associations between the node and its neighborhood. The neighborhood of the nodes is extracted through the random walks. Endeavours [54][55][56], such as DeepWalk [55] and node2vec [54], generate node representations such that the nodes lying within the short random walk distance have similar embeddings. There are also several random-walk based embedding methods proposed for disease gene prediction as follows.
SmuDGE [57] combines diseaseâŁ"phenotype and geneâŁ"phenotype associations with interactions between genes to generate a corpus for SkipGram-based representation learning. Then, it builds an artificial neural network (ANN) to predict geneâŁ"disease associations. In [58], HeteWalk builds a weighted heterogeneous network by joining six public data sources including PPI, miRNA similarity network, and disease phenotype similarity network and then performs SkipGram based network embedding. It further applies meta-path selection to eliminate potential redundant and misleading information caused by the heterogeneous walks with multiple entities. HerGePred [59] also performs SkipGrambased graph embedding on a heterogeneous network consisting of a PPI, disease-protein associations, protein-GO associations, and genedisease associations. Eventually, HerGePred predicts novel disease-gene associations in two different manners. It can directly calculate the cosine similarity between the embedding vectors of the query disease and the proteins. It can also perform random walk on disease-gene network, which is reconstructed based on the calculated cosine similarities between embeddings.

Graph neural networks
Graph neural network (GNN) is an advanced deep learning model for graph data [69] and has been applied for various bioinformatics tasks [70][71][72]. Graph convolutional network (GCN), graph attention network (GAT) and graph auto-encoder (GAE) are representative GNN models. For example, GCN aims to learn node embeddings by implementing the convolution operation on a graph based on the properties of neighborhood nodes. Here, we will have a quick review on GNN models for disease gene prediction as follows.
In [60], the authors introduce GCAS, which is an adaptation of graph convolutional network for disease gene prioritization. First, they construct a heterogeneous network consisting of ontological associations as well as curated associations including genes, diseases and pathways from multiple sources. They then perform direct spectral convolution to successively propagate the influence to the neighborhood and infer novel disease-gene associations. In [61], a graph convolutional network-based disease gene prioritization method called PGCN exploits a heterogeneous phenotype-gene network and the additional information for the nodes (e.g., disease ontology similarity, gene expression data, etc) for disease gene prioritization. In [62], the authors introduce the variational graph auto-encoder (VGAE) for gene-disease association prediction in a heterogeneous disease-gene network.

Hybrid methods
Here, we denote the methods, which combine the representation learning methods with other techniques to derive features, as hybrid methods.
A number of methods combine graph embedding (e.g., node2vec) with other methods for feature engineering. In [63], a method called N2VKO Table 3. Graph representation learning methods for predicting disease-gene associations.

Categories
Methods

Method descriptions
Matrix factorization IMC [46] Inductive matrix completion incorporating gene and disease features from multiple data sources. PCFM [47] Probability-based collaborative filtering models with different regularization terms. Collage [49] Collective matrix factorization using 14 datasets including genes, GO terms, KEGG pathways, etc. Medusa [50] Collective matrix factorization on a data fusion graph with 16 data matrices. Tri-NMF [51] Matrix tri-factorization on mutation profile similarities for different cancer types and PPI network. GeneHound [52] Bayesian matrix factorization on OMIM associations with genomic and phenotypic data sources.

Graph embedding
SmuDGE [57] RW-based embedding and an ANN on pair of disease and gene feature vectors. HeteWalk [58] RW-based embedding on a heterogeneous network with genes, miRNAs and diseases. HerGePred [59] RW-based embedding on a heterogeneous network with diseases, symptoms, genes and GO terms.
Graph neural networks GCAS [60] Graph convolution on heterogeneous association network for rare diseases (HANRD). PGCN [61] GCN to learn the embeddings for phenotypes and genes in a disease-gene heterogeneous network. VGAE [62] VGAE to learn embeddings for diseases and genes in disease-gene networks for gene prioritization.
integrates the node2vec embeddings extracted from PPI network with the biological annotations for disease-gene association prediction. In [64], the proposed method N2A-SVM employs node2vec embedding of the genes from a PPI network and then performs dimension reduction with autoencoder to predict ParkinsonâŁ™s disease genes. In [65], the authors propose to combine graphlet representations with node2vec embeddings for disease gene prediction.
[66] builds a network-based framework for gene-disease association prediction, which exploits disease similarity and gene similarity graphs to construct two GCNs separately for diseases and genes. Then, GCNs are trained by using corresponding disease and gene features and optimized with label information with matrix factorization. In [67], the authors propose a heterogeneous network embedding method, HNEEM, for genedisease association prediction by ensemble learning. The constructed heterogeneous network consists of gene-disease associations, genechemical associations ans disease-chemical associations. HNEEM first extracts graph embeddings with six embedding methods and then feeds these embeddings into a random forest classifier for disease gene prediction. DW-GCN [68] is proposed to combine DeepWalk and GCN for gene-disease association prediction on a heterogeneous disease-gene network. Final predictions are derived using the output of a GCN decoder and the probability distribution derived from DeepWalk. Table 3 summarizes various graph representation learning models for disease gene prediction.

Empirical Comparison
In this section, we conduct experiments to evaluate the performance of various network-based methods for disease gene prediction.

Datasets
We collect two networks for proteins, namely, a PPI network from the IntAct database [73] and a protein functional similarity network based on GO terms [74]. In particular, we first calculate the pairwise functional similarity between proteins based on G-SESAME 1 [75], and subsequently build a graph using the K nearest neighbor (KNN) algorithm and we set 1 G-SESAME: http://bioinformatics.clemson.edu/G-SESAME/ K = 10 in all of our experiments. Overall, there are a total of 12,901 nodes (i.e., proteins) in both networks, with 96,845 edges in the PPI network and 107,508 edges in protein functional similarity network.
There are several publicly available databases for gene-disease associations as shown in Table 4. In our experiments, we acquired the associations from the OMIM database. Given a specific disease/phenotype (e.g., Alzheimer's disease), we extract MIM IDs from OMIM Morbid Map and retrieve their corresponding protein IDs from the Uniprot [76] conversion tool. Each protein node is subsequently assigned a binary label to represent whether it is a causative protein for this disease. In our experiments, we focus on seven diseases, namely, Alzheimer's disease (11), breast cancer (24), colorectal cancer (34), diabetes mellitus (37), obesity (19), lung cancer (15) and prostate cancer (17). Note that the number of positive proteins for each disease is included in the parentheses. The data and supplementary materials are available at https://github.com/sezinata/SurveyDGP. Table 4. Publicly available databases for gene-disease associations.

Selected methods for evaluation
We select a subset of methods from different categories for evaluation. For example, we select RWRH [22] from network diffusion methods and IMC [46] from matrix factorization methods. For machine learning methods with hand-crafted features, we select Metagraph+ [30] from supervised methods, and Catapult [35] and ProDiGe [32] from PU learning methods. Furthermore, we select a graph embedding method node2vec [54] and a hybrid method N2VKO [63]. Table 5 shows the availability of the source codes of these methods. As aforementioned, disease gene prediction is a typical node classification or link prediction task. Therefore, the state-of-the-art social network analysis methods for node classification or link prediction can be exploited for disease gene prediction. In our experiments, we also include HIN2Vec [83], HeGAN [84], MVE [85], mvn2vec [86], DMNE [87] and MANE [88] in our evaluation study. These methods are introduced as follows and Table 6 shows the availability of their source codes.
• HIN2Vec [83]: A heterogeneous network embedding approach, which samples heterogeneous paths called meta-paths and feeds them into a neural network. We combined PPI network (PPI view) and functional similarity network (GO view) to form a single heterogeneous graph, where edges from different views are assigned to a different type of relation. • HeGAN [84]: A heterogeneous network embedding approach, which utilizes the adversarial principle. We perform it on the constructed single network as described in HIN2Vec. • MVE [85]: A state-of-the-art multi-view network embedding approach which maintain the collaboration between views by regularizing the Euclidean norm between view-specific embeddings and the final embeddings. The parameter η is used to control the weight of regularization. Since we conduct our experiments on unsupervised models, we adopt the unsupervised version. • mvn2vec [86]: A state-of-the-art multi-view embedding approach.
There are two proposed versions. Since they both have similar results we report only mvn2vec-r version which regularizes the Euclidean norm between view-specific embeddings, controlled by a hyperparameter γ. When γ is set to zero, it becomes equivalent to node2vec performed on a single view. • DMNE [87]: A multi-view network embedding algorithm which is also capable of generating embeddings for many-to-many node mappings across views. Note that in our dataset only one-to-one mappings exist. We adopt their proximity disagreement formulation, due to its flexible assumption and better empirical performance. • MANE [88]: A random-walk sampling-based multi view embedding algorithm, which unifies diversity, first-order collaboration and novel second-order collaboration principles in a framework. There are two hyperparameters α and β to regularize the contribution of the principles.
The datasets that we utilize for the studied methods in this survey are as follows. node2vec and RWR are simply performed on the PPI network. In IMC, Catapult, ProDiGe and RWRH we use the PPI network, phenotype similarity network [89] and the protein-phenotype associations. Metagraph+ and N2VKO leverage the PPI network and protein-keyword associations retrieved from Uniprot [76]. HIN2Vec, HeGAN, MVE, mvn2vec-r, DMNE and MANE utilize GO and PPI networks described in Datasets section. For methods using protein-phenotype associations, we eliminate the test data associations to prevent data leakage.
All methods are performed using the implementations provided by their respective authors unless stated otherwise, and we apply their suggested parameter settings for the hyperparameters. For multi-view graph embedding models (i.e., MVE, mvn2vec-r, DMNE and MANE) we set walk length to 10, number of walks per node to 5, negative sampling size to 10, windows size to 3 and random walk parameters of node2vec (p, q) to 1. All methods have D = 128 as the dimension of the final embedding. Differently, for heterogeneous graph embedding model HIN2Vec we set walk length to 30 and number of walks per node to 10. For graph embedding methods (i.e., HIN2Vec, HeGAN, MVE, mvn2vec-r, DMNE and MANE), the learned final embeddings are fed into the logistic regression model and for all methods five-fold cross-validation is performed for training.

Results and Discussion
We demonstrate the performance comparison of 14 state-of-the-art methods in Table 7 in terms of AUC. In particular, we group these methods into three groups based on their input data for easy comparison, namely homogeneous graph, heterogeneous graph and multi-view graph.
In addition, we also performed over-sampling with SMOTE [90] for the network embedding methods. The oversampling results as well as the comparison results in terms of ranking-aware metrics are provided in our supplementary materials. Based on the results in Table 7, we can have the following observations. Firstly, we can observe that RWR and node2vec working on a homogeneous PPI network achieve low performance as expected. Therefore, we are motivated to integrate different data sources into a heterogeneous network or multi-view network to improve the prediction performance.
Secondly, various methods working on a heterogeneous network perform well for disease gene prediction. ProDiGe and Catapult, as PU learning methods, are very promising to address the imbalanced data issue for disease gene prediction and both incorporate the phenotype similarity network and phenotype-gene associations. In particular, ProDiGe achieves an AUC of 0.7763 and is the second best performer among these 14 methods. N2VKO and Metagraph+ first work on feature extraction/selection in a PPI and keyword network, and then undergo an oversampling procedure. Both of the methods achieve a decent performance. Note that the random walk parameters of node2vec (p, q) in N2VKO are not tuned to maintain consistency with random walk sampling based embedding methods. Heterogeneous graph embedding methods including HIN2Vec and HeGAN hinge on different principles and perform very well. HIN2Vec utilizes random walks and negative sampling with a neural network model, while HeGAN utilizes adversarial learning principle in which a discriminator and a generator compete with each other as in a mini-max game. In particular, HeGAN's performance highly depends on the used pre-trained embeddings as inputs and thus careful initialization is critical in this model. RWRH also performs very well and it is a good alternative to the network embeddings methods. However, its performance depends on the tuning process, e.g., the setting of the restart probability.
Lastly, multi-view methods are also robust and useful tools for disease gene prediction. mvn2vec-r and MANE are two random walkbased embedding methods employing Skip-gram for learning the final

FUTURE PERSPECTIVES
In this section, we present possible future directions that may address current challenging issues for more accurately predicting disease genes.

Learning with Limited Labeled Data
Learning with limited labelled data has been a challenging task in disease gene prediction. Existing efforts to overcome this difficulty include PU learning and oversampling techniques. For example, PU learning methods [32,35,34] select likely-positive samples from the unlabeled data to tackle the problem. Oversampling of minority class samples (e.g., SMOTE [90]) is also a common strategy to address this challenge. However, both strategies might need a tremendous tuning effort for difficult scenarios to attain a satisfactory performance. Developing more efficient and accurate models leveraging these strategies could be a promising direction.
Recently, generative adversarial networks (GAN) have been successfully applied to augment the data for various tasks, e.g., image classification [91,92], speech recognition [93], etc. It is thus worth investigating GAN-based techniques for disease gene prediction with limited labels in the graph data. In addition, researchers also employ GAN to boost the PU learning [94] and oversampling processes [95]. Therefore, it would be very interesting to see the efforts that combine GAN with PU learning or oversampling for disease gene prediction in the future.

Attention Mechanisms and Data Integration
Graph Attention Networks (GAT) [96], as extension of graph convolutional networks, assign different weights to different neighbours with masked self-attention layers. In particular, this self-attention operation enables the model to focus on more important neighbours. Due to the attention mechanism, GAT have been applied to generate accurate graph embeddings for various tasks in recommendation systems [97,98] and bioinformatics [99]. Therefore, it is also promising to develop node-level attention mechanisms for diseases and genes in different types of graph inputs for network-based disease gene prediction.
Moreover, it is common to integrate different graph data sources through multi-view techniques [100]. In these multi-view techniques, it is important to reveal the contributions of each network to the final prediction performance, so that it would be possible to prioritize the networks based on their significance. Graph-level attention mechanisms [88] can be useful in multi-view graphs for this purpose. In addition, hierarchical attention mechanisms [101] can also be applied for disease gene prediction by combining both node-level and graph-level attentions.

Sampling Strategies for Multi-View Inference
The study N2VKO [63] demonstrates that node2vec embeddings achieve an inferior prediction performance on some diseases such as the obesity and prostate cancer. The reason is that the disease-associated proteins are scattered in the network with a greater hop-distance between them, which limits the prediction power of a RW-based sampling method (e.g., node2vec). In these cases, it is good to develop models that can utilize other structures in the network. Specifically, this problem can be tackled by sampling strategies which may not consider only the local neighborhood of a node in a network. For example, we can adopt a collaborative sampling strategy, which can consider all the views of multi-view networks or utilize the attributed nodes during the sampling procedure. It would thus minimize the effect of local neighborhoods and help to increase the prediction performance.

Single-cell Data
Recently, single-cell RNA-seq (scRNA-seq) techniques become popular with the advancements in next-generation sequencing. Compared to traditional bulk RNA-seq [102] analysis, they enable cell-level sequencing to capture cell-to-cell heterogeneity. In particular, several methods have been developed to infer gene relationships [103] and gene regulatory networks [104] from single-cell gene expression data. Disease gene prediction can thus benefit from such inferred gene relationships and gene regulatory networks.
In addition, precise identification of cell states and types is crucial to understand the disease related mechanisms so that the scientists can detect correlated expression levels of genes across a homogeneous population of cells [105]. Community detection algorithms such as louvain [106] and its similar version leiden [107] are very popular tools to identify cell clusters.
Furthermore, it is possible to model single-cell gene expression data as graphs and we can thus employ graph embedding methods for cell type identification through graph clustering [108].

Explainable Machine Learning Models
Decision trees, linear regressions and logistic regressions are commonly used explainable machine learning models. The rise of the neural networks and deep learning in many areas such as video, speech and text processing comes with the need of explanation for the "black box" nature of these models. As we know, it is very important for medical disease-related predictions to provide information on why the model performs a certain prediction. However, the graph representation learning methods covered in this review are also lack of interpretability. We are thus highly motivated to develop explainable machine learning models for disease gene prediction.
Recently, knowledge graphs (KG) have been integrated with useritem graphs for accurate and explainable recommendation [98,109]. A recent work [110] adopts KG and graph neural networks for explainable drug-drug interaction (DDI) prediction. Similarly, we can also construct knowledge graphs for diseases and genes using various side information. For example, we can obtain the medical KG with diseases, drugs and symptoms, and gene ontology KG with genes and their functional annotations. By integrating advanced graph neural network techniques (e.g., GAT) and knowledge graphs, we expect to achieve accurate and explainable predictions for novel disease-gene associations.

Conclusion
Discovering disease causing genes and analyzing their roles in the disease are not only critical for understanding disease formation mechanism, but also extremely important for designing appropriate drugs for corresponding clinical therapies. Linkage analysis and genome-wide association studies (GWAS) form the basis of disease gene prediction. However, they generate a large number of false positives in their statistical analysis of biomarkers. Computational approaches are efficient and complementary tools to help biologists filter out noisy false positives and provide a list of genes which are worth for further clinical study. In this survey, we focus on network-based research, leveraging various networks in their problem formulation for disease gene prediction. We provide an organized, up-to-date overview of state-of-the-art networkbased approaches. We also perform an empirical comparison study on different computational methods based on different graph inputs.
Generally, the methods in both heterogeneous network and multi-view network perform very well for disease gene prediction. In particular, multiview methods with Skip-gram architecture can serve as robust and useful tools, not only for disease gene prediction but also for visualization and clustering purposes. Its low computational cost with a minimal tuning necessity and high prediction performance, make it a good alternative to the other learning methods. These techniques could be further investigated by considering attention mechanisms or different network sampling strategies instead of random walks. Moreover, for network-based disease gene prediction analysis, constructing reliable networks is critical, so future research need to focus on predicting novel interactions and removing noisy interactions. The ultimate success of the disease gene prediction will depend on the parallel improvements both in the experimental techniques by biologists and clinicians to provide rich and reliable biological data sets , and in the advanced computational techniques by computer scientists to provide efficient and robust ways to discover novel knowledge and insights from the biological data.

Key Points
• Uncovering disease-causing genes is a fundamental objective of human genetics, while computational prediction of disease-genes provides a low-cost alternative. • We classified and reviewed state-of-the-art networkbased approaches for disease gene prediction with different types of graph inputs. • We empirically evaluated various selected methods, including some advanced methods for social network analysis, for disease gene prediction. • We also discussed possible future directions that may address current challenging issues for more accurately predicting disease genes.


Levels of intelligent information access using ontology transformations

. Current techniques of intelligent information access have surpassed the mere provision of static information. They attempt to overcome the limitations of traditional content delivery processes by exploiting information retrieval techniques. While the existing literature has extensively explored the adoption of these techniques, comparatively little notice has so far been taken of their application as ontology transformations. This paper aims to explore levels of intelligent information access from a practical perspective. Applying the theoretical framework of information retrieval techniques, we identify and define levels of information access and propose respective ontology transformations. For this purpose, we decided to use an ontology-editing tool for modeling, transforming and displaying information about the domain of Smart Homes.

Introduction
Classic technical documentation still considers end-user products to be manufactured for a specific purpose and used in predefined and predictable situations. This understanding also applies to the rather static and extensive information products. However, as Leukert [1] points out, the expectations of users for the right amount of personalized, situation-dependent and contextual information are increasing. The approaches of the Internet of Things (IoT) and Industry 4.0 are changing the context in which (technical) information is embedded, accessed and used. The context can no longer be predefined, but rather evolves while using the products [2,3].
Considering the paradigm shift from static information in classic manuals to on-demand delivery of information, the provision of intelligent information is becoming a fundamental requirement. In the context of this paper, the term intelligent information is understood as information that can be requested, processed and delivered both manually and automatically according to specific requests and use cases [4]. Information retrieval techniques evolved to give principled approaches to accessing intelligent information. These techniques aim at providing users with content that is both relevant and intelligible for them and their needs [5]. They can be brought into the field of ontologies to tackle the aforementioned challenges.
The existing literature has extensively explored the adoption and implementation of information retrieval techniques that have become the preferred form of information access [5]. However, our review of previous studies also suggests that the application of these Corresponding authors: * Lena Wenner: lena.wenner@gmx.de, ** Nergis Kuru: nergis.k@live.de techniques in the context of ontologies and ontology transformations is a topic that has not been sufficiently covered in the field of technical communication. Thus, the primary goal of this paper is to explore and compare different retrieval techniques from a practical perspective of both technical writers and ontology developers. To position our findings, we tailor these techniques to use cases and implement them as ontology transformations. By applying the latter to an ontology model, we propose opportunities to enhance the delivery of intelligent information and its access.
The structure of this paper is as follows: Section 2 is devoted to the basics of ontologies and ontology transformations. It also presents our research approach. Section 3 provides definitions of different levels of intelligent information access, combined with information retrieval techniques. Here, the focus lies on how these retrieval techniques were designed and implemented as ontology transformations. In section 4 we discuss the limitations of this study. Finally, section 5 reviews the main findings and provides a conclusion.

Background
Various authors have been discussing the many discourses and explanations for the term ontology. Guarino and Giaretta [6] even devote an entire paper to its terminological clarification and provide a list of several possible interpretations. These divergences in discourse suggest that the precise meaning of the term depends on the understanding of the disciplines in which ontologies are used. For this study, ontologies are defined as conceptualizations of knowledge and explicit specifications of terms in a domain of interest (also domain of discourse) [7]. Ontologies are to model semantic networks and complex relations to enable a mutual understanding of the meaning of specific vocabulary terms and to facilitate information integration [8] across information sources. As such, they differ from existing approaches and methods like mind maps, thesauri, and hierarchical taxonomies. Gruber [7] provides a detailed account of ontologies' nature. He explains that ontologies can be formally described by a set of objects (e.g. classes, instances, and relations) which are reflected in representational vocabularies, and which may differ depending on the ontology-editing tools used to represent the concepts of a domain and the relations among them. Given this explanation, ontologies are unambiguously formalized in logic-based representational vocabularies. Thus, their syntax and semantics are machine-interpretable that enables querying, logic-based reasoning [7], and "sensemaking" in pursuit of meaningful knowledge. These mechanisms can be used to enhance more intelligent information search, delivery and access processes.
The representational vocabularies, their syntax and semantics form the backbone of ontology transformations. The meaning of the latter can be very broad. A more general definition by the Cambridge Dictionary considers transformations as a change in the appearance or character of something to improve itself in any way [9]. This is also the case in ontology transformations. As defined, they perform modifications on the formal semantics and ontology patterns, transforming (parts of) an ontology from one modeling choice to another. They do so by taking transformation instructions (specified as a set of rules or procedures) and an ontology as an input. An advantage worth noting is that the same conceptualization can be modeled and transformed in various ways [10].
The main purpose of ontology transformations is to convert information contained in ontologies into useful knowledge and valuable new insights. To conduct this, we decided to use the web-based tool Ontolis for modeling, displaying and transforming information about Smart Homes, which is the domain of discourse in this scenario. Consequently, the terminology we use to describe the practical implementation is ontolis-specific (terms are emphasized). While any ontology-editing tool could have been used, we chose Ontolis because it accommodates state-of-the-art semantic modeling and knowledge representation. Also, it supports sophisticated ontology transformations at different stages. For a profound explanation of the modeling methodology and the development practices in Ontolis, the reader is referred to a case study by Fischer and Krägel [11], which we deemed outside the scope of this paper.

Research approach
Ontology transformations strongly rely on the modeling of ontologies. Thus, the first steps of this research were to define the domain of discourse and develop specific use cases that guided many of the modeling decisions. These steps also had a significant impact on the application of the ontology transformations.
The ontology we developed for Smart Homes is intended to support end-users in retrieving high-level information on smart devices, e.g. a smart thermostat, smart lighting or smart speaker. For this projected task, we defined use cases according to the framework offered by Cockburn [12]. They go beyond single-session lookup tasks and consider more complex queries (such as in "Which smart devices are compatible with my existing ones controlled by the Apple Home Kit System?"). While defining a clear scope of information search and access scenarios, the use cases also provided the necessary scaffolding to develop the ontology. Figure 1 presents an extracted part of the ontology in Ontolis. It consists of various components (represented as nodes) that constitute the semantic model and the information corpus for Smart Homes. The ontology model is not comprehensive in covering all possible topics and devices related to the domain of Smart Homes. However, it sufficiently describes and represents the classes, instances, attributes, and relations, which served as a suitable base for the ontology transformations.

Levels of intelligent information access
Intelligent information access attempts to overcome the limitations of current information delivery processes by exploiting information retrieval techniques. The latter normally use (direct or indirect) inputs and facilitate search and decision processes [13] to match information items from among large collections to the request [5]. This activity involves evaluating and weighting the information "so that each user can quickly find information that is both relevant and comprehensive for their needs." [5] In the following, we define and summarize four levels of intelligent information access in the context of ontologies. We only focus on the fundamental notions needed for later references in the sections where ontology transformations are described.

Level 1: filtering
In general terms, filtering is understood as the removal of information rather than finding relevant content in a set of data. In this case, users are only provided with information that is not removed [14].
Although various filtering techniques share the goal of delivering only relevant information to users, we focus on rule-based filtering systems. The filtering component of those systems consists of a set of rules that are applied for information to be filtered. They instruct the filtering component to either filter out the information or to treat it as relevant as soon as the conditions of a rule are met [14]. The same applied to ontologies, their filtering components delete non-relevant information without changing the original structure of the ontology (see Figure 2).

Implementation using Validity Rules
In Ontolis, we defined a set of Validity Rules that were able to include all elements of the ontology, namely classes, relationships, attributes and instances. Within these rules, all elements could be combined with logical operators such as AND, OR, XOR, and NOT, allowing more complex dependencies to be defined between them.

Level 2: semantic transformation
According to Roser [15], a semantic transformation specifies a transformation between two ontologies, a source ontology (SO) and a target ontology (TO). Through semantic transformation, the elements of a SO can be transformed into another structure (see Figure  3) taking advantage of logical ontology patterns. These ontology patterns consist of links that indicate which elements of the SO need to be transformed into which elements of the TO. If they are equivalent to the elements in the SO, those elements are transformed into the same ones in the TO. If they differ from the elements in the SO, this results in a TO composed of different elements [15]. These links can be reflected in meta ontology, which defines a way of storage, tracing the links between input elements in SO and target elements in TO [16].

Implementation using QIRA
The mechanism described in section 3.2 was implemented using QIRA, an ontolis-specific query and transformation language. Building on this, we defined a set of declarative transformation rules to cause some modifications in a target ontology depending on queries. Since the current state of transformations is stored within these rules, QIRA can be understood as a meta ontology. The semantic transformation rules were initialized by user inputs. In our use case, users could select which specific smart device they wanted to receive information from. The resulting (TO) provided them with information that matched the query and the use case. Since the TO was completely transformed, it differed from its "origin" both regarding the number of elements and the structure.
To perform semantic transformations and to enable efficient query answering, QIRA uses an in-house developed engine that imitates a reasoner and exploits the functions of SQL queries and XSLT transformations. In general terms, a reasoner (also semantic reasoner or rules engine) is a software that infers logical consequences from explicitly asserted facts in ontologies [17].
Reasoners are key components for working with ontologies and ontology transformations, especially at higher levels of intelligent information access. This is due to the need for correctness and consistency of ontologies, which are essential to obtain correct query results and provide intelligent information. The reasoners verify if there are any inconsistencies and logical contradictions within the ontology [17]. Also, some of the knowledge modeled might not be explicit. In such cases, reasoners can draw conclusions based on inferences to deduce implicit knowledge and derive new facts [18].
In contrast to the previously described levels of intelligent information access (filtering and semantic transformation), the processes on the following levels can be additionally triggered through external events or certain conditions allowing higher automation of information delivery and access processes. Thus, the following levels and their respective retrieval techniques have been revolutionizing the way information is accessed.

Level 3: intelligent publication process
In the context of this paper, an intelligent publication process is defined as the dynamic aggregation and delivery of information in a non-ontological representation (see Figure 4). This means, information is converted into system-independent formats, such as HTML or PDF. As a result, information, or any content, can be provided on diverse domains and media platforms for different types of users. Intelligent publication processes generally build on semantic transformations (see section 3.2). The difference among them is that their results are not just a modified ontology model, but a different format. The ontology is validated and interpreted by a reasoner. Provided that very specific use cases are defined and represented in the ontology model, the reasoner identifies relevant information.  On level of intelligent publication process, the delivery of content is usually context-, event-or processdriven [3]. According to Ziegler [3] such processes can be defined as push procedures, in which corresponding systems automatically gather information on operating conditions or product states, which can eventually trigger the information aggregation and delivery processes.

Implementation using the PublicForm
Based on our semantic transformation rules defined with QIRA, the elements of the ontology were converted to HTML elements upon user requests. Here, QIRA offered some genuine advantages. Particularly, the generic ability to retrieve relevant ontology elements and to redirect the transformation results to the so-called PublicForm. The latter was developed by Ontolis, to support the on-demand delivery of obtained information over the Internet.
We developed an interface that encapsulated the PublicForm and displayed information within a web browser by means of style sheets. Users were provided with read-only access to the information contained in the ontology. In this respect, the web-based interface did not provide explicit functionality for any direct modification of the underlying ontology model. Moreover, users could not see the actual semantic model.
Users were initially presented with four different categories that sought to simulate pre-filters. Selecting a certain category would lead them to the specification of the use case which was then presented as a summary, including the PublicForm. There, users could submit queries that triggered the corresponding ontology transformation. This process recomposed the information and presented the results as a coherent response.
Another means of performing this conversion is to use, for example, Quick Response (QR) codes, Radiofrequency identification (RFID) chips or user locations that can further automate the delivery and access processes driven by ontology transformations. Such automatic conversion processes hold great promise and can be seen as a key for intelligent and advanced methods of accessing information [19]. However, the premise for such approaches is that the relevant information or content should be semantically categorized and precisely described [2], and becomes therefore automatically retrievable, reusable, and reconfigurable [20]. This would also support the idea of micro documents aiming to provide information only to the extent required by users. Ziegler [3,21] defines micro documents as logic-driven compositions of semantically linked information with limited context, bridging the gap between single topic delivery and monolithic documents. That means that search processes or requests can trigger content aggregation in the form of micro documents. The latter can benefit from additional enrichment of more complex semantic models, such as ontologies.

Level 4: intelligent content delivery
Within the process of intelligent content delivery, information from multiple heterogeneous information sources is aggregated through ontologies (see Figure 5). This can be done by linking the resources to ontologies through relations expressed via mappings. This mapping process is referred to as Database-to-Ontology Mapping. A general definition of this concept could be given as follows: an establishment of correspondences between the source components and the ontology components [22]. For further theoretical discussions on this topic, the reader is referred to Ghawi and Cullot [22] who propose several approaches to enable ontology-based information integration.
The level of intelligent content delivery uses the semantic patterns of ontologies to facilitate information integration across various information sources. During the process, information is extracted, aggregated and presented as a cohesive entity. This is in contrast to the previous levels described above, where information comes from a single source. The advantage of such information integration processes is that already existing information can be accessed and imported from different systems and, if needed, can be seamlessly combined with other information that might not be directly available to users.

Possible future implementation scenarios
In future projects, we would like to relate information from various information sources, such as Content Management Systems (CMS), and transform them into a single target form by using ontologies as semantic middleware [3]. Especially in the realm of technical communication, much attention has been paid to CMS, which store, retrieve and use granular (technical) information on end-user products, while enabling singlesourcing mechanisms [23]. In such systems information can be used and flexibly, or even automatically, retrieved during composing activities [24]. This means information is repurposed and reassembled to create a variety of information products addressing different needs.
To bridge the heterogeneity between different information sources (e.g. CMS), the sources must be mapped to ontologies which will express their semantics. In other words, both a source and an ontology need to be semantically related on a conceptual level [22]. This would require first the identification of the sources, which may contain different types of information. Secondly, the information stored in those sources would be unequivocally defined using metadata. From here, the mapping process would start which includes following sequential process steps: a transformation of the source ETLTC2020 SHS Web of Conferences 77, 0 0 (2020) https://doi.org/10.1051/shsconf /20207703008 30 8 schema into the ontology structure followed by a migration of the source components into ontology components. The latter, also referred to as ontology population, can be realized as a query-driven process that transforms the information resulting from a given query [22]. The outlined mapping process is fairly dynamic and starts running as soon as updates are made within the source(s).
The query results can be redirected to web services, such as Content Delivery Portals (CDP). Such portals are increasingly used to enable the interoperability between several and distributed sources. They aim to answer user queries and deliver the right amount of corresponding information [25].
Logical semantic patterns of ontologies can bridge the gap between data integration and migration. This can ultimately foster the efficient reuse of often already existing information from multiple (distributed) information sources. Therefore, building on intelligent content delivery processes and making use of ontology transformations can support the idea of accessing intelligent, semantically enriched information.

Study limitations
The present paper has certain limitations. First and foremost, both the ontology model (for Smart Homes) and ontology transformations were defined and carried out in Ontolis. Thus, they are limited to the functional capabilities and scope of this tool. However, the validity of the findings described and presented could be extended, for example, by examining the levels of information access in different ontology-editing tools to find any similarities or differences in the conclusions.
Another limitation has to do with the ontology itself. According to Staab and Studer [26], ontologies should express a consensus, that is a shared view between multiple parties rather than a single view. Even though attempts were made to include different perspectives on the domain of Smart Homes, the possibility of relevant omissions and researcher biases remains. Therefore, our recommendation for future research on the same topic would be to develop an ontology model based on use cases and evaluate the ontology by discussing it with experts from the field. This could enable the analysis of even more realistic information access scenarios and ensure real-world application.

Conclusion
Ontology transformations can process large semantic models effectively and provide personalized and use-case specific information. As for the definition of intelligent information in section 1, ontology transformations can improve making information truly intelligent. However, the outcome of transformations does not offer the same value among all user groups. On the one hand, end-users only benefit if the results are presented in a media-specific format. Information tagged with standard HTML tags, provides the ability for end-users to simply view and "consume" the aggregated information [27]. In this project, we managed this by starting at the level of intelligent publication process.
Ontology developers and domain experts on the other hand use ontologies to store, effectively organize, share and annotate large sets of information [27] in their fields enabling collaboration in modeling and within companies. They can use ontology transformations to narrow down the domain of interest to a specific information need or to extend the set of information contained within the ontology.
We have described approaches by which the delivery of intelligent information and its access can be enhanced by using ontology transformations. We have shown how information retrieval techniques can be applied as ontology transformations. Depending on the level of implementation, ontology transformations offer in-time and on-demand access to personalized, contextualized information. From this perspective, both ontologies and ontology transformations can be portrayed as very promising approaches of intelligent information access. However, it needs to be considered that the development of use cases, ontologies and ontology transformations is a "process of iterative design [that] will likely continue through the entire lifecycle of the ontology." [28]


MHOLline 2.0: WORKFLOW FOR AUTOMATIC LARGE-SCALE MODELING AND ANALYSIS OF PROTEINS MHOLline 2.0: WORKFLOW PARA MODELAGEM E ANÁLISE AUTOMÁTICA DE PROTEÍNAS EM LARGA ESCALA

Genomes and their proteins can be analyzed by different perspectives, with different goals and applicability of results in several areas of research. In bioinformatics and computational biology, it is common the use of multiple combinations of programs and databases to extract information from the raw data. Choosing the proper program, setting its parameters, filtering the input files, extracting information from output files, and creating scripts for automating tasks can be challenging. This work describes the MHOLline, an online scientific workflow that provides a set of modules that enables a broad large-scale analysis of proteins (e.g. whole genomes) in a few hours. The version 1.0 (released in 2010), was wholly reformulated, and the new version 2.0 is available at www.mholline2.lncc.br. This version presents new features, modules, interface, code optimization, runtime reduction, more security, a new results visualization interface, and an automatic and userfriendly refinement page.

INTRODUCTION
Genome analysis may provide information about each protein's role in organisms, which proteins play similar or analogous biological functions, and identify proteins intrinsic to a particular specie. It also enables the search for new molecular targets for the treatment of diseases and assists in the structure-based drug design (SBDD).
The blind screening method used in drug development is responsible for creating the majority of drugs available. It consists of testing a library of compounds against in vivo and in vitro systems. The costs to purify, characterize, and synthesize these compounds associated with the need to have many compounds in a library are hard-working and highly expensive, spending billions of dollars (ADAMS; BRATNER, 2006;KOLA;LANDIS, 2004;DIMASI;GRABOWSKI;HANSEN, 2016).
Therefore, computational methods have been proposed to decrease costs and speed up the drug design process (e.g., the SBDD) (LOUNNAS et al., 2013). The more is known about the three-dimensional (3D) structure of proteins, the faster the drug discovery process becomes (CONGREVE;MURRAY;BLUNDELL, 2005;MANDAL;MOUDGIL;MANDAL, 2009). In this context, the MHOLline workflow was created to automate (i) the analysis of structural properties of proteins, (ii) the construction of 3D models of proteins aiming to achieve a large number of protein models in an easy way and in less time, accelerating the SBDD studies, and (iii) the validation of 3D models (CAPRILES et al., 2010).
Over the past ten years, MHOLline has contributed to dozens of researches in the different areas of Computational Modeling (JAISWAL et al., 2017;JAMAL et al., 2017;HASSAN et al., 2018;VASCONCELOS;CAMPOS;REZENDE, 2018;ALMEIDA et al., 2019;GONÇALVES et al., 2019). In this paper, we present the second version of this workflow, with the addition of new softwares, proprietary tools for protein modeling analysis and refinement, and administration environment.
MHOLline is a scientific workflow developed to aid researchers from Bioinformatics, Biophysics, Computational Chemistry, and Computational Biology. In 2010, the partnership between Universidade Federal do Rio de Janeiro (UFRJ) and Laboratório Nacional de Computação Científica (LNCC) resulted in the first web version of MHOLline, available in the electronic address www.mholline.lncc.br (CAPRILES et al., 2010;GUIMARÃES et al., 2013).
This workflow has been defined as a computing environment divided into three parts ( Figure 1): (i) MHOLcore, that generates, processes and maintains all data; (ii) MHOLweb, the graphical user interface that displays the progress of jobs and their results; and (iii) MHOLdb, Revista Mundi, Engenharia e Gestão, Paranaguá, PR, v. 5, n. 6, p. 283-01, 283-14, 2020 DOI: 10.21575/25254782rmetg2020vol5n61325 the database used to store and query all the system data. MHOLline was developed for Linux OS. MHOLcore uses Perl, ShellScript, C, and Python2/3, MHOLdb database uses MySQL, and MHOLweb uses PHP, JavaScript, HTML, and CSS. There are two primary access types: with or without login. The user without login can submit new jobs, but it is limited to 50 amino acid sequences per file in FASTA format. The user with a login could be classified into three types of logged user: (i) Registered, can submit and manage its jobs without the restriction of protein sequences per file; (ii) Manager, has some administrative privileges over Registered user to help the system management; (iii) Administrator, has all privileges to maintenance of server, database, statistical analysis of MHOLline usage and query base tools that keep MHOLline updated and working 1.1 What's New in MHOLline 2.0 The first version of MHOLline (CAPRILES et al., 2010) presented the following modules: (i) the BLAST program (ALTSCHUL et al., 1990), used to perform the local alignment of the submitted sequences against the Protein Data Bank (PDB) (BERMAN et al., 2000); (ii) the BATS tool, developed to classify the alignments in four groups (Table 1) based the E-value and identity from BLAST, and Length Variation Index (LVI) which is the MHOLline's concept of coverage (LVI ≤ 0.1 is equivalent to coverage ≥ 90%); (iii) the FILTERS tool, created to sort G2 proteins (proteins that can be modeled by comparative modeling technique) into seven quality groups (Table 2); (iv) the ECNGet tool, developed to capture at least one Enzyme Commission (EC) number for each sequence in G2 group, whose reference protein has at least one known enzymatic function; (v) the MODELLER software (WEBB; SALI, 2016) that constructs the 3D models; (vi) the PROCHECK software (LASKOWSKI et al., 1993), used to produce Ramachandran plots; and (vii) the HMMTOP software (TUSNÁDY; SIMON, 2001), used to identify transmembrane regions in proteins.
In this new version, MHOLline has undergone the following modifications: (i) updated modules to latest versions; (ii) addition of new softwares; (iii) code refactoring to make Revista Mundi, Engenharia e Gestão, Paranaguá, PR, v. 5, n. 6, p. 283-01, 283-14, 2020 DOI: 10.21575/25254782rmetg2020vol5n61325 workflow more readable and faster; (iv) security improvements; (v) creation of an online view mode where user can analyze the job results; (vi) development of a refinement system where the logged user can edit the alignment and resubmit it to the workflow also using some structural restrictions in the 3D model construction; (vii) development of a re-upload tool for data reuse, allowing data re-analysis and refinement without having to pass through the workflow processing again, saving the user time; and (viii) creation of a new interface, taking into account the layout and operational compatibility with main browsers, according to the concept of human-computer interaction.
In the system administration area, we incorporated a tool to user and system activity data collection, which are used to generate graphs, tables, and reports, providing the administrator with information to design future modifications and keep records of workflow activities. All this data is saved into the database, being possible to retrieve information from previous periods and compare it to the current scenario. Additionally, we developed functions to backup, restore, and update modules and database that runs directly from the system interface via the administrator environment. These services facilitated remote system administration and maintenance without access via a remote network server.  Additionally, logged users can improve or reconstruct 3D models and download the original MHOLline's results or the last two modified results through the refinement process. Allowed improvements are: (i) change the template chosen by default or add up to two more structures; (ii) cleavage of the protein in positions that were predicted by the SignalP program; (iii) use of secondary structures constraints during model construction via MODELLER; and (iv) optimize loops with MODELLER. It is important to note that when the user changes or add new templates if only one structure is selected, the workflow executes the salign function from MODELLER; otherwise, executes CLUSTALΩ software (SIEVERS et al., 2011).
The logged user can also download the alignment, perform manual adjustments in this Revista Mundi, Engenharia e Gestão, Paranaguá, PR, v. 5, n. 6, p. 283-01, 283-14, 2020 DOI: 10.21575/25254782rmetg2020vol5n61325 file, and then re-upload this data to be used in the refinement tool. The interface provides information regarding the protein model and templates (Figure 3), such as the secondary structure of the sequence model predicted with PSIPRED and the template files assigned by DSSP and transmembrane regions found in the sequence model using TMHMM. Figure 3: Sample of information provided in the alignment section of the refinement interface.
In the figure, the characters over the sequences means (c) coil, (h) alpha-helix, and (e) beta structure.
During the re-submission, the logged user might choose either Manual or Automatic refinement. The Automatic mode will select the secondary structures, based on PSIPRED prediction, which occurs in template gap regions, using different combinations of size and position, in an attempt to increase the variety of 3D models. This process may generate up to 50 models. If the number of possibilities exceeds 50 combinations, the system will randomly choose 50 and then model the selected ones. If there are no gaps nor alpha/beta secondary structure prediction in gapped regions, the system will optimize loops with MODELLER generating 20 models.
Aiming to minimize the requirements to analyze a large amount of data generated in the Automatic refinement, we implemented a library written in python3 called Quality-Model Clustering (QMC) Tool to cluster proteins in groups based on its energy and stereochemical qualities (CARVALHO; ROSSI; GOLIATT, 2020). This tool takes into account the MODELLER scores (molpdf, DOPE, DOPE-HR, GA341, and N-DOPE), and Molprobity results to group the structures by similarity, returning to the logged user the clusters with their representative structures. The QMC tool is freely available to download in the git repository Revista Mundi, Engenharia e Gestão, Paranaguá, PR, v. 5, n. 6, p. 283-01, 283-14, 2020 DOI: 10.21575/25254782rmetg2020vol5n61325 (github.com/ruanmedina/Quality-Model-Clustering).
The Manual refinement will perform the re-modeling based on user inputs (Figure 4), generating 20 models. As in the Automatic process, the input data should also consider modifications in the alignment, secondary structure constraints, and template change. In this case, the MHOLline 2.0 refinement tool will not run the protein cluster library (QMC) since the user chooses the refinement. To validate both the Manual and Automatic refinement processes, we performed three tests: the Automatic refinement, the Manual refinement, and without any restriction. The protein used in this validation process was the ATP-diphosphohydrolase 2 (Uniprot code: A1BXT9) of Schistosoma mansoni, also called SmNTPDase2 (LEVANO-GARCIA et al., 2007). This sequence was submitted to the MHOLline 2.0 workflow, which selected as the template the structure of nucleoside triphosphate diphosphohydrolase 1 (NTPDase1) of Rattus norvegicus (PDB code: 3ZX3) (ZEBISCH et al., 2012), presenting 33% (68/204) of identity and LVI of 0.57. To evaluate the Automatic and the Manual refinements within gap regions, we changed the template by the NTPDase1 of Legionella pneumophila subsp. pneumophila (strain Philadelphia 1 / ATCC 33152 / DSM 7513) (PDB code: 4BRP -chain A) (ZEBISCH et al., 2013), with 28% of identity and LVI of 0.53. The objective was to obtain alignment with lower coverage and identity to be able to apply structural restrictions. The system chose the Revista Mundi, Engenharia e Gestão, Paranaguá, PR, v. 5, n. 6, p. 283-01, 283-14, 2020 DOI: 10.21575/25254782rmetg2020vol5n61325 restrictions applied in the automatic approach, and Table 3 presents the constraints used in the manual procedure. In both tests, we decided to clive the region detected as a signal peptide, and not used contact and beta-sheet restrictions, nor loop optimizations. The QMC Tool filtered each set (Automatic, Manual, and No Restriction), performing a Principal Component Analysis (PCA) over MODELLER and Molprobity attributes. The dimensionality of the data is reduced from seven to two components, enough to explain more than 85% of the original data (86.8% of Automatic, 87.8% of Manual, and 92.0% of No Restriction). We selected the best model of each set by the visual inspection of each cluster's representative model. Figure 5 presents the final three best models (one from each set) aligned with the control structure, the 3D model of SmNTPDase2, previously published by (SOUZA et al., 2014). Table 4 presents the backbone Root Mean Square Deviation (RMSD) calculated using the RMSD plugin of PyMol (Schrödinger, LLC, 2015). Table 4 the Manual refinement achieved a smaller RMSD value, followed by the Automatic approach indicating that the use of any refinement tool might lead to better results than not applying structural improvements. Figure 5 shows that Automatic refinement (Fig. 6b), even not being as good as the Manual (Fig. 6c), has been capable of optimizing the protein structure.  The DOPE profile has been computed for each structure (models, template, and reference) and plotted in Figure 6 to illustrate the differences between the DOPE energy for each residue. It is possible to notice that in regions where restraints were applied, the models' energy profile was similar to the SmNTPDase2, for example, in the alpha-helix constraints between residues 97 -106 and 109 -112, and beta-strand constraints between residues 182 -183 and 242 -251. The C-terminal coils present different energy values due to their high flexibility, allowing the structure to assume different conformations in this region. This problem can be minimized by using contact restrictions.

As observed in
A single FASTA file submission with a large number o sequences (e.g., entire genomes), can spend a lot of processing time and generates large files as a result. For this reason, the jobs are automatically deleted 15 days after finishing its processing in the main workflow, saving hard disk space. In case that users need more than 15 days to process their results, a datareuse tool was created, and logged users can re-upload their original .tar.gz file (previously downloaded) to the system (SIQUEIRA, 2018).
The user re-upload the previous job file, and MHOLline checks the encrypted key to verify data integrity. Then the user can automatically compare if the re-uploaded data are the same as they were before the deletion and check if the re-uploaded files represent the same data of finished jobs in the system (whether the user has not previously deleted the job). Finally, the Revista Mundi, Engenharia e Gestão, Paranaguá, PR, v. 5, n. 6, p. 283-01, 283-14, 2020 DOI: 10.21575/25254782rmetg2020vol5n61325 tool inserts files in its original folders, restores the data in MHOLdb, and sets again as active.
Thus the user will have more 15 days to continue the analyzes.

CONCLUSIONS
The new version of MHOLline features both system improvements and analysis tools. We refactored the system, adding features and standardizing the code and documentation and removing vulnerabilities. Unified Modeling Language (UML) diagrams have been generated to help the knowledge of each step of the workflow, from MHOLcore to MHOLweb. The web interface of MHOLline has been completely rewritten, and a new layout for the result page was developed to make the user experience even better. The main difference of new MHOLweb is the refinement page in which the user can manually or automatically modify and optimize the 3D model constructed by MHOLline.
The option to change or add more templates proved to be a significant improvement in the workflow. Sometimes, the best BLAST hit may not be the best modeling template due to its original function or organism. Now, users have the option to change the default template to best suit their needs. Additionally, the ability to indicate to MODELLER where to set secondary Revista Mundi, Engenharia e Gestão, Paranaguá, PR, v. 5, n. 6, p. 283-01, 283-14, 2020 DOI: 10.21575/25254782rmetg2020vol5n61325 structure constraints based on PSIPRED predictions and user knowledge is also a significant improvement since it gives more user autonomy to model the protein as desired.
The objective of creating new tools and enhancing existing ones in the workflow was to ensure the correct functioning of the process, renewing and innovating based on current programming practices, project management approaches, computational modeling, and information security.
The latest version of MHOLline can be accessed at www.mholline2.lncc.br.

PERSPECTIVES
As the next steps, we are planning to implement the second phase of MHOLline code optimization. The modules will have their docker containers, allowing administrator users to have more control over all processes running in the MHOLline server. Other computational biology softwares will be implemented to expand the capability of MHOLline 2.0 to provide information about proteins, such as residue-residue contact prediction, which can also be used to improve the refinement tool.