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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Arnaud Blondel

dblp:77/2044 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0001-9586-3025ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2Artificial intelligence and machine learning · 1 · 1 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%
Artificial intelligence
1 paper
Generative modeling · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
flow matching
0.912025
Template-Guided 3D Molecular Pose Generation via Flow Matching and Differentiable Optimization · NeurIPS 2025
Bioinformatics and computational biology › structural bioinformatics › molecular structure prediction
molecular conformation prediction
0.912025
Template-Guided 3D Molecular Pose Generation via Flow Matching and Differentiable Optimization · NeurIPS 2025
Mathematical optimization › optimization for machine learning
differentiable optimization
0.912025
Template-Guided 3D Molecular Pose Generation via Flow Matching and Differentiable Optimization · NeurIPS 2025
Data mining
clustering
0.112015
An automatic tool to analyze and cluster macromolecular conformations based on self-organizing maps · Bioinform. 2015
Data mining › clustering › prototype-based clustering
self-organizing map
0.112015
An automatic tool to analyze and cluster macromolecular conformations based on self-organizing maps · Bioinform. 2015

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

pharmacophore similarity · 2.6flow matching · 2.6differentiable optimization · 2.6self-organizing map · 0.4flooding algorithm · 0.4
YearPublicationVenuePosition
2025 Template-Guided 3D Molecular Pose Generation via Flow Matching and Differentiable Optimization
abstract
Predicting the 3D conformation of small molecules within protein binding sites is a key challenge in drug design. When a crystallized reference ligand (template) is available, it provides geometric priors that can guide 3D pose prediction. We present a two-stage method for ligand conformation generation guided by such templates. In the first stage, we introduce a molecular alignment approach based on flow-matching to generate 3D coordinates for the ligand, using the template structure as a reference. In the second stage, a differentiable pose optimization procedure refines this conformation based on shape and pharmacophore similarities, internal energy, and, optionally, the protein binding pocket. We introduce a new benchmark of ligand pairs co-crystallized with the same target to evaluate our approach and show that it outperforms standard docking tools and open-access alignment methods, especially in cases involving low similarity to the template or high ligand flexibility.
Noémie Bergues, Arthur Carré, Paul Join-Lambert, Brice Hoffmann, Arnaud Blondel, Hamza Tajmouati
NeurIPS5
2015 An automatic tool to analyze and cluster macromolecular conformations based on self-organizing maps
abstract
MOTIVATION: Sampling the conformational space of biological macromolecules generates large sets of data with considerable complexity. Data-mining techniques, such as clustering, can extract meaningful information. Among them, the self-organizing maps (SOMs) algorithm has shown great promise; in particular since its computation time rises only linearly with the size of the data set. Whereas SOMs are generally used with few neurons, we investigate here their behavior with large numbers of neurons. RESULTS: We present here a python library implementing the full SOM analysis workflow. Large SOMs can readily be applied on heavy data sets. Coupled with visualization tools they have very interesting properties. Descriptors for each conformation of a trajectory are calculated and mapped onto a 3D landscape, the U-matrix, reporting the distance between neighboring neurons. To delineate clusters, we developed the flooding algorithm, which hierarchically identifies local basins of the U-matrix from the global minimum to the maximum. AVAILABILITY AND IMPLEMENTATION: The python implementation of the SOM library is freely available on github: https://github.com/bougui505/SOM. CONTACT: [email protected] or [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Guillaume Bouvier, Nathan Desdouits, Mathias Ferber, Arnaud Blondel, Michael Nilges
Bioinform.4
2015 Identification of binding sites and favorable ligand binding moieties by virtual screening and self-organizing map analysis
abstract
BACKGROUND: Identifying druggable cavities on a protein surface is a crucial step in structure based drug design. The cavities have to present suitable size and shape, as well as appropriate chemical complementarity with ligands. RESULTS: We present a novel cavity prediction method that analyzes results of virtual screening of specific ligands or fragment libraries by means of Self-Organizing Maps. We demonstrate the method with two thoroughly studied proteins where it successfully identified their active sites (AS) and relevant secondary binding sites (BS). Moreover, known active ligands mapped the AS better than inactive ones. Interestingly, docking a naive fragment library brought even more insight. We then systematically applied the method to the 102 targets from the DUD-E database, where it showed a 90% identification rate of the AS among the first three consensual clusters of the SOM, and in 82% of the cases as the first one. Further analysis by chemical decomposition of the fragments improved BS prediction. Chemical substructures that are representative of the active ligands preferentially mapped in the AS. CONCLUSION: The new approach provides valuable information both on relevant BSs and on chemical features promoting bioactivity.
Emna Harigua-Souiai, Isidro Cortes-Ciriano, Nathan Desdouits, Therese E. Malliavin, Ikram Guizani, Michael Nilges, Arnaud Blondel, Guillaume Bouvier
BMC Bioinform.7