On the exact solution of the distance geometry with interval distances in dimension 1
From MaRDI portal
Publication:4609775
Recommendations
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Distance geometry in linearizable norms
- New methods for the distance geometry problem
- Feasibility check for the distance geometry problem: an application to molecular conformations
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
Cites work
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Clifford algebra and the discretizable molecular distance geometry problem
- Distance Geometry
- Essential order spectra of convolution operators
- Euclidean distance geometry and applications
- Fundamental Limits on Synchronizing Clocks Over Networks
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Preface
- Recent advances on the interval distance geometry problem
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Spheres Unions and Intersections and Some of their Applications in Molecular Modeling
- The discretizable distance geometry problem
- The discretizable molecular distance geometry problem
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
Cited in
(3)
This page was built for publication: On the exact solution of the distance geometry with interval distances in dimension 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4609775)