Open research areas in distance geometry
From MaRDI portal
Publication:2325253
Abstract: Distance Geometry is based on the inverse problem that asks to find the positions of points, in a Euclidean space of given dimension, that are compatible with a given set of distances. We briefly introduce the field, and discuss some open and promising research areas.
Recommendations
Cited in
(12)- Realizing Euclidean distance matrices by sphere intersection
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
- A cycle-based formulation for the distance geometry problem
- A quantum approach to the discretizable molecular distance geometry problem
- Unassigned distance geometry and molecular conformation problems
- NMR protein structure calculation and sphere intersections
- On the optimality of finding DMDGP symmetries
- Double-distance frameworks and mixed sparsity graphs
- Global rigidity of generic frameworks on the cylinder
- Minkowski Geometry—Some Concepts and Recent Developments
- Cycle-based formulations in distance geometry
This page was built for publication: Open research areas in distance geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2325253)