Euclidean Distance Geometry and Applications

@article{Liberti2014EuclideanDG,
  title={Euclidean Distance Geometry and Applications},
  author={Leo Liberti and C. Lavor and N. Maculan and A. Mucherino},
  journal={SIAM Rev.},
  year={2014},
  volume={56},
  pages={3-69}
}
Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consist of an incomplete set of distances and the output is a set of points in Euclidean space realizing those given distances. We survey the theory of Euclidean distance geometry and its most important applications, with special emphasis on molecular conformation problems. 
Open research areas in distance geometry
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 brieflyExpand
A Cycle-Based Formulation for the Distance Geometry Problem
TLDR
This work proposes and test a new mathematical programming formulation based on the incidence between cycles and edges in the given graph, where the edges are realized as straight segments of length equal to the edge weight. Expand
On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
Abstract We consider some Euclidean distance matrix completion problems whose structure is inspired by molecular conformation problems. Some matrix distances are given precisely or in terms ofExpand
Realizing Euclidean distance matrices by sphere intersection
TLDR
The theoretical properties of an algorithm to find a realization of a (full) n × n Euclidean distance matrix in the smallest possible embedding dimension are presented, which is an improvement w.r.t. other algorithms. Expand
Distance Geometry on the Sphere
TLDR
This paper generalizes a theorem of Godel about the case where the distances are spherical geodesics, and discusses a method for realizing cliques geodesically on a K-dimensional sphere. Expand
Discretization orders and efficient computation of cartesian coordinates for distance geometry
TLDR
New discretization assumptions that are weaker than previously proposed ones are discussed, and a greedy algorithm is presented for an automatic identification of discretized orders to motivate the development of a new method for computing point coordinates. Expand
A constrained interval approach to the generalized distance geometry problem
TLDR
This paper presents a new approach to the generalized distance geometry problem, based on a model that uses constraint interval arithmetic, and gives some computational experiments that illustrate the better performance of the proposed approach, compared to others from the literature. Expand
The Isomap Algorithm in Distance Geometry
TLDR
This work starts from a simple observation, namely that Isomap can also be used to provide approximate realizations of weighted graphs very eciently, and then derive and benchmark six new heuristics. Expand
An Analysis of the Relation Between Similarity Positions and Attributes of Concepts by Distance Geometry
TLDR
A function to map a similarity position of a concept to its coordinates in a geometry space is constructed and it is proved that such functions do exist under some conditions and will benefit attribute retrieval tasks. Expand
Fisher information distance: a geometrical reading?
TLDR
This paper presents a geometrical approach to the Fisher distance, which is a measure of dissimilarity between two probability distribution functions, and takes advantage of the connection with the classical hyperbolic geometry to derive closed forms for the Fisherdistance in several cases. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 319 REFERENCES
The theory and practice of distance geometry
The mathematics of distance geometry constitutes the basis of a group of algorithms for revealing the structural consequences of diverse forms of information about a macromolecule's conformation.Expand
Computational Experience with the Molecular Distance Geometry Problem
TLDR
This work applies three global optimization algorithms (spatial Branch-and-Bound, Variable Neighbourhood Search, Multi Level Single Linkage) to two sets of instances, one taken from the literature and the other new. Expand
On the Discretization of Distance Geometry Problems
Distance geometry consists of finding an embedding of a weighted undirected graph in R^n. Since some years, we are working on suitable discretizations for this problem. Because of the discretization,Expand
An alternating projection algorithm for computing the nearest euclidean distance matrix
Recent extensions of von Neumann’s alternating projection algorithm permit an effective numerical approach to certain least squares problems subject to side conditions. This paper treats the problemExpand
Global continuation for distance geometry problems
Distance geometry problems arise in the interpretation of NMR data and in the determination of protein structure. The authors formulate the distance geometry problem as a global minimization problemExpand
On the solution of molecular distance geometry problems with interval data
The Molecular Distance Geometry Problem consists in finding the three-dimensional conformation of a protein using some of the distances between its atoms provided by experiments of Nuclear MagneticExpand
Convex Optimization & Euclidean Distance Geometry
Optimization is the science of making a best choice in the face of conflicting requirements. Any convex optimization problem has geometric interpretation. If a given optimization problem can beExpand
New Foundation of Euclidean Geometry
My second paper on metrical geometry * contains a characterisation of the n-dimensional euclidean space among general semi-metrical spaces in terms of relations between the distances of its points.Expand
Molecular distance geometry methods: from continuous to discrete
TLDR
Some continuous and discrete methods for solving some problems of molecular distance geometry involve a search in a continuous Euclidean space but sometimes the problem structure helps reduce the search to a discrete set of points. Expand
Solving the molecular distance geometry problem with inaccurate distance data
We present a new iterative algorithm for the molecular distance geometry problem with inaccurate and sparse data, which is based on the solution of linear systems, maximum cliques, and a minimizationExpand
...
1
2
3
4
5
...