Demo Data from EDBT 2026 / reviewers in the wild / expert
Daniel Probst
dblp:39/7314
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0003-1737-4407ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author
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.
| Artificial intelligence
1 paper |
Graph learning · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 84% Computational science and engineering · 16% | |
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning
graph neural network |
0.9 | 1 | 2025 | Boosting Protein Graph Representations through Static-Dynamic Fusion · ICML 2025 |
Machine learning › Graph learning › graph neural network › heterogeneous graph neural network
multi-relational graph neural network |
0.9 | 1 | 2025 | Boosting Protein Graph Representations through Static-Dynamic Fusion · ICML 2025 |
Bioinformatics and computational biology › structural biology
protein structure and function |
0.9 | 1 | 2025 | Boosting Protein Graph Representations through Static-Dynamic Fusion · ICML 2025 |
Visualization and visual analytics
interactive visualization |
0.3 | 1 | 2018 | FUn: a framework for interactive visualizations of large, high-dimensional datasets on the web · Bioinform. 2018 |
Visualization and visual analytics › data visualization
web-based visualization |
0.3 | 1 | 2018 | FUn: a framework for interactive visualizations of large, high-dimensional datasets on the web · Bioinform. 2018 |
Computational science and engineering › computational chemistry › molecular simulation
molecular dynamics |
0.3 | 1 | 2025 | Boosting Protein Graph Representations through Static-Dynamic Fusion · ICML 2025 |
Bioinformatics and computational biology › protein analysis
protein-ligand interaction |
0.3 | 1 | 2025 | Boosting Protein Graph Representations through Static-Dynamic Fusion · ICML 2025 |
Bioinformatics and computational biology › molecular informatics › cheminformatics
chemical database |
0.1 | 1 | 2018 | FUn: a framework for interactive visualizations of large, high-dimensional datasets on the web · Bioinform. 2018 |
Bioinformatics and computational biology › molecular informatics
cheminformatics |
0.1 | 1 | 2018 | FUn: a framework for interactive visualizations of large, high-dimensional datasets on the web · Bioinform. 2018 |
Methods — techniques the papers use, named apart from their topics
static-dynamic fusion · 1.7relational graph neural network · 1.7GPU rendering · 0.73d visualization · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Boosting Protein Graph Representations through Static-Dynamic FusionabstractMachine learning for protein modeling faces significant challenges due to proteins' inherently dynamic nature, yet most graph-based machine learning methods rely solely on static structural information. Recently, the growing availability of molecular dynamics trajectories provides new opportunities for understanding the dynamic behavior of proteins; however, computational methods for utilizing this dynamic information remain limited. We propose a novel graph representation that integrates both static structural information and dynamic correlations from molecular dynamics trajectories, enabling more comprehensive modeling of proteins. By applying relational graph neural networks (RGNNs) to process this heterogeneous representation, we demonstrate significant improvements over structure-based approaches across three distinct tasks: atomic adaptability prediction, binding site detection, and binding affinity prediction. Our results validate that combining static and dynamic information provides complementary signals for understanding protein-ligand interactions, offering new possibilities for drug design and structural biology applications. Pengkang Guo, Bruno E. Correia, Pierre Vandergheynst, Daniel Probst |
ICML | 4 |
| 2025 | Generative Modeling of Full-Atom Protein Conformations using Latent Diffusion on Graph EmbeddingsabstractGenerating diverse, all‐atom conformational ensembles of dynamic proteins such as G‐protein‐coupled receptors (GPCRs) is critical for understanding their function, yet most generative models simplify atomic detail or ignore conformational diversity altogether. We present latent diffusion for full protein generation (LD-FPG), a framework that constructs complete all‐atom protein structures, including every side‐chain heavy atom, directly from molecular dynamics (MD) trajectories. LD-FPG employs a Chebyshev graph neural network (ChebNet) to obtain low‐dimensional latent embeddings of protein conformations, which are processed using three pooling strategies: blind, sequential and residue‐based. A diffusion model trained on these latent representations generates new samples that a decoder, optionally regularized by dihedral‐angle losses, maps back to Cartesian coordinates. Using D2R-MD, a $2\mu\text{s}$ MD trajectory (12 000 frames) of the human dopamine D$2$ receptor in a membrane environment, the sequential and residue-based pooling strategies reproduce the reference ensemble with high structural fidelity (all‐atom lDDT \~ $0.7$; $C\alpha$-lDDT \~ $0.8$) and recovers backbone and side‐chain dihedral‐angle distributions with a Jensen–Shannon divergence $<0.03$ compared to the MD data. LD-FPG thereby offers a practical route to system‐specific, all‐atom ensemble generation for large proteins, providing a promising tool for structure‐based therapeutic design on complex, dynamic targets. The D2R-MD dataset and our implementation are freely available to facilitate further research. Aditya Sengar, Ali Hariri, Daniel Probst, Patrick Barth, Pierre Vandergheynst |
NeurIPS | 3 |
| 2018 | FUn: a framework for interactive visualizations of large, high-dimensional datasets on the webabstractMotivation: During the past decade, big data have become a major tool in scientific endeavors. Although statistical methods and algorithms are well-suited for analyzing and summarizing enormous amounts of data, the results do not allow for a visual inspection of the entire data. Current scientific software, including R packages and Python libraries such as ggplot2, matplotlib and plot.ly, do not support interactive visualizations of datasets exceeding 100 000 data points on the web. Other solutions enable the web-based visualization of big data only through data reduction or statistical representations. However, recent hardware developments, especially advancements in graphical processing units, allow for the rendering of millions of data points on a wide range of consumer hardware such as laptops, tablets and mobile phones. Similar to the challenges and opportunities brought to virtually every scientific field by big data, both the visualization of and interaction with copious amounts of data are both demanding and hold great promise. Results: Here we present FUn, a framework consisting of a client (Faerun) and server (Underdark) module, facilitating the creation of web-based, interactive 3D visualizations of large datasets, enabling record level visual inspection. We also introduce a reference implementation providing access to SureChEMBL, a database containing patent information on more than 17 million chemical compounds. Availability and implementation: The source code and the most recent builds of Faerun and Underdark, Lore.js and the data preprocessing toolchain used in the reference implementation, are available on the project website (http://doc.gdb.tools/fun/). Contact: [email protected] or [email protected]. Daniel Probst, Jean-Louis Reymond |
Bioinform. | 1 |