Papers for

biotech product developers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Graph based method improves identification of transcription factors

GraphTFactor: A graph-based approach for proteins transcription factor prediction

Abstract: Transcription factors (TFs) play an important role in regulating gene expression, making their identification a fundamental task in computational biology. In this work, we propose GraphTFactor, a novel end-to-end framework that models protein sequences as graphs and directly classifies transcription factors. By encoding sequences into graph structures, the proposed approach naturally handles variable-length inputs while preserving relevant relational information, without imposing length constraints. Experimental results show that GraphTFactor outperforms state-of-the-art methods on benchmark datasets, demonstrating the effectiveness of graph-based representations for TF prediction while providing interpretable insights into the sequence regions contributing to the model's predictions. To support reproducibility and practical adoption, we release an open-source software package and an interactive web application that let users easily perform TF prediction on custom sequences.

Thu 29 OctArtificial IntelligenceMachine Learning
The gist
Identifying transcription factors is important because they help control which genes turn on or off. The authors developed GraphTFactor, a tool that turns protein sequences into graphs to better recognize transcription factors. Unlike other methods, this approach works well with sequences of different lengths and keeps the connections between parts of the protein. Tests show it performs better than current tools and also helps explain which parts of the protein influence its predictions. They also provide software and a website so users can try this method on their own protein data.
Open → 2610.40867v1

HistoLoop improves gene activity maps from tissue images using iterative context

HistoLoop: Iterative Contextual Inference with a Looped Transformer for Histology-Based Spatial Gene Expression Prediction

Abstract: Predicting spatial gene expression from H&E images offers a scalable complement to experimental spatial transcriptomics. However, despite progress in spatial context modeling, how to construct subsequent context from spot states updated by earlier contextual interactions remains underexplored. We introduce HistoLoop, a looped Transformer that formulates prediction as iterative contextual inference. At each refinement step, HistoLoop aggregates the current spot states into context tokens at the corresponding resolution, processes them with a shared spatial Transformer, and retrieves spot-specific contextual information through cross-attention. A memory-mediated update integrates this information into persistent spot states, which are then used to construct context at the next, finer resolution. Under the HEST-Bench HVG50 evaluation protocol, HistoLoop achieves the highest macro-averaged gene-wise Pearson correlation among the compared methods across six cancer-specific tasks spanning five organs in HEST-1K. Ablation studies support the importance of recurrent state refinement and reconstructing context from updated spot states at progressively finer resolutions. Expression-derived clustering further suggests that HistoLoop better captures spatially organized multigene patterns.

Tue 20 OctComputer Vision and Pattern Recognition
The gist
Figuring out where genes are active in tissue samples helps scientists understand diseases like cancer. The authors created HistoLoop, a computer method that looks at microscope images of tissues and repeatedly improves its guesses about gene activity by considering neighboring spots. This step-by-step approach lets HistoLoop understand complex gene patterns better than previous methods. Their tests show it works well across different cancers and organs.
Open → 2610.28339v1

Bacterial growth conditions predicted from 16S rRNA sequences

Recommending Bacterial Cultivation Conditions from 16S rRNA

Abstract: Recommending bacterial cultivation conditions from sequence data is a challenging structured problem characterized by missing standardized benchmarks and limited use of sequence structure. To address this, we introduce DSNI, a benchmark of 65,023 bacterial strains with phylogeny-aware splits, pairing 16S rRNA sequences with four cultivation conditions (media, temperature, pH, oxygen). Exploiting the mosaic structure of 16S rRNA, where hypervariable regions support discrimination and conserved regions support primer design, we propose a Variability-Gated Encoder that learns position-dependent importance weights conditioned on biological features (region type, position, and local complexity). The gating module adds minimal overhead (1,280 parameters, <1%) while providing an explicit inductive bias valuable in low-data regimes. Experiments demonstrate that the learnable gate improves flat Transformers by 4.7% in joint accuracy and complements RNABERT, yielding 44.2% exact-match joint accuracy. The model also recovers 90.2% of ground-truth cultivation protocols within its top-25 recommendations, narrowing the exhaustive search space by approximately 60 times.

Tue 20 OctMachine Learning
The gist
Predicting the best way to grow bacteria from their genetic code is hard. The authors created a big dataset linking bacterial genetic sequences to growth conditions like temperature and oxygen levels. They designed a new method that pays attention to different parts of the genetic sequence, improving prediction accuracy especially when little data is available. Their approach helps narrow down which growth conditions to try by a large factor, making experiments more efficient.
Open → 2610.28310v1

Peptide structure models improve by combining multiple shapes for predictions

Ensemble-Aware Structural Encoding (EASE): Conditioning Protein Encoders on Peptide Conformational Ensembles

