Difference distance matrix

Similar Substructures Least-Squares and Chebyshev Fitting and the Difference Distance Matrix. 

In our previous analysis, correlation coefficients were used between the fold distributions in different genomes to construct a distance matrix and a corresponding cluster dendogram (Wolf et al., 1999). This clustering showed significant differences in the fold composition between eukaryotes and prokaryotes (bacteria and archaea) as well as between free-living and parasitic bacteria. 

Fig. 3.2 Schematic of the CATS descriptor calculation, (a) The hydrogen-depleted two-dimensional molecular graph provides the input, (b) The graph is simplified for the distance matrix computation different bond orders are not considered (unweighted graph) and all element types are disregarded. The algorithm starts at an arbitrary chosen atom and visits all nodes of the graph in a breadth-first manner, thereby building up the distance matrix. The numbers at the vertices are used to reference individual atoms in the distance matrix.

Fig. 4. Phylogenetic tree of Basidiomycota based on the primary structure of the 18S rRNA gene. Alignment, distance matrix and calculation of phylogenetic distances were made by means of different programs as described in the legend of figure 1. Hmnan pathogenic genera are indicated by arrows. T = Teleomorphic species A = anamorphic species Y = yeasts or yeast stages.

An alternative approach uses the distance geometry paradigm, in which all the constraints are combined to form the distance matrix from which energetically feasible conformations of the set of molecules are sought mathematically. Sheridan et al. (439) demonstrated this approach on acetylcholine analogs that are muscarinic agonists. Both of these approaches ask the same question and suffer from the same limitations, and differ only in computational technique. Each suffers from the local minima problem, in that each uses a... 

Table 2. UV curing in film matrix of the HDDA/BA equimolar mixture, under nitrogen, by polymeric systems bearing the benzophenone (BP) moiety at different distance from the backbone as compared with low-molecular-weight analogues [20-22]...

We may also adopt a different procedure in which the adaptive distances are computed at each iteration in the GFNM algorithm. At the first iteration the diameters are all equal 5, = 1, / = 1,2,..., n. The diameter of the fuzzy class A, obtained at iteration k induces an adaptive distance. The adaptive distances are used to compute the fuzzy classes at iteration k + For a relatively large data set the computation of diameters may involve the storage of a large distance matrix. We may avoid the computational difficulties in such cases by using a simpler adaptive distance. We have supposed the classes are approximately spherical (or ellipsoidal). The mean of a fuzzy class may thus be considered as an approximation of the geometric center of the class. On this basis we may define the radius r, of the fuzzy class A, as... 

---