sgoel30 commited on
Commit
7b3b09a
·
verified ·
1 Parent(s): 0fa2d2b

Update README.md

Browse files
Files changed (1) hide show
  1. README.md +22 -11
README.md CHANGED
@@ -1,24 +1,35 @@
1
- # Token-Level Guided Discrete Diffusion for Membrane Protein Design
 
 
2
 
3
- ![MemDLM diagram](./memdlm_schematic.png)
4
 
 
 
 
 
 
 
 
 
 
 
 
5
 
6
- arXiv preprint: ...
7
 
8
- Reparameterized diffusion models (RDMs) have recently matched autoregressive methods in protein generation, motivating their use for challenging tasks such as designing membrane proteins, which possess interleaved soluble and transmembrane (TM) regions.
9
 
10
- We introduce ***Membrane Diffusion Language Model (MemDLM)***, a fine-tuned RDM-based protein language model that enables controllable membrane protein sequence design. MemDLM-generated sequences recapitulate the TM residue density and structural features of natural membrane proteins, achieving comparable biological plausibility and outperforming state-of-the-art diffusion baselines in motif scaffolding tasks by producing:
11
 
12
- - Lower perplexity
13
- - Higher BLOSUM-62 scores
14
- - Improved pLDDT confidence
15
 
16
- To enhance controllability, we develop ***Per-Token Guidance (PET)***, a novel classifier-guided sampling strategy that selectively solubilizes residues while preserving conserved TM domains. This yields sequences with reduced TM density but intact functional cores.
17
 
18
- Importantly, MemDLM designs validated in TOXCAT β-lactamase growth assays demonstrate successful TM insertion, distinguishing high-quality generated sequences from poor ones.
19
 
20
- Together, our framework establishes the first experimentally validated diffusion-based model for rational membrane protein generation, integrating *de novo* design, motif scaffolding, and targeted property optimization.
 
21
 
 
22
 
23
 
24
  ## **Repository Authors**
 
1
+ ---
2
+ license: cc-by-nc-nd-4.0
3
+ ---
4
 
5
+ <h1 align='center'>Minimal-Action Discrete Schrödinger Bridge Matching for Peptide Sequence Design</h1>
6
 
7
+ <div align="center">
8
+ <a href="https://shreygoel09.github.io/" target="_blank">Shrey Goel</a><sup>1</sup>&ensp;<b>&middot;</b>&ensp;
9
+ <a href="https://www.chatterjeelab.com/" target="_blank">Pranam Chatterjee</a><sup>2<sup>
10
+ <br>
11
+ <p style="font-size: 16px;">
12
+ <sup>1</sup> Duke University &emsp;
13
+ <sup>2</sup> University of Pennsylvania &emsp;
14
+ </div>
15
+
16
+ <div align="center">
17
+ <a href="https://arxiv.org/abs/2410.16735"><img src="https://img.shields.io/badge/Arxiv-2506.09007-red?style=for-the-badge&logo=Arxiv" alt="arXiv"/></a>
18
 
19
+ </div>
20
 
 
21
 
 
22
 
23
+ ![MadSBM Diagram](./MadSBM_Figure.png)
 
 
24
 
25
+ Generative modeling of peptide sequences requires navigating a discrete and highly constrained space in which many intermediate states are chemically implausible or unstable. Existing discrete diffusion and flow-based methods rely on reversing fixed corruption processes or following prescribed probability paths, which can force generation through low-likelihood regions and require many sampling steps.
26
 
27
+ We introduce **Minimal-Action Discrete Schrödinger Bridge Matching (MadSBM)**, a rate-based generative framework for peptide design that formulates generation as a controlled continuous-time Markov process on the amino-acid edit graph. To produce probability trajectories that remain within high-likelihood sequence neighborhoods throughout generation, MadSBM:
28
 
29
+ 1. Defines generation relative to a biologically informed reference process derived from pretrained protein language model logits.
30
+ 2. Learns a time-dependent control field that biases transition rates to induce low-action transport paths from a masked prior to the data distribution.
31
 
32
+ Finally, we introduce an objective-guided sampling procedure that steers MadSBM generation toward specific functional targets, representing—to our knowledge—the first application of discrete classifier guidance within a Schrödinger bridge-based generative framework.
33
 
34
 
35
  ## **Repository Authors**