Search bioRxiv⌕ Search

bioRxiv · 10.1101/2024.01.05.574326

Protein superfolds are characterised as frustration-free topologies: A case study of pure parallel beta-sheet topologies

Abstract

A protein superfold is a type of protein fold that is observed in at least three distinct, non-homologous protein families. Structural classification studies have revealed a limited number of prevalent superfolds alongside several infrequent occurring folds, and in /{beta} type superfolds, the C-terminal {beta}-strand tends to favor the edge of the {beta}-sheet, while the N-terminal {beta}-strand is often found in the middle. The reasons behind these observations, whether they are due to evolutionary sampling bias or physical interactions, remain unclear. This article offers a physics-based explanation for these observations, specifically for pure parallel {beta}-sheet topologies. Our investigation is grounded in three established structural rules that are based on physical interactions. We have identified "frustration-free topologies" which are topologies that can satisfy all three rules simultaneously. In contrast, topologies that cannot are termed "frustrated topologies." Our findings reveal that frustration-free topologies represent only a fraction of all theoretically possible patterns, these topologies strongly favor positioning the C-terminal {beta}-strand at the edge of the {beta}-sheet and the N-terminal {beta}-strand in the middle, and there is significant overlap between frustration-free topologies and superfolds. We also used a lattice protein model to thoroughly investigate sequence-structure relationships. Our results show that frustration-free structures are highly designable, while frustrated structures are poorly designable. These findings suggest that superfolds are highly designable due to their lack of frustration, and the preference for positioning C-terminal {beta}-strands at the edge of the {beta}-sheet is a direct result of frustration-free topologies. These insights not only enhance our understanding of sequence-structure relationships but also have significant implications for de novo protein design. Author summaryA protein superfold is a protein fold that appears in at least three different non-homologous protein families. Superfolds are unique in their ability to accommodate multiple functions within a single fold, a feature not typically seen in other folds. Studies in structural classification have led to two notable observations: the existence of a limited number of common superfolds contrasted with a larger variety of less frequent folds, and a recurring pattern in /{beta} type superfolds where the C-terminal {beta}-strand often occupies the edge of the {beta}-sheet, while the N-terminal {beta}-strand is usually found in the middle. The origins of these patterns, whether they stem from evolutionary sampling bias or physical interaction mechanisms, remain unclear. This article provides a physics-oriented explanation for these observations, specifically concentrating on pure parallel {beta}-sheet topologies. The insights gained from this research are crucial in enhancing our understanding of the relationship between protein sequences and structures, and are expected to contribute significantly to the de novo design of new proteins.

Source connections

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Murata, H., Toko, K., Chikenji, G.. 2024-01-05. Protein superfolds are characterised as frustration-free topologies: A case study of pure parallel beta-sheet topologies. https://doi.org/10.1101/2024.01.05.574326

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

KEEP EXPLORING

Related preprints

Targeted finetuning enables co-folding models to learn ligand-induced protein conformational states

Advances in protein structure prediction have enabled all-atom protein-ligand co-folding models that predict bound conformations directly from sequence and small-molecule structure. However, these models often fail to generalize to novel binding sites or alternative protein conformational states, limiting their utility for chemical biology and drug discovery. Here we show this limitation reflects training data bias rather than architectural constraints and can be overcome through targeted finetuning. Using ten previously unseen X-ray structures of Werner (WRN) helicase from a drug discovery program, we finetune Boltz-1 to learn both an allosteric binding site and a large conformational change locking the enzyme in an inactive state, while preserving accuracy on the ATP-bound state. The finetuned model generalizes to different chemical series and transfers the conformational logic across RecQ-family helicases in a binding-site sequence-dependent manner. This approach provides a blueprint for adapting foundation models as new structural and mechanistic data emerge, enabling co-folding networks to capture ligand-induced conformational switches and binding poses absent from their training data but central to biological regulation and therapeutic intervention.

bioinformatics↗

Benchmarking single-cell foundation models for aging biology

Single cell foundation models (scFMs) provide representations of cellular states, but their utility across biological questions in aging research remains unclear. We established a benchmark of cellular representations for aging research, evaluating ten general-purpose scFMs, three aging-specific models and conventional methods across five biological questions using more than 2.5 million single cell transcriptomes. Using frozen pretrained representations, Geneformer performed best among scFMs for chronological age prediction and age pseudotime concordance, although 2,000 highly variable genes achieved higher mean performance. Several scFMs captured positive molecular age shifts across three disease contexts, consistent with reported aging-associated changes. SCimilarity performed well for rare cellular state identification across out-of-distribution datasets, exceeding aging specific models and conventional baselines. At the gene level, scGPT showed the highest recovery of reference TF target interactions, including aging-related regulatory hubs. Overall, scFMs supported diverse aging analyses, but performance depended on the biological question, highlighting their utility for rare cellular state identification and regulatory analysis.

bioinformatics↗

CryoMV: Structure-Prior-Guided Modeling and Real-Particle Validation of Continuous Conformational Transitions in Cryo-EM

Continuous protein conformations are essential for understanding fundamental biological processes and supporting drug discovery. Although cryo-EM can resolve individual states at high resolution, recovering continuous heterogeneity from 2D particle images remains challenging. High noise, motion blur, and limited structural priors make it difficult to accurately generate and validate high-resolution continuous conformations using raw particle data. Here, we introduce cryoMV, a framework that integrates structure-prior-guided modeling with real-particle validation for continuous conformational transitions. CryoMV uses reference density maps to establish structural anchors and motion priors, models candidate transition paths between selected conformations, and transfers the learned representation to raw 2D cryo-EM particle images. Each candidate conformation is subsequently evaluated using the estimated particle poses and contrast transfer functions. Supported conformations are reconstructed through raw particle back-projection and assessed using canonical half-maps and Fourier shell correlation. On EMPIAR-10516 and EMPIAR-10345, cryoMV achieves excellent performance in terms of robustness, verifiability, and reconstruction resolution. By incorporating structure-prior modeling and evidence from the raw particles, cryoMV offers an explicit mechanism for assessing whether generated conformations are supported by experimental data and provides a practical approach to reducing model-induced artifacts in continuous cryo-EM heterogeneity analysis.

bioinformatics↗