Polynomial cases of the Discretizable Molecular Distance Geometry Problem
نویسندگان
چکیده
An important application of distance geometry to biochemistry studies the embeddings of the vertices of a weighted graph in the three-dimensional Euclidean space such that the edge weights are equal to the Euclidean distances between corresponding point pairs. When the graph represents the backbone of a protein, one can exploit the natural vertex order to show that the search space for feasible embeddings is discrete. The corresponding decision problem can be solved using a binary tree based search procedure which is exponential in the worst case. We discuss assumptions that bound the search tree width to a polynomial size.
منابع مشابه
A Clifford Algebra approach to the Discretizable Molecular Distance Geometry Problem
The Discretizable Molecular Distance Geometry Problem (DMDGP) consists in a subclass of the Molecular Distance Geometry Problem for which an embedding in R can be found using a Branch & Prune (BP) algorithm in a discrete search space. We propose a Clifford Algebra model of the DMDGP with an accompanying version of the BP algorithm.
متن کاملAn exponential algorithm for the Discretizable Molecular Distance Geometry Problem is polynomial on proteins
An important application of distance geometry to biochemistry studies the embeddings of the vertices of a weighted graph in the three-dimensional Euclidean space such that the edge weights are equal to the Euclidean distances between corresponding point pairs. When the graph represents the backbone of a protein, one can exploit the natural vertex order to show that the search space for feasible...
متن کاملOn the Number of Solutions of the Discretizable Molecular Distance Geometry Problem
The Generalized Discretizable Molecular Distance Geometry Problem is a distance geometry problems that can be solved by a combinatorial algorithm called “Branch-and-Prune”. It was observed empirically that the number of solutions of YES instances is always a power of two. We give a proof that this event happens with probability one.
متن کاملThe discretizable distance geometry problem
We introduce the Discretizable Distance Geometry Problem in R (DDGP3), which consists in a subclass of instances of the Distance Geometry Problem for which an embedding in R can be found by means of a discrete search. We show that the DDGP3 is a generalization of the Discretizable Molecular Distance Geometry Problem (DMDGP), and we discuss the main differences between the two problems. We prove...
متن کاملRecent advances on the Discretizable Molecular Distance Geometry Problem
The Molecular Distance Geometry Problem (MDGP) consists in finding an embedding in R of a nonnegatively weighted simple undirected graph with the property that the Euclidean distances between embedded adjacent vertices must be the same as the corresponding edge weights. The Discretizable Molecular Distance Geometry Problem (DMDGP) is a particular subset of the MDGP which can be solved using a d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1103.1264 شماره
صفحات -
تاریخ انتشار 2011