arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.05404math.COcs.DM
收藏

距离几何问题$^K$ DMDGP子类的新算法

A new algorithm for the $^K$DMDGP subclass of Distance Geometry Problems

Douglas S. Goncalves, Carlile Lavor, Leo Liberti, Michael Souza

摘要:

距离几何中最基本的反问题是由点间距离求位置。可离散分子距离几何问题(DMDGP)是距离几何问题(DGP)的一个子类,其搜索空间可以离散化,用二叉树表示,可以用分支剪枝(BP)算法进行搜索。事实证明,这个组合搜索空间具有许多有趣的对称性,在过去的十年中进行了研究。在本文中,我们提出了一个新的算法,这个子类的DGP,它利用DMDGP对称性更有效地比它的前辈。计算结果表明,相对于经典的BP算法,对于与蛋白质构象相关的稀疏DMDGP实例,该算法具有相当大的加速比。

英文摘要:

The fundamental inverse problem in distance geometry is the one of finding positions from inter-point distances. The Discretizable Molecular Distance Geometry Problem (DMDGP) is a subclass of the Distance Geometry Problem (DGP) whose search space can be discretized and represented by a binary tree, which can be explored by a Branch-and-Prune (BP) algorithm. It turns out that this combinatorial search space possesses many interesting symmetry properties that were studied in the last decade. In this paper, we present a new algorithm for this subclass of the DGP, which exploits DMDGP symmetries more effectively than its predecessors. Computational results show that the speedup, with respect to the classic BP algorithm, is considerable for sparse DMDGP instances related to protein conformation.

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

↑