Random distance matrix

Choosing a random distance matrix from within these limits, and computing coordinates that are a certain best-fit to the distances, in a process itself called embedding. 

We can now proceed to the generation of conformations. First, random values are assigne to all the interatomic distances between the upper and lower bounds to give a trial distam matrix. This distance matrix is now subjected to a process called embedding, in which tl distance space representation of the conformation is converted to a set of atomic Cartesic coordinates by performing a series of matrix operations. We calculate the metric matrix, each of whose elements (i, j) is equal to the scalar product of the vectors from the orig to atoms i and j ... 

Suppose interatomic distances are now randomly assigned between the lower and uppi bounds to give the following distance matrix ... 

In the basic metric matrix implementation of the distance constraint technique [16] one starts by generating a distance bounds matrix. This is an A X y square matrix (N the number of atoms) in which the upper bounds occupy the upper diagonal and the lower bounds are placed in the lower diagonal. The matrix is Ailed by information based on the bond structure, experimental data, or a hypothesis. After smoothing the distance bounds matrix, a new distance matrix is generated by random selection of distances between the bounds. The distance matrix is converted back into a 3D confonnation after the distance matrix has been converted into a metric matrix and diagonalized. A new distance matrix... 

The second step concerns distance selection and metrization. Bound smoothing only reduces the possible intervals for interatomic distances from the original bounds. However, the embedding algorithm demands a specific distance for every atom pair in the molecule. These distances are chosen randomly within the interval, from either a uniform or an estimated distribution [48,49], to generate a trial distance matrix. Unifonn distance distributions seem to provide better sampling for very sparse data sets [48]. 

Note that although the bounds on the distances satisfy the triangle inequalities, particular choices of distances between these bounds will in general violate them. Therefore, if all distances are chosen within their bounds independently of each other (the method that is used in most applications of distance geometry for NMR strucmre determination), the final distance matrix will contain many violations of the triangle inequalities. The main consequence is a very limited sampling of the conformational space of the embedded structures for very sparse data sets [48,50,51] despite the intrinsic randomness of the tech-... 

The procedure of DG calculations can be subdivided in three separated steps [119-121]. At first, holonomic matrices (see below for explanahon) with pairwise distance upper and lower limits are generated from the topology of the molecule of interest. These limits can be further restrained by NOE-derived distance information which are obtained from NMR experiments. In a second step, random distances within the upper and lower limit are selected and are stored in a metric matrix. This operation is called metrization. Finally, all distances are converted into a complex geometry by mathematical operations. Hereby, the matrix-based distance space is projected into a Gartesian coordinate space (embedding). 

Since the starting structure and the initial atom pair was casually selected, distance matrix generation and random metrization should be performed several times in order to get an ensemble of metric matrices. 

Nonlinear mapping (NLM) as described by Sammon (1969) and others (Sharaf et al. 1986) has been popular in chemometrics. Aim of NLM is a two-(eventually a one- or three-) dimensional scatter plot with a point for each of the n objects preserving optimally the relative distances in the high-dimensional variable space. Starting point is a distance matrix for the m-dimensional space applying the Euclidean distance or any other monotonic distance measure this matrix contains the distances of all pairs of objects, due. A two-dimensional representation requires two map coordinates for each object in total 2n numbers have to be determined. The starting map coordinates can be chosen randomly or can be, for instance, PC A scores. The distances in the map are denoted by d t. A mapping error ( stress, loss function) NLm can be defined as... 

A corresponding inverse triangle inequality can be applied to each triplet to raise values in the lower bound matrix L. Now, a distance matrix D, usually referred to as the trial distance matrix, can be constructed by simply choosing elements dt/ randomly between w/ and lif and used to construct a metric matrix G. A matrix so constructed might be some approximation to the distances in the real molecule, but probably not a very good one. Clearly, every time an element d is selected, it puts limits on subsequent selected distances. This problem of correlated distances is discussed further in the section Systematic Errors and Bias. 

A restricted random walk matrix RRW was also proposed [Randic, 1995c] as an AxA dimensional square unsymmetric matrix that enumerates restricted (i.e. selected) random walks over a molecular graph (7. The i-j entry of the matrix is the probability of a random walk starting at vertex v, and ending at vertex v,- of length equal to the topological distance dij between the considered vertices ... 

Distances for each atom pair are randomly chosen between their lower and upper bounds. These distances are then converted into three-dimensional coordinates and refined against a simple error function made up of contributions from upper and lower bound violations and chiral constraint violations to ensure that the structure meets all distance and chiral constraints. The details of converting the distance matrix to three-dimensional coordinates are beyond the scope of this chapter but are provided in Crippen s text (126) and in an upcoming review article (133). 

Generation of a distance matrix by random selection of distances between the bounds. Optionally, smooth the distances (metrization). 

If we assume that the atoms have van der Waals radii of 0.25 A, then we can set all the other lower bounds to 0.5 (the default lower bound between any two atoms is the sum of their van der Waals radii). However, the remaining upper bounds (between atom pairs 1-3 and 2-4) are not known, so we shall enter a default value of 100. This completes the entries in the bounds matrix, and a distance matrix can be generated from it by choosing distances randomly between the corresponding upper and lower bounds and entering them in the appropriate places in D. 

Figure 5 (a) Bounds matrix (B) after triangle inequality bounds smoothing for square structure with bond lengths and van der Waals radii of 1.0 and 0.25 A, respectively distance matrix (D) after random seleaion of distances between bounds in... 

Distance geometry uses a four-stage process to derive a conformation of a molecule [Crippen 1981 Crippen and Havel 1988]. First, a matrix of upper and lower interatomic distance bounds is calculated. This matrix contains the maximum and minimum values periiutted to each interatomic distance in the molecule. Values are then randomly assigned to each interatomic distance between its upper and lower bounds. In the third step, the distance matrix is converted into a trial set of Cartesian coordinates, which in the fourth step are then refined. 

---