DeepAI AI Chat
Log In Sign Up

A new algorithm for the ^KDMDGP subclass of Distance Geometry Problems

by   Douglas S. Goncalves, et al.
University of Campinas
UFC informa

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


page 1

page 2

page 3

page 4


A New Approach for Finding the Global Optimal Point Using Subdividing Labeling Method (SLM)

In most global optimization problems, finding global optimal point inthe...

Computational Protein Design Using AND/OR Branch-and-Bound Search

The computation of the global minimum energy conformation (GMEC) is an i...

A new algorithm for graph center computation and graph partitioning according to the distance to the center

We propose a new algorithm for finding the center of a graph, as well as...

Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D

The k-Means clustering problem on n points is NP-Hard for any dimension ...

CCCP Algorithms to Minimize the Bethe free energy of 3-SAT Problem

The k-sat problem is a prototypical constraint satisfaction problem. The...

Nonlinear Mapping and Distance Geometry

Distance Geometry Problem (DGP) and Nonlinear Mapping (NLM) are two well...