Gerardo Tauriello
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Gerardo Tauriello has a total of 287 co-authors. Here are the top co-authors by number of shared publications:
- Torsten Schwede
Biozentrum, University of Basel , Basel 4056
32 shared publications - Gabriel Studer
Biozentrum, University of Basel, Basel, Switzerland
13 shared publications - Janani Durairaj
Biozentrum, University of Basel, Basel, Switzerland
13 shared publications - Petros Koumoutsakos
School of Engineering and Applied Sciences, Harvard University, Cambridge, USA
9 shared publications - Stefan Bienert
Biozentrum, University of Basel, Basel, Switzerland
8 shared publications - Peter Škrinjar
Biozentrum, University of Basel, Basel, Switzerland
7 shared publications
Latest Publications
- Open Access
- 1 August 2026
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 42 (Supplement)
Stoic : fast and accurate protein stoichiometry prediction
Motivation: Protein complexes are central to cellular function, but experimental determination of their structures remains challenging. Structure prediction methods require prior knowledge of stoichiometry—the number of copies of each protein entity within a complex. Current approaches rely on computationally expensive brute-force methods that run structure prediction on multiple stoichiometry combinations, often with limited accuracy. Results: We introduce Stoic, a method that uses protein language model embeddings to predict protein complex stoichiometry. Our approach learns to identify interface residues that participate in protein-protein interactions, rather than relying on global sequence features. By integrating these interface-aware embeddings into a graph neural network, Stoic achieves fast and accurate stoichiometry prediction for both homomeric and heteromeric targets. Availability: Source code for inference and training along with web versions are available in the repository at https://github.com/PickyBinders/stoic.
- 1 August 2026
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 42 (Supplement)
Open AccessStoic : fast and accurate protein stoichiometry prediction
Motivation: Protein complexes are central to cellular function, but experimental determination of their structures remains challenging. Structure prediction methods require prior knowledge of stoichiometry—the number of copies of each protein entity within a complex. Current approaches rely on computationally expensive brute-force methods that run structure prediction on multiple stoichiometry combinations, often with limited accuracy. Results: We introduce Stoic, a method that uses protein language model embeddings to predict protein complex stoichiometry. Our approach learns to identify interface residues that participate in protein-protein interactions, rather than relying on global sequence features. By integrating these interface-aware embeddings into a graph neural network, Stoic achieves fast and accurate stoichiometry prediction for both homomeric and heteromeric targets. Availability: Source code for inference and training along with web versions are available in the repository at https://github.com/PickyBinders/stoic.
- Top Cited PapersOpen Access
- 8 May 2026
- Published by Springer Nature in Nature Structural & Molecular Biology
- Vol. 33 (5) , 782-794
Evaluating generalization in protein–ligand cofolding methods
Deep learning has driven major breakthroughs in protein structure prediction; however, one of the next critical steps forward is accurately predicting how proteins interact with small-molecule ligands, to enable real-world applications such as drug discovery. Recent cofolding methods aim to address this challenge, but evaluating their performance has been inconclusive because of the lack of relevant benchmarking datasets. Here we present a comprehensive evaluation of four leading all-atom cofolding methods using our newly introduced benchmark dataset, Runs N’ Poses. Runs N’ Poses comprises 2,600 high-resolution protein–ligand systems released after the training cutoff used by these methods. We demonstrate that current cofolding approaches largely memorize ligand poses from their training data, hindering their use for de novo drug design. With this assessment and benchmark dataset, we aim to accelerate progress in the field by allowing for a more realistic assessment of the current state-of-the-art deep learning methods for predicting protein–ligand interactions.
- 8 May 2026
- Published by Springer Nature in Nature Structural & Molecular Biology
- Vol. 33 (5) , 782-794
Top Cited PapersOpen AccessEvaluating generalization in protein–ligand cofolding methods
Deep learning has driven major breakthroughs in protein structure prediction; however, one of the next critical steps forward is accurately predicting how proteins interact with small-molecule ligands, to enable real-world applications such as drug discovery. Recent cofolding methods aim to address this challenge, but evaluating their performance has been inconclusive because of the lack of relevant benchmarking datasets. Here we present a comprehensive evaluation of four leading all-atom cofolding methods using our newly introduced benchmark dataset, Runs N’ Poses. Runs N’ Poses comprises 2,600 high-resolution protein–ligand systems released after the training cutoff used by these methods. We demonstrate that current cofolding approaches largely memorize ligand poses from their training data, hindering their use for de novo drug design. With this assessment and benchmark dataset, we aim to accelerate progress in the field by allowing for a more realistic assessment of the current state-of-the-art deep learning methods for predicting protein–ligand interactions.
- Open Access
Stoic: Fast and accurate protein stoichiometry prediction
Motivation: Protein complexes are central to cellular function, but experimental determination of their structures remains challenging. Structure prediction methods require prior knowledge of stoichiometry - the number of copies of each protein entity within a complex. Current approaches rely on computationally expensive brute-force methods that run structure prediction on multiple stoichiometry combinations, often with limited accuracy. Results: We introduce Stoic , a method that uses protein language model embeddings to predict protein complex stoichiometry. Our approach learns to identify interface residues that participate in protein-protein interactions, rather than relying on global sequence features. By integrating these interface-aware embeddings into a graph neural network, Stoic achieves fast and accurate stoichiometry prediction for both homomeric and heteromeric targets. Availability: Source code for inference and training along with web versions are available in the repository at https://github.com/PickyBinders/stoic . Contact: janani.durairaj@unibas.ch
Open AccessStoic: Fast and accurate protein stoichiometry prediction
Motivation: Protein complexes are central to cellular function, but experimental determination of their structures remains challenging. Structure prediction methods require prior knowledge of stoichiometry - the number of copies of each protein entity within a complex. Current approaches rely on computationally expensive brute-force methods that run structure prediction on multiple stoichiometry combinations, often with limited accuracy. Results: We introduce Stoic , a method that uses protein language model embeddings to predict protein complex stoichiometry. Our approach learns to identify interface residues that participate in protein-protein interactions, rather than relying on global sequence features. By integrating these interface-aware embeddings into a graph neural network, Stoic achieves fast and accurate stoichiometry prediction for both homomeric and heteromeric targets. Availability: Source code for inference and training along with web versions are available in the repository at https://github.com/PickyBinders/stoic . Contact: janani.durairaj@unibas.ch
- Open Access
- 22 January 2026
- Published by Elsevier in Journal of Molecular Biology
- Vol. 438 (18) , 169658
ModelCIF Update: Supporting Emerging Classes of Computational Macromolecular Models
- 22 January 2026
- Published by Elsevier in Journal of Molecular Biology
- Vol. 438 (18) , 169658
Open AccessModelCIF Update: Supporting Emerging Classes of Computational Macromolecular Models
- Open Access
- 22 December 2025
- Published by Springer Nature in Nature Methods
- Vol. 23 (2) , 387-394
A fully automated benchmarking suite to compare macromolecular complexes
Protein structure prediction has a long history of benchmarking efforts such as critical assessment of structure prediction, continuous automated model evaluation and critical assessment of prediction of interactions. With the rise of artificial intelligence-based methods for prediction of macromolecular complexes, benchmarking with large datasets and robust, unsupervised scores to compare predictions against a reference has become essential. Also, the increasing size and complexity of experimentally determined reference structures by crystallography or cryogenic electron microscopy poses challenges for structure comparison methods. Here we review the current state of the art in scoring methodologies, identify existing limitations and present more suitable approaches for scoring of tertiary and quaternary structures, protein–protein interfaces and protein–ligand complexes. Our methods are designed to scale efficiently, enabling the assessment of large, complex systems. All developments are available in the structure benchmarking framework of OpenStructure. OpenStructure is open source software and available for free at https://openstructure.org/ .
- 22 December 2025
- Published by Springer Nature in Nature Methods
- Vol. 23 (2) , 387-394
Open AccessA fully automated benchmarking suite to compare macromolecular complexes
Protein structure prediction has a long history of benchmarking efforts such as critical assessment of structure prediction, continuous automated model evaluation and critical assessment of prediction of interactions. With the rise of artificial intelligence-based methods for prediction of macromolecular complexes, benchmarking with large datasets and robust, unsupervised scores to compare predictions against a reference has become essential. Also, the increasing size and complexity of experimentally determined reference structures by crystallography or cryogenic electron microscopy poses challenges for structure comparison methods. Here we review the current state of the art in scoring methodologies, identify existing limitations and present more suitable approaches for scoring of tertiary and quaternary structures, protein–protein interfaces and protein–ligand complexes. Our methods are designed to scale efficiently, enabling the assessment of large, complex systems. All developments are available in the structure benchmarking framework of OpenStructure. OpenStructure is open source software and available for free at https://openstructure.org/ .
- Open Access
Rewriting protein alphabets with language models
Detecting remote homology with speed and sensitivity is crucial for tasks like function annotation and structure prediction. We introduce a novel approach using contrastive learning to convert protein language model embeddings into a new 20-letter alphabet, TEA, enabling highly efficient large-scale protein homology searches. Searching with our alphabet performs on par with and complements structure-based methods without requiring any structural information, and with the speed of sequence search. Ultimately, we bring the exciting advances in protein language model representation learning to the plethora of sequence bioinformatics algorithms developed over the past half-century, offering a powerful new tool for biological discovery.
Open AccessRewriting protein alphabets with language models
Detecting remote homology with speed and sensitivity is crucial for tasks like function annotation and structure prediction. We introduce a novel approach using contrastive learning to convert protein language model embeddings into a new 20-letter alphabet, TEA, enabling highly efficient large-scale protein homology searches. Searching with our alphabet performs on par with and complements structure-based methods without requiring any structural information, and with the speed of sequence search. Ultimately, we bring the exciting advances in protein language model representation learning to the plethora of sequence bioinformatics algorithms developed over the past half-century, offering a powerful new tool for biological discovery.
- Open Access
- 28 September 2025
- Published by Wiley in Proteins: Structure, Function, and Bioinformatics
- Vol. 94 (1) , 403-413
Beyond Single Chains: Benchmarking Macromolecular Complex Prediction Methods With the Continuous Automated Model EvaluatiOn ( CAMEO )
Independent, blind assessment of structure prediction methods is essential for establishing state‐of‐the‐art performance, identifying limitations, and guiding future developments. The Continuous Automated Model EvaluatiOn (CAMEO) platform provides weekly, automated benchmarking of structure prediction servers, complementing the biennial Critical Assessment of Structure Prediction (CASP) experiments.
- 28 September 2025
- Published by Wiley in Proteins: Structure, Function, and Bioinformatics
- Vol. 94 (1) , 403-413
Open AccessBeyond Single Chains: Benchmarking Macromolecular Complex Prediction Methods With the Continuous Automated Model EvaluatiOn ( CAMEO )
Independent, blind assessment of structure prediction methods is essential for establishing state‐of‐the‐art performance, identifying limitations, and guiding future developments. The Continuous Automated Model EvaluatiOn (CAMEO) platform provides weekly, automated benchmarking of structure prediction servers, complementing the biennial Critical Assessment of Structure Prediction (CASP) experiments.
- Open Access
- 14 August 2025
- Published by Springer Nature in Research Square
Have protein-ligand cofolding methods moved beyond memorisation?
Deep learning has driven major breakthroughs in protein structure prediction, however the next critical advance is accurately predicting how proteins interact with small molecule ligands, to enable real-world applications such as drug discovery. Recent cofolding methods aim to address this challenge, but evaluating their performance has been inconclusive due to the lack of relevant benchmarking datasets. Here we present a comprehensive evaluation of four leading all-atom cofolding methods using our newly introduced benchmark dataset Runs N' Poses, which comprises 2,600 high-resolution protein-ligand systems released after the training cutoff used by these methods. We demonstrate that current cofolding approaches largely memorise ligand poses from their training data, hindering their use for de novo drug design. With this assessment and benchmark dataset, we aim to accelerate progress in the field by allowing for a more realistic assessment of the current state-of-the-art deep learning methods for predicting protein-ligand interactions.
- 14 August 2025
- Published by Springer Nature in Research Square
Open AccessHave protein-ligand cofolding methods moved beyond memorisation?
Deep learning has driven major breakthroughs in protein structure prediction, however the next critical advance is accurately predicting how proteins interact with small molecule ligands, to enable real-world applications such as drug discovery. Recent cofolding methods aim to address this challenge, but evaluating their performance has been inconclusive due to the lack of relevant benchmarking datasets. Here we present a comprehensive evaluation of four leading all-atom cofolding methods using our newly introduced benchmark dataset Runs N' Poses, which comprises 2,600 high-resolution protein-ligand systems released after the training cutoff used by these methods. We demonstrate that current cofolding approaches largely memorise ligand poses from their training data, hindering their use for de novo drug design. With this assessment and benchmark dataset, we aim to accelerate progress in the field by allowing for a more realistic assessment of the current state-of-the-art deep learning methods for predicting protein-ligand interactions.
- Open Access
- 4 March 2025
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 41 (3)
AlphaPulldown2—a general pipeline for high-throughput structural modeling
Summary: AlphaPulldown2 streamlines protein structural modeling by automating workflows, improving code adaptability, and optimizing data management for large-scale applications. It introduces an automated Snakemake pipeline, compressed data storage, support for additional modeling backends like UniFold and AlphaLink2, and a range of other improvements. These upgrades make AlphaPulldown2 a versatile platform for predicting both binary interactions and complex multi-unit assemblies. Availability and implementation: AlphaPulldown2 is freely available at https://github.com/KosinskiLab/AlphaPulldown.
- 4 March 2025
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 41 (3)
Open AccessAlphaPulldown2—a general pipeline for high-throughput structural modeling
Summary: AlphaPulldown2 streamlines protein structural modeling by automating workflows, improving code adaptability, and optimizing data management for large-scale applications. It introduces an automated Snakemake pipeline, compressed data storage, support for additional modeling backends like UniFold and AlphaLink2, and a range of other improvements. These upgrades make AlphaPulldown2 a versatile platform for predicting both binary interactions and complex multi-unit assemblies. Availability and implementation: AlphaPulldown2 is freely available at https://github.com/KosinskiLab/AlphaPulldown.
- Open Access
- 17 February 2025
- Published by Springer Nature in Research Square
Comparing macromolecular complexes - a fully automated benchmarking suite
Protein structure prediction has a long history of benchmarking such as CASP, CAMEO and CAPRI. With the rise of AI-based methods for prediction of macromolecular complexes, benchmarking with large datasets and robust, automated scores to compare predictions against a reference has become essential. Also, the increasing size and complexity of experimentally determined reference structures by crystallography or cryo EM poses challenges for structure comparison methods. In this manuscript, we review the current state of the art in scoring methodologies, identify existing limitations, and present novel approaches for automated scoring of tertiary and quaternary structures, protein-protein interfaces, and protein-ligand complexes. Our methods are designed to scale efficiently, enabling the assessment of large, complex systems. All developments are available in the structure benchmarking framework of OpenStructure. OpenStructure is open source software and available for free at https://openstructure.org/.
- 17 February 2025
- Published by Springer Nature in Research Square
Open AccessComparing macromolecular complexes - a fully automated benchmarking suite
Protein structure prediction has a long history of benchmarking such as CASP, CAMEO and CAPRI. With the rise of AI-based methods for prediction of macromolecular complexes, benchmarking with large datasets and robust, automated scores to compare predictions against a reference has become essential. Also, the increasing size and complexity of experimentally determined reference structures by crystallography or cryo EM poses challenges for structure comparison methods. In this manuscript, we review the current state of the art in scoring methodologies, identify existing limitations, and present novel approaches for automated scoring of tertiary and quaternary structures, protein-protein interfaces, and protein-ligand complexes. Our methods are designed to scale efficiently, enabling the assessment of large, complex systems. All developments are available in the structure benchmarking framework of OpenStructure. OpenStructure is open source software and available for free at https://openstructure.org/.