Solving the molecular distance geometry problem with inaccurate distance data
نویسندگان
چکیده
منابع مشابه
A Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance Data
Nuclear magnetic resonance (NMR) structure modeling usually produces a sparse set of inter-atomic distances in protein. In order to calculate the three-dimensional structure of protein, current approaches need to estimate all other “missing” distances to build a full set of distances. However, the estimation step is costly and prone to introducing errors. In this report, we describe a geometric...
متن کاملThe discretizable molecular distance geometry problem
Given a simple weighted undirected graph G = (V,E, d) with d : E → R+, the Molecular Distance Geometry Problem (MDGP) consists in finding an embedding x : V → R such that ||xu −xv|| = duv for each {u, v} ∈ E. We show that under a few assumptions usually satisfied in proteins, the MDGP can be formulated as a search in a discrete space. We call this MDGP subclass the Discretizable MDGP (DMDGP). W...
متن کاملComputational Experience with the Molecular Distance Geometry Problem
In this work we consider the molecular distance geometry problem, which can be defined as the determination of the three-dimensional structure of a molecule based on distances between some pairs of atoms. We address the problem as a nonconvex least-squares problem. We apply three global optimization algorithms (spatial Branch-and-Bound, Variable Neighbourhood Search, Multi Level Single Linkage)...
متن کاملA linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
We describe a linear-time algorithm for solving the molecular distance geometry problem with exact distances between all pairs of atoms. This problem needs to be solved in every iteration of general distance geometry algorithms for protein modeling such as the EMBED algorithm by Crippen and Havel (Distance Geometry and Molecular Conformation, Wiley, 1988). However, previous approaches to the pr...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2013
ISSN: 1471-2105
DOI: 10.1186/1471-2105-14-s9-s7