Abstract: Protein foundation models provide transferable representations for downstream peptide prediction tasks. However, existing representations typically reduce a peptide to a single sequence or structure, which may miss conformational variability relevant to key peptide properties, including antibacterial activity, hemolysis, toxicity, stability, and binding. For example, protease resistance correlates more strongly with conformational dynamics measured by hydrogen exchange than with average helicity. Therefore, we introduce Ensemble-Aware Structural Encoding (EASE), a framework for effectively extracting structural information from conformational ensembles for peptide representation. To extract useful information from noisy conformers, EASE selects central conformers representing a peptide's major structural states and fuses their individual representations with a permutation-invariant operator to produce a peptide-level representation for downstream prediction. We then evaluate our framework on six peptide property-prediction tasks under leakage-controlled splits. Against matched single-structure baselines, EASE improves performance consistently on six tasks with a mean absolute gain of about 3.0% across two structural encoders. Gains keep growing as we add conformers through K=20. A single peptide conformer therefore provides a limited basis for structural representation, whereas our framework distilling and fusing multiple conformers yields a more informative representation.

Tue 20 OctMachine Learning
The gist
Peptides can take multiple shapes, but most computer models look at only one shape to predict properties like how well they fight bacteria or how toxic they are. The authors created a method called EASE that looks at many possible peptide shapes, picks important ones, and combines their information to get a better picture. This helps predictions about peptides improve by about 3% compared to using just one shape. This shows that using multiple forms of peptide structures is more useful than looking at just one.
Open → 2610.27638v1

Computational enzyme metrics vary widely in predicting catalytic activity

Do in-silico metrics filter designed enzymes for catalysis?

Abstract: Computational metrics are widely used to prioritize enzyme designs for experimental testing, yet their ability to capture catalytic function remains poorly established. Here, we systematically evaluate 33 in-silico metrics across four complementary tasks: distinguishing active from inactive enzymes, identifying substrate specificity, ranking enzyme variants by activity, and detecting perturbations to catalytic residues. We assess these capabilities using natural enzymes, computationally designed enzymes, activity-altering variants, and controlled structural perturbations that compare catalytic residues with matched non-catalytic sites. No single metric consistently captures all aspects of catalytic function. In activity discrimination, catalytic-residue intra-residue repulsion achieves the highest AUROC among the evaluated metrics for both natural enzymes (0.61) and 192 designs that passed the filters of their original design campaign (0.80). For substrate discrimination, interface predicted TM-score (ipTM) performs best (AUROC 0.70), whereas the catalytic pKa range shows the strongest association with activity across single-point variants of BglB (Spearman's rho = 0.48). In controlled perturbation tests, the minimum per-chain predicted TM-score (pTM) has a mean probability of 0.75 of responding more strongly to perturbations at catalytic residues than to matched perturbations at non-catalytic sites. These results reveal substantial variation in what current computational metrics capture, underscoring the need to distinguish structural confidence and physical plausibility from direct evidence of catalytic function when prioritizing enzyme designs.

Sat 17 OctComputational Engineering, Finance, and Science
The gist
Choosing which computer-designed enzymes to test in the lab is a hard problem because it's unclear how well computer scores predict how well enzymes will work. The authors looked at 33 different computer metrics to see if they could tell active enzymes from inactive ones, figure out what substrates enzymes prefer, rank enzyme variants by how active they are, or detect changes to important parts of the enzyme. They found that no single measure works well for all these tasks, and different metrics capture different aspects of enzyme function. This means enzyme designers should be careful when using these computer scores to decide which enzymes to experiment on.
Open → 2610.24437v1

Model predicts cancer survival by matching images and gene data

Anchor-driven Multi-modal Multi-scale Expert Selection for Survival Prediction

Abstract: The integrative analysis of histopathological Whole-Slide Images (WSIs) and transcriptomic profiles holds significant promise for cancer survival prediction. However, existing methods typically project multi-modal features directly into a shared latent space without explicit alignment, leading to the entanglement of mismatched morphological cues and molecular signals. Furthermore, current fusion strategies often treat the extreme spatial heterogeneity of WSIs uniformly, lacking mechanisms to adaptively prioritize clinically relevant tissue scales for individual patients. To address these limitations, we propose an Anchor-driven Multi-modal Multi-scale Expert Selection (AM$^2$ES) framework for survival prediction. Specifically, we present an Anchor-driven Multi-modal Fusion (AMF) module, which introduces learnable semantic anchors as cross-modal mediators to bridge the semantic gap by enforcing a structurally regularized alignment between transcriptomic features and multi-scale pathology representations. Built upon this aligned semantic space, we further design a Hierarchical Mixture-of-Experts (H-MoE) selection module to decouple the hierarchical prognostic selection process. Mimicking the pathologist's diagnostic workflow, H-MoE performs (i) Intra-scale Expert Filtering to discriminatively identify salient tumor regions within each magnification, and (ii) Inter-scale Hierarchy Routing to dynamically weight and select the most informative resolution levels. Extensive experiments on multiple TCGA cancer cohorts demonstrate that our AM$^2$ES achieves state-of-the-art performance while offering fine-grained interpretability by visualizing how specific molecular pathways drive the expert routing decisions across tissue scales. The code will be released at https://github.com/taozh2017/AM2ES.

Tue 6 OctComputer Vision and Pattern Recognition
The gist
Predicting how long cancer patients might survive can be hard because tumor images and gene tests are very different types of data. The authors created a method that helps these two kinds of information 'talk' to each other better by using special guide points called anchors. Their system also mimics how doctors look at tumors at different zoom levels, picking the most important parts and scales for each patient. This approach works better than past methods and shows which genes influence the decisions at different tissue details.
Open → 2610.07694v1