Three empirical functions for estimating relative SASA—approx_sasa, surface_score, and exp_sasa—using node degree as the sole argument are proposed and validated and shown to be suitable for large-scale pipelines requiring both speed and interpretability.
Abstract
The solvent-accessible surface area (SASA) of amino acid residues is a crucial parameter for protein structure analysis; however, precise computational methods such as FreeSASA are computationally expensive. As an alternative, empirical approximations based on residue interaction network (RIN) graphs can offer high speed while maintaining acceptable accuracy. In this study, we propose and validate three empirical functions for estimating relative SASA—approx_sasa, surface_score, and exp_sasa—using node degree as the sole argument. We present a comparative analysis of two graph construction approaches: the classical Cα-graph (8 Å threshold) and the heavy-atom graph (HAG, 5.0 Å threshold). Parameters were calibrated on a dataset of 509 protein structures (128,794 residues) using the true relative SASA calculated by the FreeSASA library. An extended set of 11 topological features was also developed and validated. Ensemble models (Random Forest, XGBoost) achieved a best performance of MAE = 0.057 ± 0.033 and Pearson r = 0.915 ± 0.080 on HAG, outperforming graph neural networks (GCN, GAT, GraphSAGE) in this setting. The empirical formulas demonstrate extreme computational efficiency (0.008 ms per structure), ~26,000× faster than FreeSASA, making them suitable for large-scale pipelines requiring both speed and interpretability. Random Forest on HAG is recommended for applications requiring maximum accuracy, while GraphSAGE on HAG is a viable deep learning alternative.
Accurate residue-level prediction of protein–protein interaction interfaces is important for elucidating molecular recognition mechanisms and guiding targeted drug design. However, interface residues are relatively sparse and governed by complex spatial dependencies, making their accurate identification challenging....
Zhen Hou, Wei He, Wei-Nan Cao et al.· ACS Omega· 0 citations
Accurate identification of protein-protein interactions (PPIs) is fundamental for understanding cellular mechanisms and facilitating drug discovery. Although high-throughput experimental methods have expanded the known interactome, they remain resourceintensive and prone to noise. Consequently, computational approaches...
Pantelis Makrygiannis, Nikitas-Rigas Kalogeropoulos, Agorakis Bompotas et al.· International journal on art...· 0 citations
The site-unspecific couplings are interpreted, which are not influenced by selection for protein folding stability, as the result of variations of global mutational or selective forces across the lineages where the proteins evolve.
Fatemeh Saebi, Jonas Minning, U. Bastolla· Journal of Molecular Evoluti...· 0 citations
Prot2Surf was tested using catalytic domains of the lytic polysaccharide monooxygenases, interacting with native surfaces, showing that the software can efficiently analyze key binding features, including protein–surface distances, distances between catalytically reactive atoms, and the orientation angle between surfac...
Abraham Muñiz-Chicharro, Gamze Tanriver, Artur Góra· bioRxiv· 0 citations
GroScore is an open-source Python toolkit that automates the scoring of protein–protein structures using bidirectional steered molecular dynamics (SMD) simulations with explicit solvent. Building on a previously published unidirectional pulling approach, the current version introduces bidirectional pulling (unbinding...
J. W. Perthold, Dražen Petrov, C. Oostenbrink· Journal of Chemical Informat...· 0 citations
Abstract For more than 50 years, the linear sequence and the multiple sequence alignment have been the foundational data structures of protein science, and they remain central to homology search, phylogenetic inference, covariance-based contact prediction, and modern protein language models. However, relational and gra...
Dana S. Matthews, S. B. Pulsford, Anthony Barancewicz et al.· Biochemical Journal· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
MIT News · Artificial Intelligence· news.mit.eduJul 15, 2026
Assistant Professor Pat Pataranutaporn describes a new interface that lets everyday users glimpse inside an AI's neural network before their chatbot ever says a word.
Microsoft Research Blog· microsoft.comJul 13, 2026
Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduJul 6, 2026
PhD student Rachel Sava, winner of the Envisioning the Future of Computing Prize, explores transformative improvements and dystopian risks of neural technology.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.