A Geometric Buildup Algorithm for the Solution of the Distance Geometry Problem Using Least-Squares Approximation

We propose a new geometric buildup algorithm for the solution of the distance geometry problem in protein modeling, which can prevent the accumulation of the rounding errors in the buildup calculations successfully and also tolerate small errors in given distances. In this algorithm, we use all instead of a subset of available distances for the determination of each unknown atom and obtain the position of the atom by using a least-squares approximation instead of an exact solution to the system of distance equations. We show that the least-squares approximation can be obtained by using a special singular value decomposition method, which not only tolerates and minimizes small distance errors, but also prevents the rounding errors from propagation effectively, especially when the distance data is sparse. We describe the least-squares formulations and their solution methods, and present the test results from applying the new algorithm for the determination of a set of protein structures with varying degrees of availability and accuracy of the distances. We show that the new development of the algorithm increases the modeling ability, and improves stability and robustness of the geometric buildup approach significantly from both theoretical and practical points of view.

[1]  Richard H. Byrd,et al.  A Stochastic/Perturbation Global Optimization Algorithm for Distance Geometry Problems , 1997, J. Glob. Optim..

[2]  Yinyu Ye,et al.  Semidefinite programming based algorithms for sensor network localization , 2006, TOSN.

[3]  P. Schleyer.  Encyclopedia of computational chemistry , 1998 .

[4]  Joachim M. Buhmann,et al.  Multidimensional Scaling by Deterministic Annealing , 1997, EMMCVPR.

[5]  Timothy F. Havel.  An evaluation of computational strategies for use in the determination of protein structure from distance constraints obtained by nuclear magnetic resonance. , 1991, Progress in biophysics and molecular biology.

[6]  Timothy F. Havel.  Distance Geometry: Theory, Algorithms, and Chemical Applications , 2002 .

[7]  Krishan Rana,et al.  An Optimization Approach , 2004 .

[8]  Andrea Grosso,et al.  Solving molecular distance geometry problems by global optimization algorithms , 2009, Comput. Optim. Appl..

[9]  Jorge J. Moré,et al.  Distance Geometry Optimization for Protein Structures , 1999, J. Glob. Optim..

[10]  W. Glunt,et al.  An alternating projection algorithm for computing the nearest euclidean distance matrix , 1990 .

[11]  Gordon M. Crippen,et al.  Distance Geometry and Molecular Conformation , 1988 .

[12]  Leonard M. Blumenthal,et al.  Theory and applications of distance geometry , 1954 .

[13]  Bruce Hendrickson,et al.  The Molecule Problem: Exploiting Structure in Global Optimization , 1995, SIAM J. Optim..

[14]  Panos M. Pardalos,et al.  Some Properties for the Euclidean Distance Matrix and Positive Semidefinite Matrix Completion Problems , 2003, J. Glob. Optim..

[15]  M J Sippl,et al.  Cayley-Menger coordinates. , 1986, Proceedings of the National Academy of Sciences of the United States of America.

[16]  Jorge J. Moré,et al.  E-optimal solutions to distance geometry problems via global continuation , 1995, Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding.

[17]  Robin K. Harris,et al.  Encyclopedia of nuclear magnetic resonance , 1996 .

[18]  Le Thi Hoai An,et al.  Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach , 2003, SIAM J. Optim..

[19]  Gene H. Golub,et al.  Matrix computations , 1983 .

[20]  Anthony J. Kearsley,et al.  The Solution of the Metric STRESS and SSTRESS Problems in Multidimensional Scaling Using Newton's Method , 1995 .

[21]  Bruce Hendrickson,et al.  Conditions for Unique Graph Realizations , 1992, SIAM J. Comput..

[22]  H. Scheraga,et al.  Solution of the embedding problem and decomposition of symmetric matrices. , 1985, Proceedings of the National Academy of Sciences of the United States of America.

[23]  Qunfeng Dong,et al.  A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances , 2002, J. Glob. Optim..

[24]  Sung-Hou Kim,et al.  A global representation of the protein fold space , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[25]  Di Wu,et al.  An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data , 2003, J. Glob. Optim..

[26]  Marcos Raydan,et al.  Molecular conformations from distance matrices , 1993, J. Comput. Chem..

[27]  Jorge J. Moré,et al.  Global Continuation for Distance Geometry Problems , 1995, SIAM J. Optim..