Abstract
A fundamental problem in molecular biology is the determination of the conformation of macromolecules from NMR data. Several successful distance geometry programs have been developed for this purpose, for example DISGEO. A particularly difficult facet of these programs is the embedding problem, that is the problem of determining those conformations whose distances between atoms are nearest those measured by the NMR techniques. The embedding problem is the distance geometry equivalent of the multiple minima problem, which arises in energy minimization approaches to conformation determination. We show that the distance geometry approach has some nice geometry not associated with other methods that allows one to prove detailed results with regard to the location of local minima. We exploit this geometry to develop some algorithms which are faster and find more minima than the algorithms presently used.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature
Billeter, M., T. Havel and K. Wüthrich 1986. The ellipsoid algorithm as a method for the determination of polypeptide conformation from experimental distance constraints and energy minimization.J. comp. Chem. 8, 132–141.
Blumenthal, M. 1953.Theory and Applications of Distance Geometry. London: Oxford Press.
Braun, W. and N. Go. 1985. Calculation of protein conformations by proton-proton distance constraints: a new efficient algorithm.J. molec. Biol. 186, 611–626.
Browne, M. 1987. The Young-Householder algorithm and the least square multidimensional scaling of squared distance.J. Classification 4, 175–190.
Clore, G. M., M. Nilges, D. K. Sunkumaran, A. T. Brunger, M. Karplus and A. M. Gronenborn 1986. The three-dimensional structure of α1-purothionin in solution: combined use of nuclear magnetic resonance, distance geometry and restrained molecular dynamics.EMBO J. 2729–2735.
Crippen, G. and T. Havel 1988.Distance Geometry and Molecular Conformation New York: Wiley.
Crippen, G. and T. Havel. 1990. Global energy minimization by rotational energy embedding.J. Chem. Inf. Sci., accepted.
Critchley, F. 1988. On certain linear mappings between inner-product and squared-distance matrices.Linear Algebra Applic.105, 91–107.
Critchley, F. 1989. Multidimensional scaling theory: some basic sets. Submitted.
de Leeüw, J. and W. Heiser. 1980. Multidimensional scaling with restrictive on the configuration. InMultivariate Analysis V, P. Krishnaiah (ed.), Amsterdam: North Holland.
Dress, A. W. and T. F. Havel. 1987. Fundamentals of the distance geometry approach to the problems of molecular conformation. Antripolis, France: INRIA.
Dress, A. and T. Havel. 1988. Shortest path problems and molecular conformation.Discrete Appl. Math. 19, 129–144.
Dress, A. and T. Havel. 1989. Bound smoothing under chirality constraints.SIAM J. discrete Math., submitted.
Dykstra, R. 1983. An algorithm for restricted least squares regression.J. Am. Stat. Assoc. 78, 839–842.
Easthope, P. and T. Havel 1989. Computational experience with an algorithm for tetrangle inequality bound smoothing.Bull. math. Bio 51, 173–194.
Fletcher, R. 1985. Semi-definite matrix constraints in optimization.SIAM J. Control Optimization 23, 493–513.
Gaffke, N. and R. Mathar. 1989. A cyclic projection algorithm via duality.Metrika 36, 29–54.
Glunt, W., T. Hayden, S. Hong and J. Wells. 1990. An alternating projection algorithm for computing the nearest Euclidean distance matrix.SIAM J. Matrix Anal. Applic. 11, 589–600.
Gower, J. 1985. Properties of Euclidean and non-Euclidean distance matrices.Linear Algebra Applic. 67, 81–97.
Han, S., 1988. A successive projection method.Math. Prog. 40, 1–14.
Havel, T., I. Kuntz and G. Crippen. 1983. The theory and practice of distance geometry.Bull. math. Biol. 45, 665–720.
Havel, T. and K. Wüthrich. 1984. A distance geometry program for determining the structures of small proteins and other macromolecules from nuclear magnetic resonance measurements of intra-molecular H-1-H-1 proximities in solution.Bull. math. Biol. 46, 699–744.
Havel, T. and K. Wüthrich. 1985. An evaluation of the combined use of nuclear magnetic resonance and distance geometry for the determination of protein conformations in solutions.J. molec. Biol. 182, 281–294.
Havel, T., 1990. The sampling properties of some distance goemetry algorithms applied to unconstrained polypertide chains, a study of 1830 independently computed conformations.Biopolymers, submitted.
Hayden, T. and J. Wells. 1988. Approximation by matrices positive semidefinite on a subspace.Linear Algebra Applic. 109, 115–130.
Hayden, T., J. Wells, W. Liu and P. Tarazaga. 1989. The cone of distance matrices.Linear Algebra Applic., accepted.
Meulman, J. 1986.A Distance Approach to Nonlinear Multivariate Analysis. Leiden, The Netherlands: DSWO Press.
Oxender, D. and C. Fox. 1987.Protein Engineering. New York: Alan Liss Inc.
Scheraga, H. 1988. Approaches to the multiple-minima problem in conformational energy calculations on polypetides and proteins. InBiological and Artificial Intelligence Systems, E. Clementi and S. Chin (eds). ESCOM Science Publishers B.V.
Schiffman, S., S. Reynolds and F. Young. 1981.Introduction to Multidimensional Scaling. New York: Academic Press.
Schoenberg, I. 1935. Remarks to M. Frechet’s article, “Sur la definition axiomatique d’une classe d’espace distance vectoriellement applicable sur l’espace de Hilbert”.Ann. Math. 36, 724–732.
Takane, Y., F. Young and J. de Leeuw. 1977. Nonmetric individual differences multidimensional scaling: An alternating least squares method with optimal scaling features.Psychometrika 42, 7–67.
Tarazaga, P. 1989. A quadratic minimization problem on subsets of symmetric positive semidefinite matrices. Submitted.
von Neumann, J. 1950. The geometry of orthogonal spaces. InFunctional Operators, Vol. II, Ann. Math. Studies, No. 22. Princeton, NJ: Princeton University Press.
Wüthrich, K. 1989. Protein structure determination in solution by nuclear magnetic resonance spectroscopy.Science 243, 45–50.
Young, F. 1984. Scaling.A. Rev. Psychol. 35, 55–81.
Young, G. and A. Householder. 1983. Discussion of a set of points in terms of their mutual distances.Psychometrika 3, 19–22.
Author information
Authors and Affiliations
Additional information
The authors were partially supported by National Science Foundation Grant CHE-8802341.
Rights and permissions
About this article
Cite this article
Glunt, W., Hayden, T.L. & Liu, WM. The embedding problem for predistance matrices. Bltn Mathcal Biology 53, 769–796 (1991). https://doi.org/10.1007/BF02461553
Issue Date:
DOI: https://doi.org/10.1007/BF02461553