Skip to content

Fast and Interpretable Estimation of Amino Acid Residue Surface Accessibility Based on Protein Contact Graph

Sep 2026 · Physchem · 29 references
Protein Structure and Dynamics

Abstract

Relevance. The solvent accessible surface area (SASA) of amino acid residues is a key characteristic for protein structure analysis, but precise methods for calculating it (e.g., FreeSASA) are computationally expensive. Empirical approximations based on the res-idue interaction network (RIN) graph can provide high speed while maintaining ac-ceptable accuracy. Proposed approach. Three empirical functions for estimating relative SASA are pro-posed: approx_sasa, surface_score, and exp_sasa using the degree of the node in RIN as an argument. We present a comparative study of two approaches to graph construction: the classical Cα-graph (threshold 8 Å) and the graph of heavy atoms (Heavy-Atom Graph, HAG, threshold 5.0 Å). The parameters were calibrated on a sample of 509 protein structures (128,794 residues) from various origins using the true relative SASA calculated by the FreeSASA library. Main results. An extended set of 11 RIN topological features was developed and vali-dated, including basic node characteristics, centrality measures (betweenness, eigen-vector, closeness) and hydrophobic subgraph features. Training ensemble models (Random Forest, XGBoost) with these features made it possible to achieve: Random Forest on HAG: MAE = 0.057 ± 0.033, Pearson r = 0.915 ± 0.080 (best result), Random Forest on Cα graph: MAE = 0.066 ± 0.041, Pearson r = 0.890 ± 0.100. Comparison with GNN. We compared our approach with graph neural networks (GCN, GAT, GraphSAGE). GraphSAGE on HAG showed a result close to Random Forest: MAE = 0.0715, Pearson r = 0.8917, indicating the potential applicability of graph neural net-works when using HAG. GCN and GAT performed significantly worse (MAE = 0.14–0.15, Pearson r = 0.51–0.61). Computational efficiency. Empirical formulas are calculated in 0.008 ms per structure (~26,000× faster than FreeSASA), Random Forest in prediction mode is calculated in 36.5 ms (~6× faster than FreeSASA). HAG construction takes 21 times longer than a Cα graph (279.5 ms vs. 13.3 ms). Practical significance. The proposed empirical features are recommended for large-scale pipelines critical to speed and interpretability. Random Forest on HAG is the optimal choice for tasks that require maximum accuracy (MAE = 0.057, Pearson r = 0.915). GraphSAGE on HAG can be considered as an alternative when using deep learning.

View source

Similar papers

#computer vision Conference Aug 2008

Scrum in a Multiproject Environment: An Ethnographically-Inspired Case Study on the Adoption Challenges

Agile methods continue to gain popularity. In particular, the Scrum method appears to be on the verge of becoming a de-facto standard in the industry, leading the so called Agile movement. While there are success stories and recommendations, there is little scientifically valid evidence of the challenges in the adoption of Agile methods in general, and Scrum in particular. Little, if anything, is empirically known about the application and adoption of Scrum in a multi-team and multi-project situation. The authors carried out an ethnographically informed longitudinal case study in industrial settings and closely followed how the Scrum method was adopted in a 20-person department, working in a simultaneous multi-project R&D environment. Altogether 10 challenges pertinent to the case of multi-team multi-project Scrum adoption were identified in the study. The authors contend that these results carry great relevance for other industrial teams. Future research avenues arising from the study are indicated.

A. Marchenko, P. Abrahamsson · 59 citations · ⚡11
#computer vision Open access Sep 2012

Making the leap to a software platform strategy: Issues and challenges

Context: While there are many success stories of achieving high reuse and improved quality using software platforms, there is a need to investigate the issues and challenges organizations face when transitioning to a software platform strategy. Objective: This case study provides a comprehensive taxonomy of the challenges faced when a medium-scale organization decided to adopt software platforms. The study also reveals how new trends in software engineering (i.e. agile methods, distributed development, and flat management structures) interplayed with the chosen platform strategy. Method: We used an ethnographic approach to collect data by spending time at a medium-scale company in Scandinavia. We conducted 16in-depth interviews with representatives of eight different teams, three of which were working on three separate platforms. The collected data was analyzed using Grounded Theory. Results: The findings identify four classes of challenges, namely: business challenges, organizational challenges, technical challenges, and people challenges. The article explains how these findings can be used to help researchers and practitioners identify practical solutions and required tool support. Conclusion: The organization's decision to adopt a software platform strategy introduced a number of challenges. These challenges need to be understood and addressed in order to reap the benefits of reuse. Researchers need to further investigate issues such as supportive organizational structures for platform development, the role of agile methods in software platforms, tool support for testing and continuous integration in the platform context, and reuse recommendation systems.

Yaser Ghanam, F. Maurer, P. Abrahamsson · 41 citations · ⚡3
#computer vision Review Open access Aug 2013

A framework for systematic analysis of open access journals and its application in software engineering and information systems

This article is a contribution towards an understanding of open access (OA) publishing. It proposes an analysis framework of 18 core attributes, divided into the areas of bibliographic information, activity metrics, economics, accessibility, and predatory issues. The framework has been employed in a systematic analysis of 30 OA journals in software engineering (SE) and information systems (IS), which were selected from among 386 OA journals in Computer Science from the Directory of OA Journals. An analysis was performed on the sample of the journals, to provide an overview of the current situation of OA journals in the fields of SE and IS. The journals were then compared between-group, according to the presence of article processing charges. A within-group analysis was performed on the journals requesting article processing charges from authors, in order to understand what is the value added according to different price ranges. This article offers several contributions. It presents an overview of OA definitions and models. It provides an analysis framework born from the observation of data and the existing literature. It raises the need to study OA in the fields of SE and IS while offering a first analysis. Finally, it provides recommendations to readers of OA journals. This paper highlights several concerns still threatening the adoption of OA publishing in the fields of SE and IS. Among them, it is shown that high article processing charges are not sufficiently justified by the publishers, which often lack transparency and may prevent authors from adopting OA.

