Gene2DisCo : gene to disease using disease commonalities

OBJECTIVE: Finding the human genes co-causing complex diseases, also known as "disease-genes", is one of the emerging and challenging tasks in biomedicine. This process, termed gene prioritization (GP), is characterized by a scarcity of known disease-genes for most diseases, and by a vast amount of heterogeneous data, usually encoded into networks describing different types of functional relationships between genes. In addition, different diseases may share common profiles (e.g. genetic or therapeutic profiles), and exploiting disease commonalities may significantly enhance the performance of GP methods. This work aims to provide a systematic comparison of several disease similarity measures, and to embed disease similarities and heterogeneous data into a flexible framework for gene prioritization which specifically handles the lack of known disease-genes. METHODS: We present a novel network-based method, Gene2DisCo, based on generalized linear models (GLMs) to effectively prioritize genes by exploiting data regarding disease-genes, gene interaction networks and disease similarities. The scarcity of disease-genes is addressed by applying an efficient negative selection procedure, together with imbalance-aware GLMs. Gene2DisCo is a flexible framework, in the sense it is not dependent upon specific types of data, and/or upon specific disease ontologies. RESULTS: On a benchmark dataset composed of nine human networks and 708 medical subject headings (MeSH) diseases, Gene2DisCo largely outperformed the best benchmark algorithm, kernelized score functions, in terms of both area under the ROC curve (0.94 against 0.86) and precision at given recall levels (for recall levels from 0.1 to 1 with steps 0.1). Furthermore, we enriched and extended the benchmark data to the whole human genome and provided the top-ranked unannotated candidate genes even for MeSH disease terms without known annotations

Analysis of bio-molecular networks through semi-supervised graph-based learning methods

Relevant problems in the context of molecular biology and medicine can be modeled through graphs where nodes represent bio-molecular or chemical entities (e.g. genes or drugs) and edges some notion of similarity between them. In this context, semi-supervised learning methods able to exploit both the local (e.g. the neighborhood of a node) and the global characteristics of the network (e.g. its overall topology) have been applied to extract meaningful biological and medical knowledge from a biological system. In this work we summarize the main characteristics of RANKS (RAnking Nodes through Kernelized Score functions), a recently proposed semi-supervised algorithmic scheme based on local score functions embedding well-designed graph kernels, able to deal with both the local and the global features of the analyzed network. We show some successful applications of RANKS in the context of protein function prediction, gene disease association and drug repositioning problems. Moreover we present a novel secondary memory-based and "vertex-centric" version of the algorithm able to nicely scale on graphs with hundreds of thousands of nodes and tens of millions of edges, using off-the-shelf desktop computers, and we show an application to a complex multi-species protein function prediction problem

Integrating biomedical research and electronic health records to create knowledge-based biologically meaningful machine-readable embeddings.

In order to advance precision medicine, detailed clinical features ought to be described in a way that leverages current knowledge. Although data collected from biomedical research is expanding at an almost exponential rate, our ability to transform that information into patient care has not kept at pace. A major barrier preventing this transformation is that multi-dimensional data collection and analysis is usually carried out without much understanding of the underlying knowledge structure. Here, in an effort to bridge this gap, Electronic Health Records (EHRs) of individual patients are connected to a heterogeneous knowledge network called Scalable Precision Medicine Oriented Knowledge Engine (SPOKE). Then an unsupervised machine-learning algorithm creates Propagated SPOKE Entry Vectors (PSEVs) that encode the importance of each SPOKE node for any code in the EHRs. We argue that these results, alongside the natural integration of PSEVs into any EHR machine-learning platform, provide a key step toward precision medicine

Network modeling of patients' biomolecular profiles for clinical phenotype/outcome prediction

Methods for phenotype and outcome prediction are largely based on inductive supervised models that use selected biomarkers to make predictions, without explicitly considering the functional relationships between individuals. We introduce a novel network-based approach named Patient-Net (P-Net) in which biomolecular profiles of patients are modeled in a graph-structured space that represents gene expression relationships between patients. Then a kernel-based semi-supervised transductive algorithm is applied to the graph to explore the overall topology of the graph and to predict the phenotype/clinical outcome of patients. Experimental tests involving several publicly available datasets of patients afflicted with pancreatic, breast, colon and colorectal cancer show that our proposed method is competitive with state-of-the-art supervised and semi-supervised predictive systems. Importantly, P-Net also provides interpretable models that can be easily visualized to gain clues about the relationships between patients, and to formulate hypotheses about their stratification

Benchmarking network propagation methods for disease gene identification

In-silico identification of potential target genes for disease is an essential aspect of drug target discovery. Recent studies suggest that successful targets can be found through by leveraging genetic, genomic and protein interaction information. Here, we systematically tested the ability of 12 varied algorithms, based on network propagation, to identify genes that have been targeted by any drug, on gene-disease data from 22 common non-cancerous diseases in OpenTargets. We considered two biological networks, six performance metrics and compared two types of input gene-disease association scores. The impact of the design factors in performance was quantified through additive explanatory models. Standard cross-validation led to over-optimistic performance estimates due to the presence of protein complexes. In order to obtain realistic estimates, we introduced two novel protein complex-aware cross-validation schemes. When seeding biological networks with known drug targets, machine learning and diffusion-based methods found around 2-4 true targets within the top 20 suggestions. Seeding the networks with genes associated to disease by genetics decreased performance below 1 true hit on average. The use of a larger network, although noisier, improved overall performance. We conclude that diffusion-based prioritisers and machine learning applied to diffusion-based features are suited for drug discovery in practice and improve over simpler neighbour-voting methods. We also demonstrate the large impact of choosing an adequate validation strategy and the definition of seed disease genesPeer ReviewedPostprint (published version

Collaboratively charting the gene-to-phenotype network of human congenital heart defects

Background How to efficiently integrate the daily practice of molecular biologists, geneticists, and clinicians with the emerging computational strategies from systems biology is still much of an open question. Description We built on the recent advances in Wiki-based technologies to develop a collaborative knowledge base and gene prioritization portal aimed at mapping genes and genomic regions, and untangling their relations with corresponding human phenotypes, congenital heart defects (CHDs). This portal is not only an evolving community repository of current knowledge on the genetic basis of CHDs, but also a collaborative environment for the study of candidate genes potentially implicated in CHDs - in particular by integrating recent strategies for the statistical prioritization of candidate genes. It thus serves and connects the broad community that is facing CHDs, ranging from the pediatric cardiologist and clinical geneticist to the basic investigator of cardiogenesis. Conclusions This study describes the first specialized portal to collaboratively annotate and analyze gene-phenotype networks. Of broad interest to the biological community, we argue that such portals will play a significant role in systems biology studies of numerous complex biological processes. CHDWiki is accessible at http://www.esat.kuleuven.be/~bioiuser/chdwikistatus: publishe