protein
#RoboCup2026 – humanoid league day 2
The second day's play at RoboCup 2026 has drawn to a close with another bumper set of matches. Teams have come from far and wide to take part in the humanoid soccer competition this year, with 17 different countries represented. China is the most represented country, boasting 15 teams across the three divisions. Other countries taking part are geographically widespread, ranging from Colombia to Malaysia, from Germany to Australia. In advance of the competition, all applying teams provided a video, team description paper, and information about the robots and software that they use.
Scientists develop new method to generate protein datasets for training AI
Protein engineering is a field primed for artificial intelligence research. Each protein is made up of amino acids; to optimize a protein function, researchers modify proteins by switching out one of 20 different amino acids for another. For a protein that is just 50 amino acids in length, this leads to approximately 1.13 10 potential combinations to test. This number of potential combinations, impossible to test in the lab, makes protein engineering an ideal challenge for AI. Modeling which of these combinations will give the best results is a perfect problem for the technology's massive computing power.
What's coming up at #RoboCup2026?
This year, RoboCup will be held in Incheon, South Korea, from 2-6 July. The event will see teams take part in competitions, training sessions, and a symposium. It's an exciting time for RoboCup, as there have been some updates to the leagues and competition format . Most prominently, the soccer leagues will have a primary focus on humanoid robots. A workshop focused on sharing projects, experiences, and innovations in educational robotics.
AI model used to generate complete models of proteins in motion
Many drug and antibody discovery pathways focus on intricately folded cell membrane proteins. When molecules of a drug candidate bind to these proteins, like a key going into a lock, they trigger chemical cascades that alter cellular behavior. Understanding how proteins fold and move is therefore essential for developing drugs that interact well with their targets. Artificial intelligence (AI) is a very useful tool to generate novel protein structures, but most systems - including Google DeepMind's AlphaFold - focus on producing static'snapshots' of proteins. Subtle rearrangements of atoms in structures called side chains, which influence a protein's interactions with other molecules, are not captured.
DualMPNN: Harnessing Structural Alignments for High-Recovery Inverse Protein Folding
Inverse protein folding addresses the challenge of designing amino acid sequences that fold into a predetermined tertiary structure, bridging geometric and evolutionary constraints to advance protein engineering. Inspired by the pivotal role of multiple sequence alignments (MSAs) in structure prediction models like AlphaFold, we hypothesize that structural alignments can provide an informative prior for inverse folding. In this study, we introduce DualMPNN, a dual-stream message passing neural network that leverages structurally homologous templates to guide amino acid sequence design of predefined query structures. DualMPNN processes the query and template proteins via two interactive branches, coupled through alignment-aware cross-stream attention mechanisms that enable exchange of geometric and co-evolutionary signals. Comprehensive evaluations across on CATH 4.2, TS50 and T500 benchmarks demonstrate DualMPNN achieves state-ofthe-art recovery rates of 65.51%, 70.99%, and 70.37%, significantly outperforming base model ProteinMPNN by 15.64%, 16.56%, 12.29%, respectively. Further template quality analysis and structural foldability assessment underscore the value of structural alignment priors for protein design.
Protein Inverse Folding From Structure Feedback
The inverse folding problem, aiming to design amino acid sequences that fold into desired three-dimensional structures, is pivotal for various biotechnological applications. Here, we introduce a novel approach leveraging Direct Preference Optimization (DPO) to fine-tune an inverse folding model using feedback from a protein folding model. Given a target protein structure, we begin by sampling candidate sequences from the inverse-folding model, then predict the three-dimensional structure of each sequence with the folding model to generate pairwise structuralpreference labels. These labels are used to fine-tune the inverse-folding model under the DPO objective. Our results on the CATH 4.2 test set demonstrate that DPO fine-tuning not only improves sequence recovery of baseline models but also leads to a significant improvement in average TM-Score from 0.77 to 0.81, indicating enhanced structure similarity. Furthermore, iterative application of our DPO-based method on challenging protein structures yields substantial gains, with an average TM-Score increase of 79.5% with regard to the baseline model. This work establishes a promising direction for enhancing protein sequence design ability from structure feedback by effectively utilizing preference optimization .
Towards Multiscale Graph-based Protein Learning with Geometric Secondary Structural Motifs
Graph neural networks (GNNs) have emerged as powerful tools for learning protein structures by capturing spatial relationships at the residue level. However, existing GNN-based methods often face challenges in learning multiscale representations and modeling long-range dependencies efficiently. In this work, we propose an efficient multiscale graph-based learning framework tailored to proteins. Our proposed framework contains two crucial components: (1) It constructs a hierarchical graph representation comprising a collection of fine-grained subgraphs, each corresponding to a secondary structure motif (e.g., α-helices, β-strands, loops), and a single coarse-grained graph that connects these motifs based on their spatial arrangement and relative orientation.
Unlocking hidden biomolecular conformational landscapes in diffusion models at inference time
The function of biomolecules such as proteins depends on their ability to interconvert between a wide range of structures or "conformations." Researchers have endeavored for decades to develop computational methods to predict the distribution of conformations, which is far harder to determine experimentally than a static folded structure. We present ConforMix, an inference-time algorithm that enhances sampling of conformational distributions using a combination of classifier guidance, filtering, and free energy estimation. Our approach upgrades diffusion models--whether trained for static structure prediction or conformational generation--to enable more efficient discovery of conformational variability without requiring prior knowledge of major degrees of freedom. ConforMix is orthogonal to improvements in model pretraining and would benefit even a hypothetical model that perfectly reproduced the Boltzmann distribution. Remarkably, when applied to a diffusion model trained for static structure prediction, ConforMix captures structural changes including domain motion, cryptic pocket flexibility, and transporter cycling, while avoiding unphysical states. Case studies of biologically critical proteins demonstrate the scalability, accuracy, and utility of this method.
Venus-MAXWELL: Efficient Learning of Protein-Mutation Stability Landscapes using Protein Language Models
In-silico prediction of protein mutant stability, measured by the difference in Gibbs free energy change ( G), is fundamental for protein engineering. Current sequence-to-label methods typically employ the two-stage pipeline: (i) encoding mutant sequences using neural networks (e.g., transformers), followed by (ii) the G regression from the latent representations. Although these methods have demonstrated promising performance, their dependence on specialized neural network encoders significantly increases the complexity. Additionally, the requirement to individually compute latent representations for each mutant site negatively impacts computational efficiency and poses the risk of overfitting. This work proposes the Venus-MAXWELL framework, which reformulates mutation G prediction as a sequence-to-landscape task. In Venus-MAXWELL, mutations of a protein and their corresponding Gvalues are organized into a landscape matrix, allowing our framework to learn the G landscape of a protein with a single forward and backward pass during training. Besides, to facilitate future works, we also curated a large-scale G dataset with strict controls on data leakage and redundancy to ensure robust evaluation. Venus-MAXWELL is compatible with multiple protein language models and enables these models for accurate and efficient G prediction. For example, when integrated with the ESM-IF, Venus-MAXWELL achieves higher accuracy than ThermoMPNN with 10 faster in inference speed (despite having 50 more parameters than ThermoMPNN).
Engineering Out Loud: S13E1 – How many robots can a single human supervise?
Engineering Out Loud: S13E1 - How many robots can a single human supervise? Will swarms of autonomous aerial vehicles be able to aid humans in wildland firefighting or package delivery? Research summarized in a new paper in Field Robotics represents a big step towards realizing such a future. In this interview, Professor Julie A Adams describes the research showing that one person can supervise more than 100 autonomous ground and aerial robots. "Engineering Out Loud" is a podcast from the College of Engineering at Oregon State University.