NIAPU: network-informed adaptive positive-unlabeled learning for disease gene identification

Predicting protein functions using positive-unlabeled ranking with ontology-based priors

Automated protein function prediction is a crucial and widely studied problem in bioinformatics. Computationally, protein function is a multilabel classification problem where only positive samples are defined and there is a large number of unlabeled annotations. Most existing methods rely on the assumption that the unlabeled set of protein function annotations are negatives, inducing the false negative issue, where potential positive samples are trained as negatives. We introduce a novel approach named PU-GO, wherein we address function prediction as a positive-unlabeled ranking problem. We apply empirical risk minimization, i.e. we minimize the classification risk of a classifier where class priors are obtained from the Gene Ontology hierarchical structure. We show that our approach is more robust than other state-of-the-art methods on similarity-based and time-based benchmark datasets.

AVAILABILITY AND IMPLEMENTATION

Data and code are available at https://github.com/bio-ontology-research-group/PU-GO.

On propagation in networks, promising models beyond network diffusion to describe degenerative brain diseases and traumatic brain injuries

Introduction: Connections among neurons form one of the most amazing and effective network in nature. At higher level, also the functional structures of the brain is organized as a network. It is therefore natural to use modern techniques of network analysis to describe the structures of networks in the brain. Many studies have been conducted in this area, showing that the structure of the neuronal network is complex, with a small-world topology, modularity and the presence of hubs. Other studies have been conducted to investigate the dynamical processes occurring in brain networks, analyzing local and large-scale network dynamics. Recently, network diffusion dynamics have been proposed as a model for the progression of brain degenerative diseases and for traumatic brain injuries. Methods: In this paper, the dynamics of network diffusion is re-examined and reaction-diffusion models on networks is introduced in order to better describe the degenerative dynamics in the brain. Results: Numerical simulations of the dynamics of injuries in the brain connectome are presented. Different choices of reaction term and initial condition provide very different phenomenologies, showing how network propagation models are highly flexible. Discussion: The uniqueness of this research lies in the fact that it is the first time that reaction-diffusion dynamics have been applied to the connectome to model the evolution of neurodegenerative diseases or traumatic brain injury. In addition, the generality of these models allows the introduction of non-constant diffusion and different reaction terms with non-constant parameters, allowing a more precise definition of the pathology to be studied.

XGDAG: explainable gene-disease associations via graph neural networks

MOTIVATION

Disease gene prioritization consists in identifying genes that are likely to be involved in the mechanisms of a given disease, providing a ranking of such genes. Recently, the research community has used computational methods to uncover unknown gene-disease associations; these methods range from combinatorial to machine learning-based approaches. In particular, during the last years, approaches based on deep learning have provided superior results compared to more traditional ones. Yet, the problem with these is their inherent black-box structure, which prevents interpretability.

RESULTS

We propose a new methodology for disease gene discovery, which leverages graph-structured data using graph neural networks (GNNs) along with an explainability phase for determining the ranking of candidate genes and understanding the model's output. Our approach is based on a positive-unlabeled learning strategy, which outperforms existing gene discovery methods by exploiting GNNs in a non-black-box fashion. Our methodology is effective even in scenarios where a large number of associated genes need to be retrieved, in which gene prioritization methods often tend to lose their reliability.

AVAILABILITY AND IMPLEMENTATION

The source code of XGDAG is available on GitHub at: https://github.com/GiDeCarlo/XGDAG. The data underlying this article are available at: https://www.disgenet.org/, https://thebiogrid.org/, https://doi.org/10.1371/journal.pcbi.1004120.s003, and https://doi.org/10.1371/journal.pcbi.1004120.s004.