bioRxiv Science⌕ Search

bioRxiv · 10.1101/2022.11.21.517400

Predicting and Interpreting Protein Developability via Transfer of Convolutional Sequence Representation

Abstract

Engineered proteins have emerged as novel diagnostics, therapeutics, and catalysts. Often, poor protein developability - quantified by expression, solubility, and stability - hinders utility. The ability to predict protein developability from amino acid sequence would reduce the experimental burden when selecting candidates. Recent advances in screening technologies enabled a high-throughput developability dataset for 105 of 1020 possible variants of protein ligand scaffold Gp2. In this work, we evaluate the ability of neural networks to learn a developability representation from a high-throughput dataset and transfer this knowledge to predict recombinant expression beyond observed sequences. The model convolves learned amino acid properties to predict expression levels 44% closer to the experimental variance compared to a non-embedded control. Analysis of learned amino acid embeddings highlights the uniqueness of cysteine, the importance of hydrophobicity and charge, and the unimportance of aromaticity, when aiming to improve the developability of small proteins. We identify clusters of similar sequences with increased developability through nonlinear dimensionality reduction and we explore the inferred developability landscape via nested sampling. The analysis enables the first direct visualization of the fitness landscape and highlights the existence of evolutionary bottlenecks in sequence space giving rise to competing subpopulations of sequences with different developability. The work advances applied protein engineering efforts by predicting and interpreting protein scaffold developability from a limited dataset. Furthermore, our statistical mechanical treatment of the problem advances foundational efforts to characterize the structure of the protein fitness landscape and the amino acid characteristics that influence protein developability. Significance statementProtein developability prediction and understanding constitutes a critical limiting step in biologic discovery and engineering due to limited experimental throughput. We demonstrate the ability of a machine learning model to learn sequence-developability relationships first through the use of high-throughput assay data, followed by the transfer of the learned developability representation to predict the true metric of interest, recombinant yield in bacterial production. Model performance is 44% better than a model not pre-trained using the high-throughput assays. Analysis of model behavior reveals the importance of cysteine, charge, and hydrophobicity to developability, as well as of an evolutionary bottleneck that greatly limited sequence diversity above 1.3 mg/L yield. Experimental characterization of model predicted candidates confirms the benefit of this transfer learning and in-silico evolution approach.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Golinski, A. W., Schmitz, Z. D., Nielson, G. H., Johnson, B., Saha, D., Appiah, S., Hackel, B. J., Martiniani, S.. 2022-11-25. Predicting and Interpreting Protein Developability via Transfer of Convolutional Sequence Representation. https://doi.org/10.1101/2022.11.21.517400

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

KEEP EXPLORING

Related preprints

CellChat Hotspot: A Targeted Approach to Cell Cell Communication Analysis With Spatial transcriptomics Validation.

Abstract. In recent years, single cell RNA sequencing (scRNA seq) has enabled the investigation of intercellular communication through Cell Cell Communication (CCC) tools such as CellChat. Despite their potential, these approaches remain challenging to interpret, particularly when global analyses generate complex interaction networks that may include biologically irrelevant signals. To address this limitation, we developed a framework termed CellChat Hotspot, designed to improve the biological interpretability of inferred communication networks. This approach integrates gene set enrichment analysis with a context driven filtering strategy, selecting both genes and cells based on their functional relevance prior to communication inference. Applied to stage II colon cancer data, CellChat Hotspot enabled the identification of condition-specific interaction patterns associated with recurrence. Non recurrent patients showed enrichment of immune related processes, whereas recurrent cases were characterized by pathways associated with invasion and metastasis. Notably, a loss of interaction in the HSPG pathway between CALB1+ and stromal cells was observed in recurrent patients, suggesting a potential disruption of cell matrix adhesion mechanisms. To verify the reliability of this finding, we applied the framework to spatial transcriptomics data, which confirmed the presence of the HSPG2 DAG1 interaction in non-recurrent tumors and its near absence in recurrent ones. Overall, this framework provides a biologically guided strategy for studying intercellular communication in complex systems such as the tumor microenvironment.

bioinformatics↗

SIFT: Syncmer-Informed Selection of Haplotypes for T2T Imputation

Genome patching improves the completeness of fragmented assemblies by filling unresolved gaps with sequences from reference genomes. Pangenome panels provide diverse candidate haplotypes for this task, but identifying suitable references efficiently becomes increasingly challenging as these panels grow. We present SIFT, a compressed indexing method for selecting reference haplotypes for genome patching with ImpuT2T. SIFT combines closed-syncmer parsing, phrase-level indexing, and pseudo-maximal exact match (pseudo-MEM) queries. Closed syncmers provide a context-independent parsing rule with bounded distances between consecutive selected positions, enabling consistent parsing of reference and query sequences. We demonstrate that two closed syncmers determine the distance at which they can occur consecutively in any string, so that equal substrings of two parses represent identical sequences and no gap sequence need be stored. SIFT indexes the reference parse and its reverse using run-length compressed suffix arrays and adapts the Boyer-Moore-Li search procedure to identify pseudo-MEMs between the reference parse and query parse. It then aggregates matching evidence to identify candidate reference haplotypes for downstream patching. This framework connects compressed sequence indexing with haplotype selection and provides a basis for querying large reference panels at the phrase level. SIFT is publicly available under the GNU license at https://github.com/EddieFerro/SIFT.

bioinformatics↗

Assessing the Capacity of Genomic Language Models to Generate Informative Embeddings of Viral Genome Fragments

Genomic language models (gLMs) trained on large volumes of nucleotide sequences are becoming an alternative to classical methods in metagenomic analysis, particularly for studying genomic "dark matter". In this work, we investigate the ability of four gLMs (DNABERT-2, DNABERT-S, ViraLM, and Evo2-7B) to generate taxonomically informative vector representations of short viral genome fragments. We constructed a balanced reference dataset of viruses based on the ICTV Virus Metadata Resource and compared the representations generated by gLMs with conventional k-mer profiles and MinHash sketches using clustering and neighborhood-based metrics (adjusted Rand index (ARI), precision@k, and CROSS precision@k). On the reference dataset, three of the four gLMs outperformed the 4-mer profile in terms of ARI and precision@5 under the same evaluation protocol. The best performance was generally achieved by intermediate model layers. Conventional k-mer profiles consistently outperformed MinHash sketches. We further evaluated the methods on two viral orders (egoviruses and mriyaviruses) absent from the reference dataset, with model layers and k-mer lengths selected exclusively on the reference dataset. DNABERT-S showed the most consistently strong performance across these two orders, ranking first on mriyaviruses and second on egoviruses, while k-mer profiles with Jensen-Shannon distance remained competitive. We also observed the consistency of representations between forward fragments and their reverse complements. Overall, the best-performing gLMs surpassed conventional baselines, although their advantage depended on the dataset and evaluation metric. The consistently strong performance of DNABERT-S suggests a potential benefit of contrastive fine-tuning and indicates that larger models are not necessarily more effective for generating taxonomically informative representations.

bioinformatics↗