The iBP algorithm for the discretizable molecular distance geometry problem with interval data

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 edge weights are equal to the corresponding Euclidean distances in the embedding. This is a continuous search problem that can be discretized under some assumptions on the minimum degree of the … Read more