Abstract
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 build-up algorithm for solving protein structure by using only a sparse set of inter-atomic distances. Such a sparse set of distances can be obtained by combining NMR data with our knowledge on certain bond lengths and bond angles. It can also include confident estimations on some “missing” distances. Our algorithm utilizes a simple geometric relationship between coordinates and distances. The coordinates for each atom are calculated by using the coordinates of previously determined atoms and their distances. We have implemented the algorithm and tested it on several proteins. Our results showed that our algorithm successfully determined the protein structures with sparse sets of distances. Therefore, our algorithm reduces the need of estimating the “missing” distances and promises a more efficient approach to NMR structure modeling.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H., Shindyalov, I.N. and Bourne, P.E. (2000), The protein data bank, Nucleic Acids Res. 28: 235–242.
Blumenthal, L.M. (1953), Theory and Applications of Distance Geometry, Clarendon Press, Oxford.
Branden, C. and Tooze, J. (1991), Introduction to Protein Structure, Garland Publishing, Inc.
Crippen, G.M. and Havel, T.F. (1988), Distance Geometry and Molecular Conformation, John Wiley & Sons, New York.
Creighton, T.E. (1993), Proteins: Structures and Molecular Properties, W.H. Freeman and Company, New York.
Dong, Q. and Wu, Z. (2002), A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances, Journal of Global Optimization 22: 365–375.
Golub, G.H. and Van Loan, C.F. (1989), Matrix Computations, Johns Hopkins University Press.
Glunt, W., Hayden, T.L. and Raydan, M. (1993), Molecular conformations from distance matrices, J. Comput Chem 14: 114–120.
Le Grice, S.F.J., Naas, T., Wohlgensinger, B. and Schatz, O. (1991), Subunit-selective mutagenesis indicates minimal polymerase activity in heterodimer-associated p51 HIV-1 reverse transcriptase, EMBO J. 10: 3905–3911.
Havel, T.F. (1995), Distance Geometry. In: Encyclopedia of Nuclear Magnetic Resonance, Grant, D.M. and Harris, R.K. (eds.), John Wiley & Sons, pp. 1701–1710.
Hendrickson, B.A. (1991), The Molecular Problem: Determining Conformation from Pairwise Distances, Ph.D. thesis, Cornell University.
Huang, H., Liang, Z. and Pardalos, P.M. (2001), Some Properties on Euclidean Distance Matrix and Positive Semi-Definite Matrix Completion Problems, Department of Industrial and Systems Engineering, University of Florida, Gainsville, FL.
Moré, J. and Wu, Z. (1996), ∈-Optimal solutions to distance geometry problems via global continuation. In: Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding, Pardalos, P.M., Shalloway, D. and Xie, G. (eds.), American Mathematical Society, pp. 151–168.
Moré, J. and Wu, Z. (1997), Global continuation for distance geometry problems, SIAM Journal on Optimization 7: 814–836.
Moré, J. and Wu, Z. (1999), Distance geometry optimization for protein structures, Journal of Global Optimization 15: 219–234.
Sayle, R. and Milner-White, E. (1994), RasMol: biomolecular graphics for all, Trends Biochem. Sci. (TIBS) 20: 374.
Telesnitsky, A. and Goff, S.P. (1997), Reverse transcriptase and the generation of retroviral DNA. In: Retroviruses, Coffin, J., Hughes, S. and Varmus, H. (eds.), Cold Spring Harbor Laboratory Press.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dong, Q., Wu, Z. A Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance Data. Journal of Global Optimization 26, 321–333 (2003). https://doi.org/10.1023/A:1023221624213
Issue Date:
DOI: https://doi.org/10.1023/A:1023221624213