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

Sjors H. W. Scheres

dblp:97/5886 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0002-0462-6540ORCID · verified

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

Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-authorApplied, 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
3 papers
Generative modeling · 68% Graph learning · 22% 3D vision · 10%
Interdisciplinary, comprehensive, and emerging computing
3 papers
Bioinformatics and computational biology · 100%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › diffusion model › guided diffusion
classifier guidance
0.912025
All-atom inverse protein folding through discrete flow matching · ICML 2025
Machine learning › Generative modeling › diffusion model
conditional generation
0.912025
All-atom inverse protein folding through discrete flow matching · ICML 2025
Machine learning › Generative modeling › flow matching
discrete flow matching
0.912025
All-atom inverse protein folding through discrete flow matching · ICML 2025
Machine learning › Generative modeling
flow matching
0.912025
All-atom inverse protein folding through discrete flow matching · ICML 2025
Bioinformatics and computational biology › protein design
inverse protein folding
0.912025
All-atom inverse protein folding through discrete flow matching · ICML 2025
Bioinformatics and computational biology
protein design
0.912025
All-atom inverse protein folding through discrete flow matching · ICML 2025
Machine learning › Graph learning › graph neural network
geometric graph neural network
0.712023
A Graph Neural Network Approach to Automated Model Building in Cryo-EM Maps · ICLR 2023
Machine learning › Graph learning
graph neural network
0.712023
A Graph Neural Network Approach to Automated Model Building in Cryo-EM Maps · ICLR 2023
Bioinformatics and computational biology
structural biology
0.712023
A Graph Neural Network Approach to Automated Model Building in Cryo-EM Maps · ICLR 2023
Machine learning › Generative modeling
variational autoencoder
0.612022
Sparse Fourier Backpropagation in Cryo-EM Reconstruction · NeurIPS 2022
Computer vision › 3D vision › 3d reconstruction
volumetric reconstruction
0.612022
Sparse Fourier Backpropagation in Cryo-EM Reconstruction · NeurIPS 2022
Bioinformatics and computational biology › structural biology › cryo-electron microscopy
3d reconstruction
0.612022
Sparse Fourier Backpropagation in Cryo-EM Reconstruction · NeurIPS 2022
Bioinformatics and computational biology › structural biology
cryo-electron microscopy
0.612022
Sparse Fourier Backpropagation in Cryo-EM Reconstruction · NeurIPS 2022

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

ensemble sampling · 1.7discrete flow matching · 1.7classifier guidance sampling · 1.7variational autoencoder · 1.7neural radiance field · 1.7backpropagation · 1.7graph neural network · 1.3
YearPublicationVenuePosition
2025 All-atom inverse protein folding through discrete flow matching
abstract
The recent breakthrough of AlphaFold3 in modeling complex biomolecular interactions, including those between proteins and ligands, nucleotides, or metal ions, creates new opportunities for protein design. In so-called inverse protein folding, the objective is to find a sequence of amino acids that adopts a target protein structure. Many inverse folding methods struggle to predict sequences for complexes that contain non-protein components, and perform poorly with complexes that adopt multiple structural states. To address these challenges, we present ADFLIP (All-atom Discrete FLow matching Inverse Protein folding), a generative model based on discrete flow-matching for designing protein sequences conditioned on all-atom structural contexts. ADFLIP progressively incorporates predicted amino acid side chains as structural context during sequence generation and enables the design of dynamic protein complexes through ensemble sampling across multiple structural states. Furthermore, ADFLIP implements training-free classifier guidance sampling, which allows the incorporation of arbitrary pre-trained models to optimise the designed sequence for desired protein properties. We evaluated the performance of ADFLIP on protein complexes with small-molecule ligands, nucleotides, or metal ions, including dynamic complexes for which structure ensembles were determined by nuclear magnetic resonance (NMR). Our model achieves state-of-the-art performance in single-structure and multi-structure inverse folding tasks, demonstrating excellent potential for all-atom protein design. The code is available at https://github.com/ykiiiiii/ADFLIP .
Kai Yi, Kiarash Jamali, Sjors H. W. Scheres
ICML3
2023 A Graph Neural Network Approach to Automated Model Building in Cryo-EM Maps
Kiarash Jamali, Dari Kimanius, Sjors H. W. Scheres
ICLR3
2022 Sparse Fourier Backpropagation in Cryo-EM Reconstruction
abstract
Electron cryo-microscopy (cryo-EM) is a powerful method for investigating the structures of protein molecules, with important implications for understanding the molecular processes of life and drug development. In this technique, many noisy, two-dimensional projection images of protein molecules in unknown poses are combined into one or more three-dimensional reconstructions. The presence of multiple structural states in the data represents a major bottleneck in existing processing pipelines, often requiring expert user supervision. Variational auto-encoders (VAEs) have recently been proposed as an attractive means for learning the data manifold of data sets with a large number of different states. These methods are based on a coordinate-based approach, similar to Neural Radiance Fields (NeRF), to make volumetric reconstructions from 2D image data in Fourier-space. Although NeRF is a powerful method for real-space reconstruction, many of the benefits of the method do not transfer to Fourier-space, e.g. inductive bias for spatial locality. We present an approach where the VAE reconstruction is expressed on a volumetric grid, and demonstrate how this model can be trained efficiently through a novel backpropagation method that exploits the sparsity of the projection operation in Fourier-space. We achieve improved results on a simulated data set and at least equivalent results on an experimental data set when compared to the coordinate-based approach, while also substantially lowering computational cost. Our approach is computationally more efficient, especially in inference, enabling interactive analysis of the latent space by the user.
Dari Kimanius, Kiarash Jamali, Sjors H. W. Scheres
NeurIPS3
2005 Grid Computing in 3D-EM Image Processing Using Xmipp
abstract
Image processing in three-dimensional electron microscopy (3D-EM) is characterized by large amounts of data, and voluminous computing requirements. Here, we report our first experience with grid computing in this area. We present an interface between grid computing middleware and our image processing package Xmipp. The efficacy of this approach was illustrated with an Xmipp application for estimation of the contrast transfer function. In addition, we report our experience with grid computing in the development of a novel image refinement algorithm based on maximum likelihood principles. Its extensive CPU-requirements might have seriously hampered the algorithm development, if not for the far-reaching resources of grid computing. Our results suggest that electron microscopy image processing may be particularly well suited for grid computing.
Sjors H. W. Scheres, A. J. Merino, Carlos Oscar Sánchez Sorzano, José María Carazo
CBMS1