A New Algorithm for the $$^K$$DMDGP Subclass of Distance Geometry Problems with Exact Distances

The fundamental inverse problem in distance geometry is the one of finding positions from inter-point distances. Discretizable Molecular Distance Geometry Problem (DMDGP) a subclass (DGP) whose search space can be discretized and represented by binary tree, which explored Branch-and-Prune (BP) algorithm. It turns out that this combinatorial possesses many interesting symmetry properties were studied last decade. In paper, we present new algorithm for DGP, exploits DMDGP symmetries more effectively than its predecessors. Computational results show speedup, with respect to classic BP algorithm, considerable sparse instances related protein conformation.