D. Graziotin, Xiaofeng Wang, P. Abrahamsson · 21 citations · ⚡1
#machine learning Open access Mar 2024

Integration of molecular coarse-grained model into geometric representation learning framework for protein-protein complex property prediction

Structure-based machine learning algorithms have been utilized to predict the properties of protein-protein interaction (PPI) complexes, such as binding affinity, which is critical for understanding biological mechanisms and disease treatments. While most existing algorithms represent PPI complex graph structures at the atom-scale or residue-scale, these representations can be computationally expensive or may not sufficiently integrate finer chemical-plausible interaction details for improving predictions. Here, we introduce MCGLPPI, a novel geometric representation learning framework that combines graph neural networks (GNNs) with the MARTINI molecular coarse-grained (CG) model to predict overall PPI properties accurately and efficiently. This framework maps proteins onto a concise CG-scale complex graph, where nodes represent CG beads and edges encode chemically plausible interactions. The GNN-based encoder is tailored to extract high-quality representations from this graph, efficiently capturing the overall properties of the protein complex structure. Extensive experiments on three different downstream PPI property prediction tasks demonstrate that MCGLPPI achieves competitive performance compared with the counterparts at the atom- and residue-scale, but with only a third of the computational resource consumption. Furthermore, the CG-scale pre-training on protein domain-domain interaction structures enhances its predictive capabilities for PPI tasks. MCGLPPI offers an effective and efficient solution for PPI overall property predictions, serving as a promising tool for the large-scale analysis of biomolecular interactions.

Yang Yue, Shu Li, Yihua Cheng et al. · 14 citations

PepPCBench is a Comprehensive Benchmarking Framework for Protein-Peptide Complex Structure Prediction

Accurate modeling of protein-peptide interactions is essential for understanding fundamental biological processes and designing peptide-based drugs. However, predicting the complex structures of these interactions remains challenging, primarily due to the high conformational flexibility of peptides. To support a fair and systematic evaluation of recent deep learning (DL) approaches, we introduce PepPCBench, a benchmarking framework tailored to assess protein folding neural networks (PFNNs) in protein-peptide complex prediction. As part of this framework, we curated PepPCSet, a data set of 261 experimentally resolved complexes with peptides ranging from 5 to 30 residues. We benchmark five full-atom PFNNs, including AlphaFold3 (AF3), AlphaFold-Multimer (AFM), Chai-1, HelixFold3 (HF3), and RoseTTAFold-All-Atom (RFAA), using comprehensive evaluation metrics. Our benchmarking reveals meaningful performance differences among these methods and highlights the influence of peptide length, conformational flexibility, and training set similarity on prediction accuracy. While AF3 shows strong performance in structure prediction, further analysis indicates that confidence metrics correlate poorly with experimental binding affinities, underscoring the need for improved scoring strategies and generalizability. By providing a reproducible and extensible framework, PepPCBench enables a robust evaluation of PFNN-based methods and supports their continued development for peptide-protein structure prediction.

Silong Zhai, Huifeng Zhao, Jike Wang et al. · 13 citations · ⚡1
#machine learning Open access Jun 2025

AntiBMPNN: Structure‐Guided Graph Neural Networks for Precision Antibody Engineering

Antibodies are crucial for medical applications, yet traditional methods for designing sequences are inefficient. This study introduces AntiBMPNN, an advanced deep‐learning framework that leverages an antibody‐specific 3D dataset, a fine‐tuned message‐passing neural network (MPNN), a frequency‐based scoring function, and AlphaFold 3 to achieve highly accurate antibody sequence design. AntiBMPNN surpasses ProteinMPNN with a perplexity of 1.5 and over 80% sequence recovery. Its scoring function, combined with AlphaFold 3, effectively prioritizes sequences based on structural recovery, positional stability, and biochemical or complex properties. Experimental validation highlights a 75% success rate in single‐point antibody design. AntiBMPNN consistently outperforms AbMPNN, AntiFold, and ProteinMPNN in designing complementarity determining regions (CDR) 1‐3, yielding stronger binding affinities. For CDR1 of huJ3 (anti‐HIV nanobody), it achieves a half maximal effective concentration (EC₅₀) of 9.2 nM (nanomolar), better than ProteinMPNN (135.2 nM) and AntiFold (59.3 nM), and comparable to AbMPNN (6.6 nM). For CDR2 of the D6 nanobody (targeting CD16), AntiBMPNN reaches 0.3 nM, outperforming AbMPNN (2.3 nM), AntiFold (0.7 nM), and ProteinMPNN (0.7 nM). In CDR3 of huJ3, it achieves 1.7 nM, surpassing AbMPNN (51.2 nM), with no detectable activity from AntiFold or ProteinMPNN. These findings confirm that AntiBMPNN‐designed sequences for J3 and D6 outperform the originals, highlighting its potential to improve therapeutic antibody design.

Ze-Yu Sun, Jiayi Yuan, Divya Jaiswal et al. · 9 citations

Related blog posts