Biology subjects

Steinegger, M.

Publications and source records attributed to Steinegger, M..

At least 19 recordsLinked to original sources

bioRxiv2026

Systematic exploration of predicted quaternary structures within pandemic-relevant viral proteomes

Mechanistic understanding of viral protein-protein interactions enables global health security and pandemic preparedness, yet experimental characterisation remains difficult, costly, and often restricted to specialised laboratories. Here, we describe an in silico campaign using AlphaFold2 and AlphaFold-Multimer to predict monomers and dimer structures within 2,812 viral proteomes from 23 viral families relevant to human health. We report high-confidence predicted structures of 5,279 hetero-, and 2,749 homo-dimers. Structural clustering of interfaces reduces the set fivefold to 1,598 consolidated by form and function, of which 471 (29.5%) lacked detectable similarity to experimentally determined interfaces in the PDB. These clusters yielded two notable findings: new data on vaccinology-relevant glycoproteins, and accurate prediction of the specificity and cleavage-site recognition of viral proteases, which are targets for anti-viral development. Viral monomers and high-confidence dimers are available for interactive browsing in the Pandemic Preparedness Portal of the AlphaFold Database (https://alphafold.ebi.ac.uk/), and the full dataset is available for bulk download.

bioinformatics↗

bioRxiv2026

Latent generative search unlocks de novo design of untapped biomolecular interactions at scale

De novo protein design has advanced rapidly, yet designing binders to polar, solvent-exposed epitopes and small, flexible ligands remains challenging. Such hydrated surfaces and flexible molecules, including carbohydrates, provide few of the hydrophobic contacts favoured by current methods and have largely resisted de novo binders. To address this challenge, here we introduce latent generative search for binder design, a novel framework that uses reward-guided search at inference time to steer the Proteina-Complexa generative model. The model codesigns sequence and structure - generating them together in a continuous latent space - and thereby removes the inverse-folding step on which current methods rely. In a screen of more than one million designs by multiplexed phage display, latent generative search produced more validated binders than every other method tested, its codesigned sequences surpassing post hoc redesign. It delivered high-affinity binders across therapeutic receptors, a viral attachment protein and intracellular signalling targets. Our approach also accessed previously untapped biology, generating the first de novo proteins that bind a free carbohydrate, including one that discriminates between blood-group antigens - a polar, flexible target class beyond the reach of current design methods.

bioengineering↗

bioRxiv2026

BFVD v3-UniProt-complete, improved viral protein structure predictions

The Big Fantastic Virus Database (BFVD) v3 is the most comprehensive resource for ColabFold-AlphaFold2-predicted viral protein structures. It holds 5,776,417 structures of nearly all viral sequences in UniProt 2025_03, a 16.4-fold increase compared to the representative-only catalogs of BFVD v1 and v2. Structure prediction quality has also improved, with high-confidence predictions accounting for 75.3% of BFVD v3 entries. This is due to Logan's enormous sequence assembly, now mined for the entire BFVD v3 instead of only for shallow alignments, alongside continued prediction quality improvements. BFVD v3 covers 72.7% of ICTV's virus species, 1.54-fold more than BFVD v2. With this version, the fraction of fully covered viral reference proteomes increases from 1.5% to 72.6%. BFVD v3 thus brings us closer to a structural catalog of the known virosphere and is freely available at bfvd.steineggerlab.workers.dev and bfvd.foldseek.com.

bioinformatics↗

bioRxiv2026

Foldseek-Interface reveals a protein interface universe far from complete

Protein-protein interactions mediate a vast range of cellular functions, requiring diverse modes of binding. While recent years have seen major efforts to chart and classify the protein structure universe, we lack comparable methods to assess and cluster that diversity in interface structure at interactome scale. Here, we present Foldseek-Interface, a method that converts 3D interface structures into searchable sequences to enable fast alignment and clustering of protein interaction interfaces. It matches the accuracy of state-of-the-art tools while running up to 230 times faster. Applying it to all biological assemblies in the PDB, we cluster 3.1 million dimers into 77{,}167 interface clusters and use this resource to characterise interface diversity, evolution, and pathogen mimicry. Application of Foldseek-Interface to resources of predicted protein complex structures rapidly revealed putatively novel interface types worth further experimental interrogation. Foldseek-Interface and the interface cluster resource are freely available as webservers for search https://search.foldseek.com/interface and exploration https://interface.foldseek.com.

bioinformatics↗

bioRxiv2026

Fast remote nucleotide sequence alignment with Riboseek

Structure prediction has reached RNA, where generating deep alignments is now the bottleneck. We developed Riboseek, a search and alignment tool for RNA and DNA that represents sequences as overlapping di-mers. Riboseek is more sensitive for homology detection than BLASTN and nhmmer, and generates alignments 250- and 376-fold faster than nhmmer and rMSA. With structure-aware realignment, it approaches rMSAs base-pair recovery, while remaining 29-fold faster. We provide a web server and 1.7 million precomputed alignments for putatively structured RNAs. Riboseek is freely available at https://github.com/steineggerlab/riboseek.

bioinformatics↗

bioRxiv2026

First community challenge for automated virus taxonomy

The rapid rate of virus discovery renders manual curation by taxonomy experts increasingly impractical, creating a need for reliable software that can reproducibly assign viral contigs to taxa at all fifteen ranks of the virus taxonomy. We led an open community challenge for the computational taxonomic classification of viruses and assembled a dataset of virus sequences combining expert-curated and metagenomic sequences. Seventeen teams contributed a total of thirty-four automated, fully reproducible classification pipelines. Most tools correctly assigned viruses belonging to established species, genera, or families, but viruses that are unclassified at those lower ranks remain challenging. This study provides datasets, open-source software, novel approaches, and recommendations to benchmark computational taxonomic classification of viruses, and support organizing the many viruses discovered in big omics data.

microbiology↗

bioRxiv2026

A novel method to select Reference Proteomes in UniProt

MotivationThe ongoing revolution in genome sequencing is delivering an unprecedented number of genome assemblies to global repositories, resulting in an overwhelming amount of data imported to UniProt in the form of proteomes. To manage this growth sustainably, there is a need for a systematic workflow to select the best proteomes. ResultsWe propose a novel pipeline for cellular organisms to select the best Reference Proteomes, i.e. those that best represent the protein space of a species. The pipeline uses a clustering algorithm based on MMseqs2 to select the minimum number of Reference Proteomes whilst maximising the representation of the protein space for each species. Additionally, we aligned our viral Reference Proteomes with the exemplar genome set defined by the International Committee on Taxonomy of Viruses. Because this method ensures that all species are represented with at least one Reference Proteome, the UniProt Knowledgebase increased the number of Reference Proteomes of 36% and covering 34% more species in the Tree of Life. The UniProt Knowledgebase will mainly retain proteins from Reference Proteomes and therefore this method reduces the overall number of proteins by 43%, leading to a more concise yet representative knowledgebase. Availability and Implementationhttps://www.uniprot.org/proteomes Contactraposo@ebi.ac.uk Supplementary informationSupplementary data are available at Bioinformatics online.

bioinformatics↗

bioRxiv2026

AlphaFold Database expands to proteome-scale quaternary structures

Protein function is governed by molecular interactions, yet structural coverage of these interactions remains sparse. The AlphaFold Protein Structure Database (AFDB) transformed access to accurate monomeric protein structures at scale. Here, we expand the AFDB to quaternary structures by predicting 31M candidate homo- and heterodimeric protein complexes, compiled from 4,777 proteomes, including model- and global health organisms. We established confidence criteria via analysis of experimentally determined structures, resulting in 1.81M high-confidence predictions. These models enabled the discovery of emergent structures and topologies not present in monomeric predictions. Additionally, the top 1% of structural clusters accounted for [~]44% of all complexes, and [~]8.3% of clusters were conserved across multiple domains of life, pointing to a substantial fraction of ancient, universally retained assemblies. Structural search highlighted that high-confidence predictions are anchored in experimental multimer space, yet 31.3% extend beyond detectable PDB coverage. These freely accessible proteome-scale predictions facilitate functional and mechanistic hypothesis generation across biology.

synthetic biology↗

bioRxiv2026

evedesign: accessible biosequence design with a unified framework

Machine learning methods for protein engineering are rarely interoperable, require bespoke workflows, and remain inaccessible to non-experts. Yet the design problems that matter most - conditional design subject to real-world constraints, multi-objective optimization, and iterative lab-in-the-loop workflows where experimental data continuously refines successive design rounds - demand exactly the kind of flexible, composable infrastructure that no single tool provides. We present evedesign, a unified open-source framework that formalizes conditional biosequence design in a method-agnostic way, enabling complex multiobjective workflows combining supervised and unsupervised models from standardized specifications, and built from the outset to support iterative experimental integration. An interactive web interface facilitates end-to-end design for a broad scientific audience at https://evedesign.bio. We demonstrate evedesigns utility in antibody engineering, enzyme design, and natural enzyme discovery, and invite open-source community contributions.

bioinformatics↗

bioRxiv2026

StrucTTY: An Interactive, Terminal-Native Protein Structure Viewer

Terminal-based workflows are central to large-scale structural biology, particularly in high-performance computing (HPC) environments and SSH sessions. Yet no existing tool enables real-time, interactive visualization of protein backbone structures directly within a text-only terminal. To address this gap, we present StrucTTY, a fully interactive, terminal-native protein structure viewer. StrucTTY is a single self-contained executable that loads mulitple PDB and mmCIF files, normalizes three-dimensional coordinates, and renders protein structures as ASCII graphics. Users can rotate, translate, and zoom in on structures, adjust visualization modes, inspect chain-level features and view secondary structure assignments. The tool supports simultaneous visualization of up to nine protein structures and can directly display structural alignments using Foldseeks output, enabling rapid comparative analysis in headless environments. The source code is available at https://github.com/steineggerlab/StrucTTY. O_TEXTBOXKey MessagesO_LIReal-time, interactive protein structure visualization directly within text-only terminals C_LIO_LIASCII-based, depth-aware rendering of PDB and mmCIF backbone structures C_LIO_LIMulti-structure comparison with direct application of Foldseek alignment transformations C_LIO_LIDesigned for headless workflows on remote servers and HPC systems C_LI C_TEXTBOX

bioinformatics↗

bioRxiv2026

Sensitive and scalable metagenomic classification using spaced metamers, reduced alphabets, and syncmers

Accurate taxonomic classification of metagenomic sequencing data is essential for identifying the diverse organisms present in environmental and clinical samples. To address this, we previously developed Metabuli, an alignment-free classifier that bridges the gap between nucleotide-level resolution and protein-level sensitivity. Central to this approach is the metamer, a novel joint DNA and amino acid k-mer concept introduced by Metabuli to classify taxa across varying levels of database representation. In this study, we significantly optimized its core metamer search by incorporating advanced techniques. By introducing spaced metamers and reduced amino acid alphabets to boost sensitivity, we improved both precision and recall by 4.7 and 2.8 percentage points in a species exclusion test. Furthermore, integrating syncmers with spaced metamers halved the reference database size and doubled the classification speed; despite a slight decrease in recall, this configuration continued to outperform state-of-the-art alignment-free tools. Contactjbeom@snu.ac.kr and martin.steinegger@snu.ac.kr

bioinformatics↗

bioRxiv2026

Efficient protein structure prediction fromcompact computers to datacenters withOpenFold-TRT

We introduce accelerations for deep learning inference with OpenFold and TensorRT that, combined with MMseqs2-GPU on an x86 system with one NVIDIA RTX PRO 6000 Blackwell Server Edition GPU, reach up to 131x faster inference compared to AlphaFold2. ARM-optimizations enable homology search on power efficient DGX Spark, and allow search beyond available GPU RAM on NVIDIA Grace Hopper Superchip at comparable overall folding speed. These accelerations enable high-throughput protein structure inference at no accuracy cost using familiar tools.

bioinformatics↗

bioRxiv2026

Protein Language Modeling beyond static folds reveals sequence-encoded flexibility

MotivationProteins function through motion. Yet, most discoveries still commence with static representations of protein structures. Here, we investigated the feasibility of leveraging protein dynamics to improve homology detection. ResultsWe introduce ProtProfileMD, a sequence-to-3D-probability model that predicts, from an amino acid sequence, a profile of discrete structural representations capturing protein dynamics. We applied supervised parameter-efficient finetuning of the ProstT5 protein Language Model (pLM) to predict per-residue distributions over Foldseeks 3Di alphabet derived from motions observed in molecular dynamics. This original result reveals that the 3Di tokens, despite being coarse-grained descriptors of 3D structure, still offer sufficient resolution to capture aspects of conformational changes. This is evidenced by a correlation between fluctuations in the 3D protein structure over the course of a molecular dynamics trajectory and the entropy of 3Di states. Based on this insight, we introduce a proof-of-concept for making remote homology detection of proteins more sensitive by leveraging a proteins distinctive dynamic fingerprint captured by our model. Our method recovers flexibility signals with a fidelity that is biologically relevant, improving search and complementing protein structure predictions, for example, by flagging flexible, disordered, or other functionally relevant regions. Availability and ImplementationProtProfileMD is available at github.com/finnlueth/ProtProfileMD. The associated training data and model weights are available at huggingface.co/datasets/finnlueth/ProtProfileMD and huggingface.co/finnlueth/ProtProfileMD.

bioinformatics↗

bioRxiv2025

Accelign: a GPU-based Library for Accelerating Pairwise Sequence Alignment

BackgroundThe continually increasing volume of sequence data results in a growing demand for fast implementations of core algorithms. Computation of pairwise alignments based on dynamic programming is an important part in many bioinformatics pipelines and a major contributor to overall runtime due to the associated quadratic time complexity. This motivates the need for a library of efficient implementations on modern GPUs for a variety of alignment algorithms for different types of sequence data including DNA, RNA, and proteins. ResultsAccelign is a library of accelerated pairwise sequence alignment algorithms for CUDA-enabled GPUs. Its parallelization strategy is based on a common wavefront design that can be adapted to support a variety of dynamic programming algorithms: local, global, and semi-global alignment of genomic and protein sequences with a variety of commonly used scoring schemes supporting one-to-one, one-to-many or all-to-all pairwise sequence alignments. This leads to a peak performance between 16.1 TCUPS and 9.1 TCUPS for computing optimal global alignment scores with linear gaps and affine gap penalties on a single RTX PRO 6000 Blackwell GPU, respectively. In addition, our library demonstrates significant speedups in several real-world case studies over prior CPU-based (SeqAn, Parasail, BSalign) and GPU-based libraries (ADEPT, GASAL2), and can even outperform highly customized algorithms (WFA-GPU, CUDASW++4.0). Furthermore, the performance of our approach scales linearly with the number of employed GPUs, which makes it feasible to exploit multi-GPU nodes for increased processing speeds. ConclusionAccelign provides significant speedups for commonly used pairwise alignment algorithms compared to prior implementations. It is freely available at https://github.com/fkallen/Accelign.

bioinformatics↗

bioRxiv2025

Rewriting protein alphabets with language models

Detecting remote homology with speed and sensitivity is crucial for tasks like function annotation and structure prediction. We introduce a novel approach using contrastive learning to convert protein language model embeddings into a new 20-letter alphabet, TEA, enabling highly efficient large-scale protein homology searches. Searching with our alphabet performs on par with and complements structure-based methods without requiring any structural information, and with the speed of sequence search. Ultimately, we bring the exciting advances in protein language model representation learning to the plethora of sequence bioinformatics algorithms developed over the past half-century, offering a powerful new tool for biological discovery.

bioinformatics↗

bioRxiv2025

LoL-align: sensitive and fast probabilistic protein structure alignment

The ubiquitous availability of protein structures permits replacing sequence alignment with more accurate and sensitive structure alignment algorithms. LoL-align maximizes a local log-odds score for proteins to be homologous, given their intra-protein C - C distances. LoL-align is markedly more sensitive in detecting remote homologs than TMalign and DALI on single- and multi-domain benchmarks and achieves better alignment quality at 5-20x their speed. LoL-align is fully integrated into Foldseek.

bioinformatics↗

bioRxiv2025

Protein Structure Informed Bacteriophage Genome Annotation with Phold

Bacteriophage (phage) genome annotation is essential for understanding their functional potential and suitability for use as therapeutic agents. Here we introduce Phold, an annotation framework utilising protein structural information that combines the ProstT5 protein language model and structural alignment tool Foldseek. Phold assigns annotations using a database of over 1.36 million predicted phage protein structures with high quality functional labels. Benchmarking reveals that Phold outperforms existing sequence-based homology approaches in functional annotation sensitivity whilst maintaining speed, consistency and scalability. Applying Phold to diverse cultured and metagenomic phage genomes shows it consistently annotates over 50% of genes on an average phage and 40% on an average archaeal virus. Comparisons of phage protein structures to other protein structures across the tree of life reveals that phage proteins commonly have structural homology to proteins shared across the tree of life, particularly those that have nucleic acid metabolism and enzymatic functions. Phold is available as free and open-source software at https://github.com/gbouras13/phold.

bioinformatics↗

bioRxiv2025

Scaling down protein language modeling with MSA Pairformer

Recent efforts in protein language modeling have focused on scaling single-sequence models and their training data, requiring vast compute resources that limit accessibility. Although models that use multiple sequence alignments (MSA), such as MSA Transformer, offer parameter-efficient alternatives by extracting evolutionary information directly from homologous sequences rather than storing it in parameters, they generally underperform compared to single-sequence-based language due to memory inefficiencies that limit the number of sequences and averaging evolutionary signals across the MSA. We address these challenges with MSA Pairformer, a 111M parameter memory-efficient MSA-based protein language model that extracts evolutionary signals most relevant to a query sequence through bi-directional updates of sequence and pairwise representations. MSA Pairformer achieves state-of-the-art performance in unsupervised contact prediction, outperforming ESM2-15B by 6% points while using two orders of magnitude fewer parameters. In predicting contacts at protein-protein interfaces, MSA Pair-former substantially outperforms all methods with a 24% point increase over MSA Transformer. Unlike single-sequence models that deteriorate in variant effect prediction as they scale, MSA Pairformer maintains strong performance in both tasks. Ablation studies reveal triangle operations remove indirect correlations, and unlike MSA Transformer, MSA Pairformer does not hallucinate contacts after removing covariance, enabling reliable screening of interacting sequence pairs. Overall, our work presents an alternative to the current scaling paradigm in protein language modeling, enabling efficient adaptation to rapidly expanding sequence databases and opening new directions for biological discovery.

biophysics↗