Skip to main content
Article thumbnail
Location of Repository

A Stable . . . Distance Geometry Problem Using Least-Squares Approximation

By Atilla Sit, Zhijun Wu and Yaxiang Yuan

Abstract

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 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 the distance errors, but also prevents the rounding errors from propagation effectively. 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 of the geometric buildup approach significantly from both theoretical and practical points of view. Key words Biomolecular modeling, protein structure determination, distance geometry, linear and nonlinear systems of equations, linear and nonlinear optimizatio

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.184.6480
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ima.umn.edu/preprin... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.