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 …

The Molecular Distance Geometry Problem (MDGP) consists in finding an embedding in R3
of a nonnegatively weighted simple undirected graph with the property that the Euclidean …

Given a simple weighted undirected graph G=(V, E, d) with d: E→ ℝ+, the Molecular
Distance Geometry Problem (MDGP) consists in finding an embedding x: V→ ℝ 3 such …

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 …

Abstract The Distance Geometry Problem in three dimensions consists in finding an
embedding in R^ 3 of a given nonnegatively weighted simple undirected graph such that …

We introduce the discretizable distance geometry problem in R^ 3 (DDGP 3), which consists
in a subclass of instances of the Distance Geometry Problem for which an embedding in R …

Given a weighted, undirected simple graph G=(V, E, d)(where d: E → R _+), the distance
geometry problem (DGP) is to determine an embedding x: V → R^ K such that ∀ {i, j\} ∈ E\; …

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

Several application fields require finding Euclidean coordinates consistent with a set of
distances. More precisely, given a simple undirected edge-weighted graph, we wish to find a …

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