Embedding with a Rigid Substructure
Igor Najfeld, Timothy F. Havel

TL;DR
This paper introduces a novel distance geometry algorithm that efficiently computes atomic coordinates from interatomic distances while preserving a known rigid substructure, with demonstrated effectiveness on simulated and chemical data.
Contribution
The paper develops a new algorithm that maintains a rigid substructure during coordinate estimation and characterizes the solution space using geometric intersection analysis.
Findings
Successfully locates the global minimum in test problems.
Provides tight bounds on moments of inertia for solutions.
Demonstrates effectiveness on realistic simulated and chemical datasets.
Abstract
This paper presents a new distance geometry algorithm for calculating atomic coordinates from estimates of the interatomic distances, which maintains the positions of the atoms in a known rigid substructure. Given an matrix of coordinates for the rigid substructure , this problem consists of finding the matrix that yields of global minimum of the so-called STRAIN, i.e. \[ \min_{\mathbf Y} \left\| \begin{bmatrix} \mathbf{XX}^\top & \mathbf{XY}^\top \\ \mathbf{YX}^\top & \mathbf{YY}^\top \end{bmatrix} \,-\, \begin{bmatrix} \mathbf A & \mathbf B \\ \mathbf B^\top & \mathbf C \end{bmatrix} \right\|_{\mathsf F}^2 ~, \] where , and are matrices of inner products calculated from the estimated distances. The vanishing of the gradient of the STRAIN is shown to be equivalent to a system of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
