arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.16142q-bio.BM
收藏

DiffPaSS——使用软分数进行蛋白质序列的高性能可微分配对

DiffPaSS -- High-performance differentiable pairing of protein sequences using soft scores

Umberto Lupo, Damiano Sgarbossa, Martina Milighetti, Anne-Florence Bitbol

AI总结:

本文提出可微框架DiffPaSS,无需超参数即可快速优化蛋白质序列配对,在互信息和邻居图比对分数上优于现有方法,并能提升蛋白质复合物结构预测效果。

摘要:

从两组蛋白质序列中识别相互作用伙伴在计算生物学中具有重要应用。由于共同的进化历史,相互作用伙伴在不同物种间具有相似性,并且由于需要维持互补的相互作用界面,它们在氨基酸使用上表现出相关性。因此,寻找相互作用对的问题可以被表述为搜索一种序列配对方式,以最大化序列相似性或协同进化分数。目前已开发出多种方法来解决这一问题,它们将不同的近似优化方法应用于不同的分数。我们提出了DiffPaSS,这是一个可微框架,用于对相互作用的生物序列进行灵活、快速且无需超参数的配对优化,可应用于多种分数。我们将其应用于一个原核生物基准数据集,使用互信息和邻居图比对分数。DiffPaSS在优化相同分数方面优于现有算法。我们证明了所得到的配对比对在蛋白质复合物结构预测中的实用性。DiffPaSS不要求序列预先比对,我们还将其应用于来自T细胞受体的未比对序列。

英文摘要:

Identifying interacting partners from two sets of protein sequences has important applications in computational biology. Interacting partners share similarities across species due to their common evolutionary history, and feature correlations in amino acid usage due to the need to maintain complementary interaction interfaces. Thus, the problem of finding interacting pairs can be formulated as searching for a pairing of sequences that maximizes a sequence similarity or a coevolution score. Several methods have been developed to address this problem, applying different approximate optimization methods to different scores. We introduce DiffPaSS, a differentiable framework for flexible, fast, and hyperparameter-free optimization for pairing interacting biological sequences, which can be applied to a wide variety of scores. We apply it to a benchmark prokaryotic dataset, using mutual information and neighbor graph alignment scores. DiffPaSS outperforms existing algorithms for optimizing the same scores. We demonstrate the usefulness of our paired alignments for the prediction of protein complex structure. DiffPaSS does not require sequences to be aligned, and we also apply it to non-aligned sequences from T cell receptors.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