Caterina Gallegati
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Caterina Gallegati has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Monica Bianchini
Department of Information Engineering and Mathematics (DIISM), University of Siena, 53100 Siena, Italy
3 shared publications - Fiamma Romagnoli
Department of Information Engineering and Mathematics (DIISM), University of Siena, 53100 Siena, Italy
2 shared publications - Niccolò Pancino
Department of Information Engineering and Mathematics (DIISM), University of Siena, 53100 Siena, Italy
2 shared publications - Barbara Toniella Corradini
University of Siena
1 shared publication - Ben Cullen1 shared publication
- Elia Giuseppe Ceroni
National Research Council of Italy (CNR), Institute of Informatics and Telematics (IIT), 56127 Pisa, Italy
1 shared publication
Latest Publications
- Open Access
Hybrid BiLSTM–Graph Neural Networks Learn Efficient Secondary Structure Representations for Protein–Protein Interface Prediction
Protein–protein interfaces (PPIs) are essential for numerous biological processes and represent attractive targets for drug discovery and protein engineering. Although recent protein language models have enabled powerful sequence representations for downstream structural prediction tasks, they require substantial computational resources and produce general-purpose embeddings that are not optimized for specific applications. In this work, we investigate whether task-specific representation learning can provide a computationally efficient alternative for PPI prediction. Proteins are represented as graphs of secondary structure elements (SSEs), where each node corresponds to an SSE described by its ordered amino acid sequence and edges encode spatial relationships between neighboring SSEs. We propose an approach based on a hybrid Bidirectional Long Short-Term Memory–Graph Neural Network (BiLSTM-GNN) architecture that learns SSE embeddings directly from residue-level physicochemical descriptors and optimizes them jointly with a downstream graph neural network. The proposed approach is compared with an alternative pipeline based on pretrained ESM2 embeddings while keeping the graph representation and GNN architecture unchanged. Experimental results show that the task-specific BiLSTM encoder achieves competitive predictive performance with respect to the pretrained protein language model, in almost all the considered metrics, in the most challenging evaluation setting while requiring a lower computational effort. These findings suggest that end-to-end task-specific representation learning constitutes an effective and efficient alternative to pretrained protein language models for PPI prediction.
Open AccessHybrid BiLSTM–Graph Neural Networks Learn Efficient Secondary Structure Representations for Protein–Protein Interface Prediction
Protein–protein interfaces (PPIs) are essential for numerous biological processes and represent attractive targets for drug discovery and protein engineering. Although recent protein language models have enabled powerful sequence representations for downstream structural prediction tasks, they require substantial computational resources and produce general-purpose embeddings that are not optimized for specific applications. In this work, we investigate whether task-specific representation learning can provide a computationally efficient alternative for PPI prediction. Proteins are represented as graphs of secondary structure elements (SSEs), where each node corresponds to an SSE described by its ordered amino acid sequence and edges encode spatial relationships between neighboring SSEs. We propose an approach based on a hybrid Bidirectional Long Short-Term Memory–Graph Neural Network (BiLSTM-GNN) architecture that learns SSE embeddings directly from residue-level physicochemical descriptors and optimizes them jointly with a downstream graph neural network. The proposed approach is compared with an alternative pipeline based on pretrained ESM2 embeddings while keeping the graph representation and GNN architecture unchanged. Experimental results show that the task-specific BiLSTM encoder achieves competitive predictive performance with respect to the pretrained protein language model, in almost all the considered metrics, in the most challenging evaluation setting while requiring a lower computational effort. These findings suggest that end-to-end task-specific representation learning constitutes an effective and efficient alternative to pretrained protein language models for PPI prediction.
- Open Access
- 31 October 2025
- Published by Elsevier in Neurocomputing
- Vol. 661
Training dynamics of GANs through the lens of persistent homology
- 31 October 2025
- Published by Elsevier in Neurocomputing
- Vol. 661
Open AccessTraining dynamics of GANs through the lens of persistent homology
- Open Access
- 28 May 2024
- Published by MDPI AG in International Journal of Molecular Sciences
- Vol. 25 (11) , 5870
Protein–Protein Interfaces: A Graph Neural Network Approach
Protein–protein interactions (PPIs) are fundamental processes governing cellular functions, crucial for understanding biological systems at the molecular level. Compared to experimental methods for PPI prediction and site identification, computational deep learning approaches represent an affordable and efficient solution to tackle these problems. Since protein structure can be summarized as a graph, graph neural networks (GNNs) represent the ideal deep learning architecture for the task. In this work, PPI prediction is modeled as a node-focused binary classification task using a GNN to determine whether a generic residue is part of the interface. Biological data were obtained from the Protein Data Bank in Europe (PDBe), leveraging the Protein Interfaces, Surfaces, and Assemblies (PISA) service. To gain a deeper understanding of how proteins interact, the data obtained from PISA were assembled into three datasets: Whole, Interface, and Chain, consisting of data on the whole protein, couples of interacting chains, and single chains, respectively. These three datasets correspond to three different nuances of the problem: identifying interfaces between protein complexes, between chains of the same protein, and interface regions in general. The results indicate that GNNs are capable of solving each of the three tasks with very good performance levels.
- 28 May 2024
- Published by MDPI AG in International Journal of Molecular Sciences
- Vol. 25 (11) , 5870
Open AccessProtein–Protein Interfaces: A Graph Neural Network Approach
Protein–protein interactions (PPIs) are fundamental processes governing cellular functions, crucial for understanding biological systems at the molecular level. Compared to experimental methods for PPI prediction and site identification, computational deep learning approaches represent an affordable and efficient solution to tackle these problems. Since protein structure can be summarized as a graph, graph neural networks (GNNs) represent the ideal deep learning architecture for the task. In this work, PPI prediction is modeled as a node-focused binary classification task using a GNN to determine whether a generic residue is part of the interface. Biological data were obtained from the Protein Data Bank in Europe (PDBe), leveraging the Protein Interfaces, Surfaces, and Assemblies (PISA) service. To gain a deeper understanding of how proteins interact, the data obtained from PISA were assembled into three datasets: Whole, Interface, and Chain, consisting of data on the whole protein, couples of interacting chains, and single chains, respectively. These three datasets correspond to three different nuances of the problem: identifying interfaces between protein complexes, between chains of the same protein, and interface regions in general. The results indicate that GNNs are capable of solving each of the three tasks with very good performance levels.