bioRxiv Science⌕ Search

bioRxiv · 10.1101/654913

A Generalized Similarity Metric for Peptide Binding Affinity Prediction

Abstract

The ability to capture the relationship between similarity and functionality would enable the predictive design of peptide sequences for a wide range of implementations from developing new drugs to molecular scaffolds in tissue engineering and biomolecular building blocks in nanobiotechnology. Similarity matrices are widely used for detecting sequence homology but depend on the assumption that amino acid mutational frequencies reflected by each matrix are relevant to the system in which they are applied. Increasingly, neural networks and other statistical learning models solve problems related to functional prediction but avoid using known features to circumvent unconscious bias. We demonstrated an iterative alignment method that enhances predictive power of similarity matrices based on a similarity metric, the Total Similarity Score. A generalized method is provided for application to amino acid sequences from inorganic and organic systems by benchmarking it on the debut quartz-binder set and 3 peptide-protein sets from the Immune Epitope Database. Pearson and Spearman Rank Correlations show that by treating the gapless Total Similarity Score as a predictor of relative binding affinity, prediction of test data has a 0.5-0.7 Pearson and Spearman Rank correlation. with respect to size of the dataset. Since the benchmarks used herein are from a solid-binding peptide and a protein-peptide system, our proposed method could prove to be a highly effective general approach for establishing the predictive sequence-function relationships of among the peptides with different sequences and lengths in a wide range of biotechnology, nanomedicine and bioinformatics applications.\n\nAuthor SummaryThe significance of this work is to expand the applicability of a known metric for describing the function of tiny proteins also called peptides. The Total Similarity Score (TSS) can describe how similar a peptide, or a group of peptides are to another group of sequences with a known or suspected function. A peptide/group of peptides will always have a high TSS if it contains the same or similar amino acids in the same positions. This metric can therefore be used to select peptides for useful functions based purely on conserved amino acids in unknown positions. The greedy search algorithm used to learn how similar amino acids are to each other has been shown to be marginally effective in this larger dataset. Therefore, we argue that the TSS metric is a highly useful one for predicting peptide affinity but a different machine learning algorithm should be applied to make full use of it.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rodriguez, J. L., Rath, S. S., Francis-Landau, J. S., Demirci, Y., Ustundag, B. B., Sarikaya, M.. 2019-06-10. A Generalized Similarity Metric for Peptide Binding Affinity Prediction. https://doi.org/10.1101/654913

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related preprints

Contrastive Learning Improves Generalization on M2OR Olfactory Binding Dataset

Olfaction-based biosensors stand to have profound impacts in fields such as medical diagnostics, national security, and drug discovery. A promising mode of vapor phase biodetection mimics volatile organic compound-olfactory receptor (VOC-OR) interactions with target-specific protein or peptide probes; however, lack of experimental coverage remains a core bottleneck. Current computational approaches aim to improve prediction of VOC-OR binding to reduce experimental burden, and current machine learning approaches fail to demonstrate a level of generalization that addresses current engineering challenges. Here, using the Molecular to Olfactory Dataset (M2OR) and Insect Olfactory Binding Protein Database (iOBPdb) datasets, data partitioning methods and their performance are evaluated on a neural network and contrastive learning framework on such VOC-OR binding datasets, varying: model training, architecture, and structure of the input data distribution. It was found that holding out certain chemical or proteomic motifs from the training data diminished model performance with a two layer neural network model. The model was able to generalize to state of the art performance (0.88 AUCROC) on every data split by applying a contrastive learning objective defined by shared molecular constituents and a stochastic sampler. This suggests the contrastive objective provides a strong inductive bias for neural networks to predict novel VOC-OR pairs. These findings highlight that model performance on pairwise biological interaction datasets can be inflated through identity leakage from constituent overlap, and emphasize the need for more robust evaluation protocols. Furthermore, we show contrastive regularization mitigates dataset degeneracy through enforcement of compatibility in the models latent geometry that may extend to other binder target-datasets where identity leakage confounds evaluation.

bioinformatics↗

Plate design confounds donor variation and model evaluation in single-cell perturbation screens

Single-cell screens of immune cells from many donors are used to study why individuals respond differently and to benchmark response models. Each donor-perturbation combination typically occupies one well, controls are grouped, and donors share one layout, so technical effects can look biological. Using a 90-cytokine screen, two compound screens, four cohorts and simulations, we show that well effects explain most replicate-control variation in abundant cell types, controls carry a shared offset, and identical control wells differ by hundreds of differentially expressed genes at a standard threshold, about as many as two receptor-negative proteins do. Negative controls, design-aware estimators and perturbation-specific evaluation change the interpretation of four recent analyses. A deep-learning model that scores below a perturbation-agnostic predictor under standard evaluation outperforms a simple baseline on perturbation-specific differences in two of three cell types (significantly in one with stricter controls), but predicts less well the component shared with inert wells.

bioinformatics↗

LinearRaccess: linear-time approximation of RNA accessibility without base-pair span limits

Motivation: RNA accessibility is the probability that every nucleotide in a contiguous interval is simultaneously unpaired; it is widely used to predict binding sites for RNA-binding proteins and other RNA-RNA interactions, often in the form of the opening energy, an equivalent measure on a logarithmic scale. Existing tools restrict the maximum base-pair span, discarding long-range base pairs that matter biologically. Others sample structures, introducing statistical variance, or compute accessibility exactly without a span limit, at cubic time cost. No existing method computes the accessibility of windows longer than one nucleotide deterministically in linear time while preserving long-range base pairs. We present LinearRaccess, which computes accessibility directly in linear time via beam-pruned inside-outside dynamic programming with a difference-array aggregation step, without restricting base-pair span. Results: For a sequence of length N and a fixed beam width b, LinearRaccess runs in O(N) time and O(Nb) memory. Against exact accessibility on 12,872 bpRNA-1m(90) sequences of 100-1,000 nt, its median opening-energy error is below 0.001 kcal/mol (0.14 kcal/mol for 700-1,000 nt), and it distinguishes windows of very small accessibility, including 35-nt windows, below the resolution of sampling-based estimates. LinearRaccess analyzes the full 29,903-nt SARS-CoV-2 genome in 419 seconds. Conclusion: LinearRaccess is the first method to compute the accessibility of windows longer than one nucleotide deterministically (without sampling) in linear time without restricting base-pair span. Availability: https://github.com/TakumiOtagaki/LinearRaccess, archived at Zenodo (https://doi.org/10.5281/zenodo.23598502).

bioinformatics↗