Discrete diffusion or flow models could enable faster and more controllable sequence generation than autoregressive models. We show that naïve linear flow matching on the simplex is insufficient toward this goal since it suffers from discontinuities in the training target and further pathologies. To overcome this, we develop Dirichlet flow matching on the simplex based on mixtures of Dirichlet distributions as probability paths. In this framework, we derive a connection between the mixtures' scores and the flow's vector field that allows for classifier and classifier-free guidance. Further, we provide distilled Dirichlet flow matching, which enables one-step sequence generation with minimal performance hits, resulting in $O(L)$ speedups compared to autoregressive models. On complex DNA sequence generation tasks, we demonstrate superior performance compared to all baselines in distributional metrics and in achieving desired design targets for generated sequences. Finally, we show that our classifier-free guidance approach improves unconditional generation and is effective for generating DNA that satisfies design targets. Code is available at https://github.com/HannesStark/dirichlet-flow-matching.
Multi-Objective-Guided Discrete Flow Matching for Controllable Biological Sequence Design
Department of Biomedical Engineering, Duke University(杜克大学生物医学工程系);Department of Computer Science, Fudan University(复旦大学计算机科学系);Center of Computational Biology, Duke-NUS Medical School(杜克-新加坡国立大学医学学校计算生物学中心);Management and Technology Program, University of Pennsylvania(宾夕法尼亚大学管理与技术项目);Department of Computer Science, Duke University(杜克大学计算机科学系);Department of Biostatistics and Bioinformatics, Duke University(杜克大学生物统计与生物信息学系)
提出 MOG-DFM 框架,通过混合秩方向分数和自适应超锥滤波引导预训练离散流匹配模型,实现多目标帕累托高效的肽与增强子 DNA 序列设计。
Gumbel-Softmax Flow Matching with Straight-Through Guidance for Controllable Biological Sequence Generation
Duke University(杜克大学);University of Pennsylvania(宾夕法尼亚大学);Duke-NUS Medical School(杜克-新加坡国立大学医学院);Mila, Quebec AI Institute(米拉魁北克人工智能研究所);Université de Montréal(蒙特利尔大学)
Simplex-to-Euclidean Bijections for Categorical Flow Matching
Department of Computer Science, University of Helsinki(赫尔辛基大学计算机科学系);Department of Computer Science, Aalto University(阿莱大学计算机科学系);ELLIS Institute Finland(芬兰ELLIS研究所)
Improving Flow Matching by Aligning Flow Divergence
Department of Mathematics, University of Utah, Salt Lake City, UT, USA(犹他大学数学系);Imaging (SCI) Institute, Salt Lake City, UT, USA(成像(SCI)研究所);Computer Science Division, 240 Argonne National Laboratory, Lemont, IL, USA(计算机科学部,阿贡国家实验室)
A small PAM optimises target recognition in the CRISPR-Cas immune system
CRISPR-Cas是一种适应性免疫机制,已被用于各种基因工程应用:Cas9蛋白识别2- 5 nt DNA基序,称为PAM,可编程crRNA结合靶DNA序列,然后切割。虽然脱靶活性是不希望的,但它的发生是因为交叉反应性在该机制所基于的免疫系统中是有益的。在这里,一个随机模型的目标识别反应的推导来研究的特异性先天免疫机制的细菌。在自身和噬菌体DNA上测试了具有识别不同长度PAM的Cas9蛋白的CRISPR系统。该模型显示与PAM结合相关的能量影响错配耐受性、切割概率和切割时间。小PAM允许CRISPR平衡捕获突变体,避免自我靶向,并快速与严重不匹配的序列分离。此外,结果揭示了对PAM和称为种子的PAM近端区域中的错配的较低耐受性,如实验中所见。这项工作说明了Cas9蛋白在决定DNA切割特异性方面的作用,这有助于防止生物技术应用中的脱靶活性。