arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.01231cs.CGmath.MG
收藏

距离几何学中不可能的乌托邦

An impossible utopia in distance geometry

Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, Antonio Mucherino

摘要:

距离几何问题要求在$\mathbb{R}^K$中实现给定的加权图。这个问题的两个变体,都源于蛋白质构象,是基于一个给定的顶点顺序(抽象的蛋白质骨架)。这两种变体都涉及在使用$K$之前(已经实现的)顶点的顺序中实现下一个顶点的离散决策的元素。这些变体之间的区别在于需要$K$前面的顶点是连续的。这个约束的存在允许一个证明,通过组合计数的解决方案的数量,实现算法是固定参数听话。另一方面,它的缺失使得直接从图中有效地构造顶点序成为可能。因此,在不使用邻接要求的情况下导出组合计数方法将是期望的。在本文中,我们证明,不幸的是,这样的计数方法不能设计一般。

英文摘要:

The Distance Geometry Problem asks for a realization of a given weighted graph in $\mathbb{R}^K$. Two variants of this problem, both originating from protein conformation, are based on a given vertex order (which abstracts the protein backbone). Both variants involve an element of discrete decision in the realization of the next vertex in the order using $K$ preceding (already realized) vertices. The difference between these variants is that one requires the $K$ preceding vertices to be contiguous. The presence of this constraint allows one to prove, via a combinatorial counting of the number of solutions, that the realization algorithm is fixed-parameter tractable. Its absence, on the other hand, makes it possible to efficiently construct the vertex order directly from the graph. Deriving a combinatorial counting method without using the contiguity requirement would therefore be desirable. In this paper we prove that, unfortunately, such a counting method cannot be devised in general.

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

↑