Giulia Crocioni
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Giulia Crocioni has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Tobias Rademaker
Medical BioSciences department, Radboudumc, Radboud University Medical Center, Nijmegen, The Netherlands
5 shared publications - Li C. Xue
Medical BioSciences Department, Radboud University Medical Center, 6525 GA Nijmegen, the Netherlands
5 shared publications - Dani L. Bodor
Netherlands eScience Center, Amsterdam, The Netherlands
4 shared publications - Dario F. Marzella
Radboudumc
4 shared publications - Pablo López-Tarifa
Netherlands eScience Center, Amsterdam, The Netherlands
4 shared publications - Amy Lynn Kessler
Department of Gastroenterology and Hepatology, Erasmus MC, University Medical Center Rotterdam, Rotterdam, the Netherlands
3 shared publications
Latest Publications
- Open Access
- 3 May 2026
- Published by The Open Journal in Journal of Open Source Software
- Vol. 11 (121) , 9528
NPLinker 2: a modular and customizable framework for paired omics analyses
- 3 May 2026
- Published by The Open Journal in Journal of Open Source Software
- Vol. 11 (121) , 9528
Open AccessNPLinker 2: a modular and customizable framework for paired omics analyses
- Open Access
- 5 July 2025
- Published by Springer Nature in Communications Biology
- Vol. 8 (1) , 1-2
Author Correction: Geometric deep learning improves generalizability of MHC-bound peptide predictions
- 5 July 2025
- Published by Springer Nature in Communications Biology
- Vol. 8 (1) , 1-2
Open AccessAuthor Correction: Geometric deep learning improves generalizability of MHC-bound peptide predictions
- Open Access
SwiftMHC: A High-Speed Attention Network for MHC-Bound Peptide Identification and 3D Modeling
Identifying tumor peptides that bind patient MHC proteins and elicit immune responses is central to immunotherapy, yet progress remains limited to a handful of well-studied alleles. Structure-based methods generalize better than sequence-only models but are constrained by the high computational cost of 3D modeling. We present SwiftMHC, the fastest structure-based framework for peptide–MHC (pMHC) modeling and binding affinity prediction. SwiftMHC predicts peptide–MHC binding in 0.009 sec/case in batch mode on a single A100 GPU—nearly an order of magnitude faster than leading sequence-based methods such as NetMHCpan 4.1 (0.081 sec/case)—while performing competitively in predictive accuracy. In addition to affinity estimation, SwiftMHC generates all-atom 3D pMHC structures and achieves a median Cα-RMSD of 1.32 Å against X-ray benchmarks, matching or better than the accuracy of state-of-the-art approaches (e.g., AlphaFold with fine-tuning) but running thousands of times faster (excluding disk-writing time). These results demonstrate the power of task-specific AI trained on physics-derived synthetic data to overcome the scarcity of experimental structures. Optimized for HLA-A*02:01 9-mers but readily extensible to other alleles, SwiftMHC enables rapid and accurate identification of peptides distinct from self at T-cell–exposed surfaces. This capability may expand immunotherapy targets, improve the safety of TCR-based therapies, and accelerate the development of next-generation cancer immunotherapies.
Open AccessSwiftMHC: A High-Speed Attention Network for MHC-Bound Peptide Identification and 3D Modeling
Identifying tumor peptides that bind patient MHC proteins and elicit immune responses is central to immunotherapy, yet progress remains limited to a handful of well-studied alleles. Structure-based methods generalize better than sequence-only models but are constrained by the high computational cost of 3D modeling. We present SwiftMHC, the fastest structure-based framework for peptide–MHC (pMHC) modeling and binding affinity prediction. SwiftMHC predicts peptide–MHC binding in 0.009 sec/case in batch mode on a single A100 GPU—nearly an order of magnitude faster than leading sequence-based methods such as NetMHCpan 4.1 (0.081 sec/case)—while performing competitively in predictive accuracy. In addition to affinity estimation, SwiftMHC generates all-atom 3D pMHC structures and achieves a median Cα-RMSD of 1.32 Å against X-ray benchmarks, matching or better than the accuracy of state-of-the-art approaches (e.g., AlphaFold with fine-tuning) but running thousands of times faster (excluding disk-writing time). These results demonstrate the power of task-specific AI trained on physics-derived synthetic data to overcome the scarcity of experimental structures. Optimized for HLA-A*02:01 9-mers but readily extensible to other alleles, SwiftMHC enables rapid and accurate identification of peptides distinct from self at T-cell–exposed surfaces. This capability may expand immunotherapy targets, improve the safety of TCR-based therapies, and accelerate the development of next-generation cancer immunotherapies.
- Open Access
- 19 December 2024
- Published by Springer Nature in Communications Biology
- Vol. 7 (1) , 1-12
Geometric deep learning improves generalizability of MHC-bound peptide predictions
The interaction between peptides and major histocompatibility complex (MHC) molecules is pivotal in autoimmunity, pathogen recognition and tumor immunity. Recent advances in cancer immunotherapies demand for more accurate computational prediction of MHC-bound peptides. We address the generalizability challenge of MHC-bound peptide predictions, revealing limitations in current sequence-based approaches. Our structure-based methods leveraging geometric deep learning (GDL) demonstrate promising improvement in generalizability across unseen MHC alleles. Further, we tackle data efficiency by introducing a self-supervised learning approach on structures (3D-SSL). Without being exposed to any binding affinity data, our 3D-SSL outperforms sequence-based methods trained on ~90 times more data points. Finally, we demonstrate the resilience of structure-based GDL methods to biases in binding data on an Hepatitis B virus vaccine immunopeptidomics case study. This proof-of-concept study highlights structure-based methods’ potential to enhance generalizability and data efficiency, with possible implications for data-intensive fields like T-cell receptor specificity predictions.
- 19 December 2024
- Published by Springer Nature in Communications Biology
- Vol. 7 (1) , 1-12
Open AccessGeometric deep learning improves generalizability of MHC-bound peptide predictions
The interaction between peptides and major histocompatibility complex (MHC) molecules is pivotal in autoimmunity, pathogen recognition and tumor immunity. Recent advances in cancer immunotherapies demand for more accurate computational prediction of MHC-bound peptides. We address the generalizability challenge of MHC-bound peptide predictions, revealing limitations in current sequence-based approaches. Our structure-based methods leveraging geometric deep learning (GDL) demonstrate promising improvement in generalizability across unseen MHC alleles. Further, we tackle data efficiency by introducing a self-supervised learning approach on structures (3D-SSL). Without being exposed to any binding affinity data, our 3D-SSL outperforms sequence-based methods trained on ~90 times more data points. Finally, we demonstrate the resilience of structure-based GDL methods to biases in binding data on an Hepatitis B virus vaccine immunopeptidomics case study. This proof-of-concept study highlights structure-based methods’ potential to enhance generalizability and data efficiency, with possible implications for data-intensive fields like T-cell receptor specificity predictions.
- Open Access
- 27 February 2024
- Published by The Open Journal in Journal of Open Source Software
- Vol. 9 (94) , 5983
DeepRank2: Mining 3D Protein Structures with Geometric Deep Learning
We present DeepRank2, a deep learning (DL) framework geared towards making predictions on 3D protein structures for variety of biologically relevant applications. Our software can be used for predicting structural properties in drug design, immunotherapy, or designing novel proteins, among other fields. DeepRank2 allows for transformation and storage of 3D representations of both protein-protein interfaces (PPIs) and protein single-residue variants (SRVs) into either graphs or volumetric grids containing structural and physico-chemical information. These can be used for training neural networks for a variety of patterns of interest, using either our pre-implemented training pipeline for graph neural networks (GNNs) or convolutional neural networks (CNNs) or external pipelines. The entire framework flowchart is visualized in Figure 1. The package is fully open-source, follows the community-endorsed FAIR principles for research software, provides user-friendly APIs, publicly available documentation, and in-depth tutorials.
- 27 February 2024
- Published by The Open Journal in Journal of Open Source Software
- Vol. 9 (94) , 5983
Open AccessDeepRank2: Mining 3D Protein Structures with Geometric Deep Learning
We present DeepRank2, a deep learning (DL) framework geared towards making predictions on 3D protein structures for variety of biologically relevant applications. Our software can be used for predicting structural properties in drug design, immunotherapy, or designing novel proteins, among other fields. DeepRank2 allows for transformation and storage of 3D representations of both protein-protein interfaces (PPIs) and protein single-residue variants (SRVs) into either graphs or volumetric grids containing structural and physico-chemical information. These can be used for training neural networks for a variety of patterns of interest, using either our pre-implemented training pipeline for graph neural networks (GNNs) or convolutional neural networks (CNNs) or external pipelines. The entire framework flowchart is visualized in Figure 1. The package is fully open-source, follows the community-endorsed FAIR principles for research software, provides user-friendly APIs, publicly available documentation, and in-depth tutorials.
- Open Access
Improving generalizability for MHC-I binding peptide predictions through geometric deep learning
Understanding the peptide presentation mechanism of Major Histocompatibility Complex (MHC) is crucial to study the recognition of pathogens, the treatment of autoimmune diseases and in developing cancer immunotherapies. To comprehend these mechanisms and design effective therapies at affordable costs, it is fundamental to be able to precisely predict in silico which peptides can be bound by each MHC. Many computational approaches have been developed to identify MHC-binding peptides based on their sequences, however, they present biases and their performance on less-studied MHC alleles with limited experimental binding data is severely restricted by their sequence-based (SeqB) nature. We reason that structure-based (StrB) methods could learn the physico-chemical and geometrical rules of peptide-MHC (pMHC) complexes conserved among the alleles, thus generalizing better. We designed three supervised StrB geometric deep learning (GDL) methods, showing superior generalization across all StrB methods over two SeqB methods when the test data is distant from the training data. To further explore data efficiency, we designed a novel self-supervised GDL approach trained only on ∼1K x-ray structures, 3D-SSL, which predicts binding affinities without seeing any during training. Finally, we showcase our StrB method on a case study from the HPV vaccine design to show how StrB methods are robust to biases in the binding data. These findings highlight the potentials of structure-based methods in efficiently utilizing limited data, enhancing generalizability. This study bears important implications on data hungry fields, for example, the long-standing T cell receptor (TCR) specificity challenge.
Open AccessImproving generalizability for MHC-I binding peptide predictions through geometric deep learning
Understanding the peptide presentation mechanism of Major Histocompatibility Complex (MHC) is crucial to study the recognition of pathogens, the treatment of autoimmune diseases and in developing cancer immunotherapies. To comprehend these mechanisms and design effective therapies at affordable costs, it is fundamental to be able to precisely predict in silico which peptides can be bound by each MHC. Many computational approaches have been developed to identify MHC-binding peptides based on their sequences, however, they present biases and their performance on less-studied MHC alleles with limited experimental binding data is severely restricted by their sequence-based (SeqB) nature. We reason that structure-based (StrB) methods could learn the physico-chemical and geometrical rules of peptide-MHC (pMHC) complexes conserved among the alleles, thus generalizing better. We designed three supervised StrB geometric deep learning (GDL) methods, showing superior generalization across all StrB methods over two SeqB methods when the test data is distant from the training data. To further explore data efficiency, we designed a novel self-supervised GDL approach trained only on ∼1K x-ray structures, 3D-SSL, which predicts binding affinities without seeing any during training. Finally, we showcase our StrB method on a case study from the HPV vaccine design to show how StrB methods are robust to biases in the binding data. These findings highlight the potentials of structure-based methods in efficiently utilizing limited data, enhancing generalizability. This study bears important implications on data hungry fields, for example, the long-standing T cell receptor (TCR) specificity challenge.
- Open Access
- 15 December 2022
- Published by The Open Journal in Journal of Open Source Software
- Vol. 7 (80) , 4493
DIANNA: Deep Insight And Neural Network Analysis
The growing demand from science and industry inspired rapid advances in Artificial Intelligence (AI). The increased use of AI and the reliability and trust required by automated decision making and standards of scientific rigour, led to the boom of eXplainable Artificial Intelligence (XAI). DIANNA (Deep Insight And Neural Network Analysis) is the first Python package of systematically selected XAI methods supporting the Open Neural Networks Exchange (ONNX) format. DIANNA is built by and designed for all research software engineers and researchers, also non-AI experts.
- 15 December 2022
- Published by The Open Journal in Journal of Open Source Software
- Vol. 7 (80) , 4493
Open AccessDIANNA: Deep Insight And Neural Network Analysis
The growing demand from science and industry inspired rapid advances in Artificial Intelligence (AI). The increased use of AI and the reliability and trust required by automated decision making and standards of scientific rigour, led to the boom of eXplainable Artificial Intelligence (XAI). DIANNA (Deep Insight And Neural Network Analysis) is the first Python package of systematically selected XAI methods supporting the Open Neural Networks Exchange (ONNX) format. DIANNA is built by and designed for all research software engineers and researchers, also non-AI experts.