Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Arnaud Gloaguen

dblp:285/7909 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0009-0000-9141-3406ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 3 · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › genome annotation
functional annotation
0.912025
GNNenrich: a novel method for pathway enrichment analysis based on graph neural network · Bioinform. 2025
Bioinformatics and computational biology › functional genomics › functional enrichment analysis
pathway enrichment analysis
0.912025
GNNenrich: a novel method for pathway enrichment analysis based on graph neural network · Bioinform. 2025
Bioinformatics and computational biology › protein analysis › protein-protein interaction
protein-protein interaction network
0.912025
GNNenrich: a novel method for pathway enrichment analysis based on graph neural network · Bioinform. 2025
Bioinformatics and computational biology
multi-omics data integration
0.712023
Integrating multiomics and prior knowledge: a study of the Graphnet penalty impact · Bioinform. 2023
Bioinformatics and computational biology › biostatistics › statistical bioinformatics
statistical genomics
0.212023
Integrating multiomics and prior knowledge: a study of the Graphnet penalty impact · Bioinform. 2023

Methods — techniques the papers use, named apart from their topics

network embedding · 0.9graph neural network · 0.9sparse generalized canonical correlation analysis · 0.7permutation-based feature selection · 0.7graph penalty · 0.7
YearPublicationVenuePosition
2025 GNNenrich: a novel method for pathway enrichment analysis based on graph neural network
abstract
MOTIVATION: Graph neural network (GNN) models have emerged in many fields and notably for biological networks constituted by genes or proteins and their interactions. The majority of enrichment study methods apply over-representation analysis and gene/protein set scores according to the existing overlap between pathways. Such methods neglect knowledges coming from the interactions between the gene/protein sets. Here, we introduce a novel GNN-based enrichment analysis method called GNNenrich. GNNenrich, through multiple levels of embedding that integrate protein sequence properties and interactions network, establishes functional relationship to support biological interpretation. RESULTS: GNNenrich have been tested and compared to over-representation analysis technique (g:Profiler) and graph-based method (EnrichNet). It demonstrates the capacity to reproduce results provided by others approaches and offers new perspectives for interpretation, returning relevant results supported by protein-protein interactions (PPIs). AVAILABILITY AND IMPLEMENTATION: Source code is available at https://gitlab.com/cnrgh/gnn-enrich/gnn-enrich-article-demo.
Mallek Mziou, Pierrick Roger, Arnaud Gloaguen, Claire Dandine-Roulland, Thierry Jiogho Ngaho, Solène Brohard, Kévin Muret, Florian Sandron, Eric Bonnet, Jean-Francois Deleuze, Edith Le Floch, Vincent Meyer
Bioinform.3
2025 Unsupervised detection and fitness estimation of emerging SARS-CoV-2 variants: Application to wastewater samples (ANRS0160)
abstract
Repeated waves of emerging variants during the SARS-CoV-2 pandemics have highlighted the urge of collecting longitudinal genomic data and developing statistical methods based on time series analyses for detecting new threatening lineages and estimating their fitness early in time. Most models study the evolution of the prevalence of particular lineages over time and require a prior classification of sequences into lineages which is prone to induce delays and biases. More recently, several authors studied the evolution of the prevalence of mutations over time with alternative clustering approaches, avoiding specific lineage classification. Most existing methods are either non parametric or unsuited to pooled data characterizing, for instance, wastewater samples. The analysis of wastewater samples has recently been pointed out as a valuable complementary approach to clinical sample analysis, however the pooled nature of the data involves specific statistical challenges. In this context, we propose an alternative unsupervised method for clustering mutations according to their frequency trajectory over time and estimating group fitness from time series of pooled mutation prevalence data. Our model is a mixture of observed count data and latent group assignment and we use the expectation-maximization algorithm for model selection and parameter estimation. The application of our method to time series of SARS-CoV-2 sequencing data collected from wastewater treatment plants in France from October 2020 to April 2021 shows its ability to agnostically group mutations in a consistent way with lineages B.1.160, Alpha, B.1.177, Beta, and with selection coefficient estimates per group in coherence with the viral dynamics in France reported by Nextstrain. Moreover, our method detected the Alpha variant as threatening as early as supervised methods (which track specific mutations over time) with the noticeable difference that, since unsupervised, it does not require any prior information on the set of mutations.
Alexandra Lefebvre, Vincent Maréchal, Arnaud Gloaguen, Amaury Lambert, Yvon Maday
PLoS Comput. Biol.3
2023 Integrating multiomics and prior knowledge: a study of the Graphnet penalty impact
abstract
MOTIVATION: In the field of oncology, statistical models are used for the discovery of candidate factors that influence the development of the pathology or its outcome. These statistical models can be designed in a multiblock framework to study the relationship between different multiomic data, and variable selection is often achieved by imposing constraints on the model parameters. A priori graph constraints have been used in the literature as a way to improve feature selection in the model, yielding more interpretability. However, it is still unclear how these graphs interact with the models and how they impact the feature selection. Additionally, with the availability of different graphs encoding different information, one can wonder how the choice of the graph meaningfully impacts the results obtained. RESULTS: We proposed to study the graph penalty impact on a multiblock model. Specifically, we used the SGCCA as the multiblock framework. We studied the effect of the penalty on the model using the TCGA-LGG dataset. Our findings are 3-fold. We showed that the graph penalty increases the number of selected genes from this dataset, while selecting genes already identified in other works as pertinent biomarkers in the pathology. We demonstrated that using different graphs leads to different though consistent results, but that graph density is the main factor influencing the obtained results. Finally, we showed that the graph penalty increases the performance of the survival prediction from the model-derived components and the interpretability of the results. AVAILABILITY AND IMPLEMENTATION: Source code is freely available at https://github.com/neurospin/netSGCCA.
Hamza Chegraoui, Vincent Guillemot, Amine Rebei, Arnaud Gloaguen, Jacques Grill, Cathy Philippe, Vincent Frouin
Bioinform.4