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 …

We discuss a discretization-based solution approach for a classic problem in global
optimization, namely the distance geometry problem (DGP). We focus our attention on a …

What do clocks, wireless devices, atoms, and submarines have in common? They move: the
clocks move time forward (so to speak), wireless devices usually move on a plane (like an …

Background The determination of protein structures satisfying distance constraints is an
important problem in structural biology. Whereas the most common method currently …

Abstract Nuclear Magnetic Resonance (NMR) experiments provide distances between
nearby atoms of a protein molecule. The corresponding structure determination problem is …

Abstract Nuclear Magnetic Resonance experiments can provide distances between pairs of
atoms of a protein that are close enough and the problem is how to determine the 3D protein …

Considering geometry based on the concept of distance, the results found by Menger and
Blumenthal originated a body of knowledge called distance geometry. This survey covers …

In the 2 years since our last 4OR review of distance geometry methods with applications to
proteins and nanostructures, there has been rapid progress in treating uncertainties in the …

Abstract The interval Branch and Prune (i BP) algorithm for obtaining solutions to the interval
Discretizable Molecular Distance Geometry Problem (i DMDGP) has proven itself as a …

Distance geometry (DG) is a distinct mathematical research area which includes
mathematics and computer science as fundamental components. The fundamental problem …