Graph rigidity, unassigned distance geometry and the nanostructure problem
Graph rigidity, unassigned distance geometry and the nanostructure problem
复制标题
图刚性、未分配距离几何和纳米结构问题
DOI：
--
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
S. Billinge
中科院分区：
文献类型：
--
作者：
P. Duxbury;S. Billinge
未分配的距离几何形状（UDGP）问题作为输入插口距离列表，d = {dı}，l = 1，…，| d |，其解决方案是维度K的欧几里得空间中的一组点位置。 UDGP很难讨论了概述和应用域。
The unassigned distance geometry (UDGP) problem takes as input a list of interpoint distances, d = {dı}, l = 1,…, |d|, and its solution is a set of point positions in a Euclidean space of dimension K. The UDGP is difficult because it requires both the discovery of the underlying graph structure and the embedding of that graph. Recent theoretical results and algorithms based on building up low cost structures from smaller substructures are outlined and application domains are discussed.