arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.03463q-bio.QMcond-mat.dis-nnphysics.bio-phq-bio.BM
收藏

多序列比对的小耦合展开

Small Coupling Expansion for Multiple Sequence Alignment

Louise Budzynski, Andrea Pagnani

AI总结:

本文提出基于消息传递与自由能小耦合展开的多序列比对算法,以线性链近似为零阶,突破位点独立剖面模型限制,并在生物序列上验证其性能。

摘要:

DNA、RNA和蛋白质等生物序列的比对,是检测不同生物体同源序列之间进化模式以及功能/结构特征的基础工具之一。通常,最先进的生物信息学工具基于剖面模型,这类模型假设序列不同位点之间具有统计独立性。近年来,人们越来越清楚地认识到,由于自然进化过程会在保留序列功能/结构决定因素的约束下选择遗传变异,同源序列在一级序列上表现出复杂的长程相关模式。在此,我们提出一种基于消息传递技术的新型比对算法,以克服剖面模型的局限性。我们的方法基于对模型自由能的一种新的微扰小耦合展开,该展开采用线性链近似作为展开的零阶。我们在若干生物序列上,针对标准竞争策略测试了该算法的潜力。

英文摘要:

The alignment of biological sequences such as DNA, RNA, and proteins, is one of the basic tools that allow to detect evolutionary patterns, as well as functional/structural characterizations between homologous sequences in different organisms. Typically, state-of-the-art bioinformatics tools are based on profile models that assume the statistical independence of the different sites of the sequences. Over the last years, it has become increasingly clear that homologous sequences show complex patterns of long-range correlations over the primary sequence as a consequence of the natural evolution process that selects genetic variants under the constraint of preserving the functional/structural determinants of the sequence. Here, we present a new alignment algorithm based on message passing techniques that overcomes the limitations of profile models. Our method is based on a new perturbative small-coupling expansion of the free energy of the model that assumes a linear chain approximation as the $0^\mathrm{th}$-order of the expansion. We test the potentiality of the algorithm against standard competing strategies on several biological sequences.

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

↑