EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

PaleAle 6.0: Prediction of Protein Relative Solvent Accessibility by Leveraging Pre-Trained Language Models (PLMs)

Wafa Alanazi iD, Di Meng iD, Gianluca Pollastri iD

Biomolecules · 2025

DOI: 10.3390/biom15010049 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Biomolecules, 2025. Verfasst von Wafa Alanazi und 2 weiteren Autor:innen. Beteiligte Einrichtung: School of Computer Science, University College Dublin (UCD), D04 V1W8 Dublin, Ireland. Hauptthemen laut MEDLINE: Solvents, Proteins. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Northern Border University, Arar, KSA, Science Foundation of Ireland.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Predicting the relative solvent accessibility (RSA) of a protein is critical to understanding its 3D structure and biological function. RSA prediction, especially when homology transfer cannot provide information about a protein’s structure, is a significant step toward addressing the protein structure prediction challenge. Today, deep learning is arguably the most powerful method for predicting RSA and other structural features of proteins. In particular, recent breakthroughs in deep learning—driven by the integration of natural language processing (NLP) algorithms—have significantly advanced the field of protein research. Inspired by the remarkable success of NLP techniques, this study leverages pre-trained language models (PLMs) to enhance RSA prediction. We present a deep neural network architecture based on a combination of bidirectional recurrent neural networks and convolutional layers that can analyze long-range interactions within protein sequences and predict protein RSA using ESM-2 encoding. The final predictor, PaleAle 6.0, predicts RSA in real values as well as two-state (exposure threshold of 25%) and four-state (exposure thresholds of 4%, 25%, and 50%) discrete classifications. On the 2022 test set dataset, PaleAle 6.0 achieved over 82% accuracy for two-state RSA (RSA_2C) and 59.75% accuracy for four-state RSA (RSA_4C), with a Pearson correlation coefficient (PCC) of 77.88 for real-value RSA prediction. When evaluated on the more challenging 2024 test set, PaleAle 6.0 maintained a strong performance, achieving 79.74% accuracy in the two-state prediction and 55.30% accuracy in the four-state prediction, with a PCC of 73.08 for real-value predictions, outperforming all previously benchmarked predictors.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

SolventsProteinsNatural Language ProcessingNeural Networks, ComputerDeep LearningAlgorithmsProtein ConformationDatabases, ProteinSoftware

Stichwörter der Autor:innen

bioinformaticscomputational biologydeep learningnatural language processingprotein structure predictionstructural bioinformatics

Substanzen

SolventsProteins

Autor:innen und Institutionen

  • School of Computer Science, University College Dublin (UCD), D04 V1W8 Dublin, Ireland.
  • Department of Computer Science, College of Science, Northern Border University, Arar 73241, Saudi Arabia.

ORCID-Profile: Wafa Alanazi, Di Meng, Gianluca Pollastri

Förderung

  • Northern Border University, Arar, KSA
  • Science Foundation of Ireland

Zitieren

APA

Alanazi, W., Meng, D., & Pollastri, G. (2025). PaleAle 6.0: Prediction of Protein Relative Solvent Accessibility by Leveraging Pre-Trained Language Models (PLMs). Biomolecules. https://doi.org/10.3390/biom15010049

Vancouver

Alanazi W, Meng D, Pollastri G. PaleAle 6.0: Prediction of Protein Relative Solvent Accessibility by Leveraging Pre-Trained Language Models (PLMs). Biomolecules. 2025. doi:10.3390/biom15010049

BibTeX
@article{Alanazi2025,
  author = {Alanazi, Wafa and Meng, Di and Pollastri, Gianluca},
  title = {PaleAle 6.0: Prediction of Protein Relative Solvent Accessibility by Leveraging Pre-Trained Language Models (PLMs)},
  journal = {Biomolecules},
  year = {2025},
  doi = {10.3390/biom15010049}
}
Kostenlos starten →