Multidimensional scaling (MDS) is a collection of data analytic techniques for constructing conngurations of points from information about interpoint distances. Such constructions arise in computational chemistry when one endeavors to infer the conformation (3-dimensional structure) of a molecule from information about its interatomic distances. For a number of reasons, this application of MDS poses computational challenges not encountered in more traditional applications. In this report we sketch the mathematical formulation of MDS for molecular conformation problems and describe two approaches that can be employed for their solution. 1 Molecular Conformation Consider a molecule with n atoms. We can represent its conformation, or 3-dimensional structure, by specifying the coordinates of each atom with respect to a Euclidean coordinate system for < 3. We store these coordinates in an n3 connguration matrix X. Given X, we can easily compute the matrix of interatomic distances, D(X). In this report we consider the inverse problem of inferring a mathematically plausible conformation from information about D(X). The mathematical problem of inferring a plausible conformation from information about interatomic distances is one of many problems that arise in computational chemistry under the heading of structure determination. Although it is beyond the scope of this report to document the importance of determining the structure of various complex molecules, we can conndently assert that the ability to do so has profound practical implications. Thus, mathematical techniques that potentially enhance this ability are of considerable interest. It may seem curious that one might have information about the interatomic distances of a molecule whose con-formation is not known. Indeed, complete information will not be available; however, incomplete information may be obtained from various sources: 1. Atoms bond at distances and angles that are approximately xed by nature. Assuming, as will typically be the case, that the chemical structure of the molecule is known a priori, fairly stringent upper and lower bounds on these distances and angles will be available. Bounds on bond distances transparently translate into bounds on distances between atoms that are bonded together (\1-2 pairs"); combined with bounds on bond angles, it is an elementary exercise in trigonometry to derive bounds on distances between atoms that are bonded to a common atom (\1-3 pairs"). 2. Some component structures within the molecule may be known (or guessed, by scrutinizing data banks of known structures) to be approximately rigid. For example, benzyl rings are approximately planar hexagonal structures. Approximate rigidity …
[1]
M. Trosset.
A New Formulation of the Nonmetric Strain Problem in Multidimensional Scaling
,
1998
.
[2]
J. Kruskal.
Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
,
1964
.
[3]
W. Torgerson.
Multidimensional scaling: I. Theory and method
,
1952
.
[4]
R. Shepard.
The analysis of proximities: Multidimensional scaling with an unknown distance function. I.
,
1962
.
[5]
Marcos Raydan,et al.
Molecular conformations from distance matrices
,
1993,
J. Comput. Chem..
[6]
A. Householder,et al.
Discussion of a set of points in terms of their mutual distances
,
1938
.
[7]
J. Gower.
Some distance properties of latent root and vector methods used in multivariate analysis
,
1966
.
[8]
G. McCormick,et al.
The Gradient Projection Method under Mild Differentiability Conditions
,
1972
.
[9]
Claude Lemaréchal,et al.
Some numerical experiments with variable-storage quasi-Newton algorithms
,
1989,
Math. Program..
[10]
M. Trosset.
Computing Distances Between Convex Sets and Subsets of the Positive Semidefinite Matrices
,
1997
.
[11]
Jorge Nocedal,et al.
On the limited memory BFGS method for large scale optimization
,
1989,
Math. Program..
[12]
Anthony J. Kearsley,et al.
The Solution of the Metric STRESS and SSTRESS Problems in Multidimensional Scaling Using Newton's Method
,
1995
.
[13]
Thomas F. Coleman,et al.
An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
,
1993,
SIAM J. Optim..
[14]
Willem J. Heiser,et al.
13 Theory of multidimensional scaling
,
1982,
Classification, Pattern Recognition and Reduction of Dimensionality.
[15]
M. Trosset.
Numerical Algorithms for Multidimensional Scaling
,
1997
.
[16]
Jan de Leeuw,et al.
Block-relaxation Algorithms in Statistics
,
1994
.
[17]
I. J. Schoenberg.
Remarks to Maurice Frechet's Article ``Sur La Definition Axiomatique D'Une Classe D'Espace Distances Vectoriellement Applicable Sur L'Espace De Hilbert
,
1935
.
[18]
R. Shepard.
The analysis of proximities: Multidimensional scaling with an unknown distance function. II
,
1962
.
[19]
K. Mardia.
Some properties of clasical multi-dimesional scaling
,
1978
.
[20]
J. Kruskal.
Nonmetric multidimensional scaling: A numerical method
,
1964
.
[21]
F. A. Lootsma.
Distance Matrix Completion by Numerical Optimization
,
1997
.