arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.05974cs.DMmath.COmath.OC
收藏

Hamming 图的可分辨性

Resolvability of Hamming Graphs

Lucas Laird, Richard C. Tillquist, Stephen Becker, Manuel E. Lladser

AI总结:

本文用受约束线性系统刻画 Hamming 图可分辨性,提出 ILP 快速评估与 Gröbner 基确定性判定方法,并在八肽空间找到大小为 77 的可分辨集。

摘要:

图中的一个顶点子集被称为可分辨的,当到这些顶点的测地距离能够唯一地区分图中的每个顶点。本文利用一个受约束线性系统刻画了 Hamming 图的可分辨性,并由此推导出关于超立方体可分辨性的一种新颖而直接的刻画。作者提出了一种整数线性规划方法,用于快速评估可分辨性;同时提供了一种成本更高但具有确定性的方法,该方法基于 Gröbner 基,用于判定一个顶点集合是否能分辨任意 Hamming 图。作为概念验证,作者在所有八肽(即由八个氨基酸组成的蛋白质)关于 Hamming 距离构成的度量空间中,识别出一个大小为 77 的可分辨集;具体而言,任何八聚体都可以方便地表示为一个 77 维实向量。将 k-mer 表示为低维数值向量,可能使机器学习算法在符号序列上获得新的应用。

英文摘要:

A subset of vertices in a graph is called resolving when the geodesic distances to those vertices uniquely distinguish every vertex in the graph. Here, we characterize the resolvability of Hamming graphs in terms of a constrained linear system and deduce a novel but straightforward characterization of resolvability for hypercubes. We propose an integer linear programming method to assess resolvability rapidly, and provide a more costly but definite method based on Gröbner bases to determine whether or not a set of vertices resolves an arbitrary Hamming graph. As proof of concept, we identify a resolving set of size 77 in the metric space of all octapeptides (i.e., proteins composed of eight amino acids) with respect to the Hamming distance; in particular, any octamer may be readily represented as a 77-dimensional real-vector. Representing k-mers as low-dimensional numerical vectors may enable new applications of machine learning algorithms to symbolic sequences.

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

↑