# Surface similarity-based molecular query-retrieval

- Rahul Singh
^{1}Email author

**8(Suppl 1)**:S6

https://doi.org/10.1186/1471-2121-8-S1-S6

© Singh; licensee BioMed Central Ltd. 2007

**Published: **10 July 2007

## Abstract

### Background

Discerning the similarity between molecules is a challenging problem in drug discovery as well as in molecular biology. The importance of this problem is due to the fact that the biochemical characteristics of a molecule are closely related to its structure. Therefore molecular similarity is a key notion in investigations targeting exploration of molecular structural space, query-retrieval in molecular databases, and structure-activity modelling. Determining molecular similarity is related to the choice of molecular representation. Currently, representations with high descriptive power and physical relevance like 3D surface-based descriptors are available. Information from such representations is both surface-based and volumetric. However, most techniques for determining molecular similarity tend to focus on idealized 2D graph-based descriptors due to the complexity that accompanies reasoning with more elaborate representations.

### Results

This paper addresses the problem of determining similarity when molecules are described using complex surface-based representations. It proposes an intrinsic, spherical representation that systematically maps points on a molecular surface to points on a standard coordinate system (a sphere). Molecular surface properties such as shape, field strengths, and effects due to field super-positioningcan then be captured as distributions on the surface of the sphere. Surface-based molecular similarity is subsequently determined by computing the similarity of the surface-property distributions using a novel formulation of histogram-intersection. The similarity formulation is not only sensitive to the 3D distribution of the surface properties, but is also highly efficient to compute.

### Conclusion

The proposed method obviates the computationally expensive step of molecular pose-optimisation, can incorporate conformational variations, and facilitates highly efficient determination of similarity by directly comparing molecular surfaces and surface-based properties. Retrieval performance, applications in structure-activity modeling of complex biological properties, and comparisons with existing research and commercial methods demonstrate the validity and effectiveness of the approach.

## Background

Across all biological and pharmaceutical investigations, the discovery (or development) of molecules with desired biological activity is an important goal. Efforts to attain this goal are strongly driven by the notion of molecular similarity because in general similar molecules tend to behave similarly [1, 2]. Effective determination of molecular similarity requires accounting for both structural and physicochemical characteristics of molecules [3]. It is therefore closely related to the notions of molecular representation and molecular descriptors. We begin this section with a review of techniques for molecular representation and molecular descriptors. Next, we outline and discuss different formulations of the molecular query-retrieval problem. This is followed by a review of the prior research in this area. The last subsection introduces the problems associated with determining molecular similarity using complex 3D surface-based descriptors

### Introduction to molecular representations and descriptors

*SMILES*obtained by ordered traversal of the molecular graph, (2) vector-space representation of (typically structural) attributes of a molecule called

*structure keys*that encode presence/absence of predefined sub-structural motifs in the molecule in a binary string, (3) two-dimensional and three-dimensional graphscharacterizing molecular connectivity and inter-atomic distances, and (4) three-dimensional surface based representations, such as the Connolly surface. The Connolly surface is obtained by rolling a probe-atom over the molecule and is defined as the set of points where the surface of the probe atom touches the

*van der Walls*surfaces of the atoms in the molecule. It may be noted that the complexity of representations is directly correlated with their fidelity in describing biochemical characteristics of molecules. For example, simple characteristics of molecules such as their atomic weight or connectivity can be derived from SMILE strings. However, more complex biochemical properties like molecule-molecule interactions or permeation through membranes are more accurately modelled using surface-based representations [4–8].

Molecular descriptors are computationally determinable characteristics of a molecule that describe specific molecular properties. Examples include physical-chemical descriptors such as the number of rotatable bonds, polar surface area, electronegativity, descriptors of molecular connectivity such as the Wiener number [9], the Randic index [10], structure keys and molecular fingerprints, eigenvalue-based descriptors [11], molecular moment-based descriptors such as CoMMA [12], and surface and field-based descriptors [4]. Other descriptors include donor-acceptor atoms [13] and those based on the molecular wave/density functions [14]. Modern approaches to correlating molecular structure with biological activity emphasize the use of molecular *fields* (see for instance [15] and references therein); given any molecular property *P* that can be calculated at an arbitrary point around a molecule, a field can be created by integrating *P* with respect to volume. Field-based descriptors typically are superposition-based, in that their value at any particular point, takes into account the influence of multiple atoms of the molecule at that point. It is also straightforward to define field-based descriptors at the molecular surface, thereby incorporating both physicochemical and physically-relevant structural attributes in a single framework.

### Formulations for molecular query-retrieval and analysis of prior research

The problem of molecular query-retrieval can be approached from two primary and interrelated perspectives:

#### • Query formulation

Two main forms of formulating the query can be distinguished: (1) *Sub-structure-based query*, where the query-structure is constrained to be a proper subset of each of the retrieved structures. (2) *Whole-molecule query*, where molecules are retrieved in terms of their overall similarity, as defined using appropriate similarity functions, to the query molecule. It is important to note that sub-structure searching requires the user to have a clear picture of the structures which are to be retrieved prior to issuing the query [16]. Typically such detailed knowledge is available only when the mechanism of action of the molecule is established in terms of its activity as determined by specific structural fragments. In contrast, "whole molecule" similarity is suitable for exploring structural space [16], generating hypotheses, or querying chemical databases when detailed structure-activity information, at the level necessary for sub-structure querying is unavailable.

#### • Molecular representation

Molecular representations have varying capabilities in terms of modelling biochemical characteristics of molecules. As noted earlier, surface-based representations/descriptors are more faithful to the actual physics of molecules than molecular graphs-based approaches [4, 5, 7, 8, 17]. At the same time, graph-based representations, owing to their graphical similarity to chemical notations, tend to be highly intuitive and are also computationally easier to characterize.

Early attempts at determining molecular similarity, like [9, 10], used variations on the sum of inter-atomic distances. Later approaches have looked at schemes for atom re-labelling to minimize a difference-distance matrix or decomposing the molecular distance and connectivity graphs into sub-graphs which are numerically characterized and compared [18]. Other efforts have tried to characterize similarity of molecular graphs, using edit distances, frequent sub-graphs [19], or maximal common sub-graphs [20]. These techniques either focus on building structure-property models (and are inapplicable to query-retrieval formulations) or do not efficaciously scale up with repository size. With our research goals in mind, at the state-of-the-art, two classes of techniques merit discussion:

*1. Matching techniques using fixed-size representation vectors*: have been amongst the most efficient and are employed almost in all small molecule repositories of significant size. In this approach a molecule is represented using a fixed size vector. Each element of the vector encodes for the presence (or frequency) of a predefined attribute, for example, specific structural motifs [21] or the unique labelled paths obtained during a traversal [22]. The vectors are then compared using well established dissimilarity measures such as the Hamming, Euclidean, and Tanimoto measures.

*2. Matching techniques using 3D molecular graphs:* depend on super-positioning the 3D graphs of the molecules being compared. Significant research in this context has been done of aligning structures of large (protein) molecules leading to techniques such as DALI [23], SSM [24], SSAP [25], STRUCTAL [26], CE [27], LOCK [28], and LSQMAN [29]. Other efforts include the application of *geometric hashing* and its variations [8]. In [4, 7, 17], molecular similarity is defined using surface and field characteristics: First, the field-effects around a molecule are estimated. Then, the orientation of the query/model molecule (a 3D graph), is varied to minimize an RMS error between the field values.

The use of fixed-size representation vectors has lead to practical solutions for querying large molecular repositories. However, such approaches have several severe drawbacks: (1) They are limited to 2D information and incapable of being used for complex bio-chemically relevant representations/descriptors. (2) They are incapable of representing *bioisosteres* (structurally different molecules exhibiting the same biological effect). (3) Such representations are predefined rather than being data-driven. Therefore, they are incapable of capturing specificities of molecules which were not preconceived. On the other hand current approaches to 3D matching simply don't scale with respect to repository size and time constraints typical to modern query-retrieval formulations. Moreover, such approaches, even when they seek to compare surface-based descriptors, do so indirectly. That is, the 3D graphs are superimposed and only then are the respective surfaces compared. Such an approach can miss molecules which have similar surface/field-based properties, but whose 3D structures do not necessarily superimpose well.

### Problem characteristics and challenges

The problem of determining the similarity of molecules when they are represented using complex 3D surface-based descriptors presents some unique challenges which include:

1. *Definition of a standard coordinate system for surface-based molecular representations*: To compare molecules using their surface-based descriptions, it is necessary to have a way of representing the shape of their surfaces. The complexity lies in defining an intrinsic (view independent) coordinate system over the curved molecular surface that maps a point on the curved surface to a point on a standard coordinate system. Additionally, such a mapping should be one-to-one between points on the molecular surface and the standard coordinate system.

2. *Multi-modal nature of molecular properties*: Molecular properties like geometry and donor/acceptor fields have entirely different characteristics. For example, while the geometric representation of a molecule is unique, donor/acceptor fields are superposition-based. Representation frameworks need to account for such issues.

3. *Query efficiency*: It is typical to conduct molecular similarity queries over large sets ranging from thousands to millions of molecules. The latter order of magnitude is especially common in pharmaceutical settings. It is therefore imperative for similarity determination approaches to be computationally efficient.

## Results

Three different types of experiments were conducted to study the efficacy of the proposed method: (1) Investigation of the method's accuracy in query-retrieval settings, (2) Evaluation of its performance (speed), and (3) Validation through applications in structure-activity modelling problems. Each experiment incorporated two stages: The first stage involved a direct application of the method on a data set with subsequent analysis of the results. In the second stage, a comparative study was performed by applying a state-of-the-art research or commercial technique on the same data set. Subsequently the results were analysed to evaluate the proposed approach.

### Accuracy in query-retrieval settings

Summary of results from the query-retrieval experiment.

Method | Data Size | Number of Conformations | Accuracy |
---|---|---|---|

ISIS | 5000 | none | 100% |

Proposed | 5000 | 20/20 | 100% |

Proposed | 5000 | 20/20* | 98.2% |

### Performance evaluation

The computational performance of the proposed approach was tested with respect to the Molecular Hashkeys algorithm [4], which builds on the Compass algorithm [17, 30]. This selection was based on the fact that both the proposed approach and Molecular Hashkeys (along with its predecessor Compass) seek to define the surface-based similarity between molecules. The distinctions of our approach from these methods lie in how the modelling of molecular shape and field-effects are accomplished as well as in how the similarity is computed. Furthermore, our selection was also motivated by the fact that Compass along with its derivatives have been extensively applied in pharmaceutical research settings and the published results [4, 17, 30] as well as our own investigations show it to be amongst the most efficient approaches currently available for determining surface-based molecular similarity.

For a given molecular property and its corresponding property-histogram having *n* bins, computing the similarity of a pair of conformers using the proposed technique (see the Methods section) involves determining the histogram intersection scores for matching the spatial distribution of points corresponding to the each of the aforementioned *n* bins. For each bin, this score is then used to weight the intersection score of the property-histogram. For an encapsulating sphere of circumference *C*, characterizing the spatial distribution requires *O*(*C*) bins. Since histogram intersection is linear in the number of bins, the matching complexity is therefore *O(Cn)*.

Given the size of molecular repositories, a key technical problem is the design of indexing techniques. This is due to the fact that even highly efficient matching techniques, such as the one presented, require distance comparisons which grow linearly with the number of molecules in the database. Indexing techniques can be broadly classified as (1) *spatial access methods*, such as Quadtree [31], R-Tree [32], and KD-Tree [33], which are applicable when items in the repository are represented by a finite set of attributes or features and Euclidean distance between a pair of features/attributes can be defined. Such methods function by using the Euclidean structure of the embedding space to divide repository entities into clusters and avoiding the search of some clusters during retrieval. (2) *distance-based indexing methods*, such as GNAT-Tree [34] and VP-Tree [35], which rely only on pair-wise distances for data retrieval and employ the triangle-inequality for pruning the search space. While a detailed analysis of indexing techniques is beyond the scope of this paper, it is important to note that the performance of spatial access methods is very good for small number of attributes and rapidly degrades as the number of features increase. On the other hand, the efficiency of distance-based indexing is not good for large data collections. This underlines the necessity for developing indexing techniques, such as [36], which utilize specificities of structural data in the design of the indexing strategy.

### Validation through application in structure-activity models

A structure-property model captures the relationship between the bio-chemical properties of a molecule and its physicochemical description [37] by envisaging the biochemical property Φ of a molecule *M*_{
i
}as the function of its "chemical constitution":

Φ = *f*(*M*_{
i
}) (1)

The basic elements needed for the development of a structure-property model are: (1) Assay results describing the bio-chemical property of interest, (2) a set of parameters describing the molecular structure and its physicochemical attributes, and (3) the learning formulation along with a statistical or machine learning technique.

As part of the validation experiments, similarity information derived using the proposed technique was used to model absorption through an in-vitro cell line. The data set consisted of 30 compounds that were tested using the Caco-2 assay. The Caco-2 (human colon adenocarcinoma cell line) provides a close approximation of *in vivo* absorption and can be used to model the epithelial cell layer barrier and absorption from the intestinal lumen to the blood stream. The assay protocol used in this experiment was designed to measure uni-directional flux and all compounds were analysed at identical initial concentrations. The range of measured values was between 0.0% (no permeation) to 2.8% (maximum permeation) flux units. The set of parameters describing the molecular structure consisted of a 31-dimensional descriptor vector. The first element of this vector was the computed octanol-water partition coefficient (clogP). The remaining thirty elements of the vector were obtained by computing the similarity (using the proposed method) of the molecules tested in the assay to a predefined set of thirty molecules that represented a maximally diverse set of the MDDR collection. The central idea behind such form of molecular description relates to the concept of vector quantization [38] and implicit dimensionality reduction [4]. A backpropagation-based neural network with one hidden layer was then used to estimate the unknown continuous relationship between the molecules and Caco-2 permeation.

*r*

^{2}and shows how well the model predicts data that was

*not used*during model construction. This measure is defined as (Eq. (2)):

*V*

_{ i }is the experimentally determined property of the molecule

*M*

_{ i },

*P*

_{ i }is its predicted property, and $\overline{V}$ is the mean experimental property value. The second measure is an ordinal measure called Kendall's

*τ*, which shows how well the

*ordering*of the data is preserved during prediction by the model. This measure, computed for

*n*molecules, is defined as:

Kendall's *τ* is determined by considering all pairs of predicted absorption values and the corresponding actual absorption values (as determined experimentally). A pair of predicted values is deemed to be correctly ordered if the ordering coincides with that of the experimentally derived values. The numerator in Eq. 3 is the difference between the numbers of correctly and incorrectly ordered pairs. The denominator denotes the number of all possible pairs. Thus, if all pairs are correctly ordered, the maximum value of *τ* = 1 is obtained. On the other hand, the minimum value of *τ* = -1 is obtained if none of the pairs of predicted values retain the experimentally derived ordering. An ordinal measure, such as Kendall's *τ*, reflects how well the model can predict the ordering (or prioritisation) of the molecules. This provides an alternate way to assess the model as compared to measuring the numeric predictive accuracy. Therefore, using a combination of the above measures allows a multifaceted approach to model evaluation.

The assay values for twenty of the thirty compounds were made available for model construction and constituted the learning phase for the neural network. As part of the model construction step, the complete cross-correlation matrix of the descriptors was computed and the top eight least correlated descriptors used to learn the (empirical) mapping between the molecules and their permeability values. Learning was stopped when the cross-validated error became lower than a predefined threshold.

*r*

^{2}equalled 0.97 and the value for Kendall's

*τ*was 0.65. In Figure 3(b), results are shown for the identical problem setting, where the only exception was the use of the Molecular Hashkeys algorithm for computing the similarity of the molecules. For the best model learnt based on descriptors generated using Molecular Hashkeys, the value for cross-validated

*r*

^{2}equalled 0.64 and Kendall's

*τ*equalled 0.29. It should be emphasized that in both experiments an identical learning algorithm (single hidden layer neural network with back-propagation) was used and the only distinction was in the similarity values (due to the different algorithms used for determining them). We also note that the relatively low value for Kendall's

*τ*(as compared to the cross-validated

*r*

^{2}) occurred because the original data had compounds showing no absorption. The models that were derived typically assigned very low (albeit non-zero) absorption values to these molecules, thus leading to lower values for Kendall's

*τ*. The model based on similarity values derived using Molecular Hashkeys also exhibited ordering inconsistencies across the entire range of absorption values. Finally, Figure 3(c) shows the performance of the structure-activity model obtained using the proposed method, on the test set of 10 molecules. Here, the X-axis identifies each of the ten molecules in the test set, while the Y-axis corresponds to the permeation values.

In Figure 3(d) – (e), we present an analysis of the method's performance in a leave-n-out cross-validated setting. The goal of this experiment was to examine the robustness of the model under conditions where a significant number of samples get left out during the model construction stage. During each iteration of the experiment, 7 of the 20 molecules were randomly excluded. The remaining 13 molecules were then used for model construction and for predicting the absorption values of the 7 excluded molecules. The results are based on the performance of the model in 25 iterations of the leave-n-out experiment. The number of iterations is arbitrarily selected. To help visualize the results, the absorption values and predictions are grouped into three bins: Bin 1 corresponds to molecules exhibiting poor absorption (defined to be less than 0.5% flux units), Bin 2 corresponds to molecules that exhibited medium absorption (between 0.5% and 1.0% flux), and Bin 3 corresponds to molecules that showed high permeation (greater than 1.0% flux). The bar-chart in Figure 3(d) shows the number of incorrect bin assignments that were made: Over the 25 iterations, 85% of the overall bin assignments were correct and in 15% of the assignments, an error of one adjacent bin was observed (i.e. a compound with low absorption got assigned to the medium absorption bin or vice-versa, or a medium absorption compound was assigned to the high absorption bin). However, in none of the iterations, was a poorly absorbed compound predicted to be a highly absorbed one or a highly absorbed compound predicted to be a poorly absorbed one. Figure 3(e), presents the distribution of the prediction results across the 25 iterations of the leave-n-out cross-validation experiment: 11 of the 25 iterations resulted in perfect bin assignments and 7 of the 25 iterations had 83% correct bin assignments. Further, 6 of the iterations had 67% accurate assignments and only one of the 25 iterations had 50% accuracy in bin assignments. These statistics indicate the high consistency in the prediction performance of the model across variations in the training set.

## Conclusion

In this paper, we considered the problem of defining similarity between molecules based on complex surface-based representations. Such representations capture the physics of the molecules better than commonly used molecular-graph-based approaches and can therefore have significant relevance in molecular query-retrieval, similarity-based exploration of structural space, and structure-activity modelling. We have presented a novel approach for defining a standard coordinate system for describing complex surface-based molecular descriptions. For computing the similarity of molecules, we propose a novel formulation of histogram intersection which can take into account the distribution of surface properties in 3D space. Experimental results indicate that the similarity formulation can be used for highly-accurate query-retrieval and outperforms, in terms of computational speed, both existing research and commercially available solutions. The proposed approach was also validated by applying it in building structure-activity models for complex bio-chemical properties. The efficacy and computational efficiency of the proposed approach underline the important role it can play in querying and exploration of large molecular repositories.

## Methods

We begin this section by describing how the molecular surfaces are derived and how at each point of the surface, donor and acceptor fields are defined. Next, the concept of a standard coordinate system for describing molecular surfaces is introduced. In this subsection we discuss the Gauss map and its derivatives: the Extended Gaussian Image and the Spherical Attribute Image. We subsequently describe how a sphere encapsulating the molecule is deformed to map the molecular surface to a standard spherical coordinate system. In the final sub-section, the histogram-intersection based surface matching algorithm is described and illustrated using a simple example.

### Computing the molecular surface and surface properties

Starting from the atomic coordinates, the molecular surface (Connolly surface) is obtained by using the program MSRoll [39]. The geometric information provided by the molecular surface is complemented by calculating the donor field and acceptor field (due to H-bond donor and H-bond acceptor atoms) of the molecule at each surface point. The choice of these descriptors is due to their importance in various molecular interactions and their correlation with other surface-based properties such as polar surface area [40].

The measurement of the donor field is done using the following three step procedure:

#### Step 1

The Hydrogen-bond donor atoms in the molecule are identified. Typically these are Nitrogen or Oxygen atoms with hydrogen on them. Other ways of identification like the PATTY-rule [13] can also be used in this stage.

#### Step 2

_{j}due to an atom at position X

_{i}having van der Walls radii

*r*

_{ i }is defined as [7]:

In Eq. (4) *a* is a scale factor for the radii. The value of a = 2, for which 90% of the electron density lies inside the van-der walls radius of the atom, is used in all the experiments.

#### Step 3

At a given surface point P_{
j
}, first, the field strength for each donor atom is computed. The direction of each field is given by a unit vector obtained by joining the corresponding atom to P_{
j
}. The resultant donor field at P_{
j
}is subsequently defined as the vector sum of all donor field vectors at this point.

The acceptor field is analogously determined. Typically Nitrogen or Oxygen atoms with a lone pair of electrons are considered as acceptors.

### A standard coordinate system for surface-based molecular representations

A pre-requisite for comparing molecules described using surface-based representations is the capability to map points on the curved molecular surface to points on a standard coordinate system. Such a mapping was derived by Gauss [41], by using surface orientations to map points on an arbitrary curved surface to a standard coordinate system defined on a unit sphere. This mapping is formally referred to as the Gauss map and can be defined as follows:

#### Definition 1

*G*⊂

*R*

^{3}be an oriented surface in Euclidean space. Further, let

*S*be a unit sphere, called the Gaussian sphere. The Gauss map

*M*is the mapping

*M*:

*G*→

*S*, where the surface normal for each point on the surface

*G*is translated to the origin of the sphere

*S*and the end points of each normal lie on the surface of the Gaussian sphere

*S*(see Figure 4(a) for an illustration).

The *Extended Gaussian Image* (EGI), is a derivative of the Gauss Map and is obtained from it by assuming that the surface *G* is evenly sampled into patches and that each surface normal is associated with a single unit of mass which it votes to the corresponding point on the Gaussian sphere. The distribution of the mass on the surface of the Gaussian sphere, obtained in this fashion, depends on the shape of the underlying surface and constitutes the EGI. The EGI possesses certain important characteristics that include: (i) If two convex objects have the same EGI, they are provably congruent (the Minkowski theorem [42]), (ii) As an object rotates, its EGI rotates in the same manner, (iii) The EGI mass on the Gaussian sphere is inverse of the Gaussian curvature of the underlying object surface, and (iv) The centre of mass of the EGI lies at the origin of the Gaussian sphere.

The properties of the EGI, especially the Minkowski theorem provide the foundations for representing and comparing surface-based description of objects. However, an inherent problem of EGI-type mappings is their dependence on the Gauss map which is non-unique for non-convex shapes. Because of this, more than two points on an object surface may be mapped on the same point on the Gaussian sphere. Unfortunately, many molecules in their stable conformations induce surfaces that are non-convex and therefore the direct application of techniques from the EGI family is precluded for their representation and matching. To address this problem, we utilize the idea of the *Spherical Attribute Image* (SAI) [43], where a geodesic surface is iteratively defined to fit the underlying surface. We begin by placing the molecule inside a semi-regularly tessellated sphere (Figure 4(c)), which is obtained by subdivisions of the triangular sides of a 20-side icosahedron into sub-triangles. The placement of the molecule is done such that its centre of mass coincides with the centre of the sphere. The spherical surface is then modelled as a mechanical system and iteratively deformed to fit the molecular surface. The deformations are subject to a local regularity constraint [44] that ensures uniformity in measurement of the molecular surface and invariance to rotation of the molecule. The convergence of the deformations yield a fit of the deformable surface to the molecular surface and thus provide a one-to-one mapping between points on the molecular surface and points on the encapsulating sphere. The distance of a point on the sphere to its corresponding position on the molecular surface is then used to estimate the surface shape. Further, the donor and acceptor field values at a specific point on the molecular surface are mapped to its corresponding point on the sphere. At the conclusion of this step, each point on the sphere contains three values, characterizing respectively (1) the shape of the underlying surface, (2) the donor field strength, and (3) the acceptor field strength, of the underlying surface point.

### Comparing surface-based molecular representations

We seek to define the similarity of two molecules in terms of the similarity of their surface-property distributions, described using histograms. The technique of *histogram intersection* [45] can be used to rapidly compare the empirical similarity of these distributions. Given the data points corresponding to two distributions, the basic idea consists of quantizing the range of values in fixed size bins. Subsequently, the common number of data points across all the bins is determined and normalized by the size of the distribution. Histogram intersection is computationally efficient since its complexity is linear in the number of bins. Furthermore, the method is robust to noise and invariant to translation and rotation of the distributions being compared.

In the case of molecules, it is critical not just to account for the similarity of property distributions, but also the similarity of the spatial distribution of these properties on the molecular surface. Hence, a direct application of histogram intersection to compare the property distributions is by itself, insufficient. This issue is illustrated in Figure 4(c) where three distributions of four black and two grey squares are shown. Our goal is to devise a technique that can distinguish the first and second distributions (which are identical and related by a planar rotation), from the third. Clearly using the histogram of greyscale value of the squares is insufficient, since all the three distributions produce identical greyscale histograms. Intuitively, we would like two distributions to be considered similar when they have *both* similar distribution of values and are similarly distributed spatially.

Our approach uses the distribution of the pair-wise distances between points having similar property values to characterize the spatial distribution of the corresponding molecular property. Furthermore, we use histogram intersection to compute the similarity of the property distributions as well as the similarity of the spatial distributions. In addition to efficient computability and invariance to translations and rotations of the molecule, a significant advantage of this approach is its ability to characterize (and compare) the relative spatial distribution of surface properties, which act as pharmacophores. The main steps of the method are:

#### Step 1

For each specific property of the molecule, such as shape, donor field, or acceptor field, the property values across all the points on the surface of the tessellated sphere are determined. The range of values is then uniformly divided into a predefined number *N* of bins (we use *N* = 100 in all our experiments). Next, the frequency of points lying in each bin is computed. This defines the histogram of the corresponding property distribution. We term such histograms as property-histograms. In general, let P_{1}...P_{
K
}denote the *K* properties being used to characterize a molecule. In the following, we shall denote by H_{
L
}, the property-histogram corresponding to the property *P*_{
L
}, *L* ∈ [1,..., *K*]. For each property-bin *m* of H_{
L
}steps 2–4 are repeated.

#### Step 2

The points contained in property-bin *m* are clustered in terms of their adjacency on the surface of the encapsulating sphere and the centroid of each cluster is determined.

#### Step 3

The geodesic distance between all pairs of centroids is computed. We note that Steps 2–3 constitute a computationally cheaper alternative to computing the distances between all pairs of points in property-bin *m*.

#### Step 4

These distances are quantized in distance-bins which are defined in increments of one Angstrom in the range [0, *C*/2], where *C* denotes the circumference of the encapsulating sphere (measured in Angstroms). Next, the frequency in each distance-bin is computed to come up with the distance-histogram. Thus, there is a distance-histogram corresponding to every bin *m* of a property-histogram H_{
L
}. The content of a distance-bin denotes the number of points on the surface of the sphere that lie within a specific distance (equal to the range of the distance-bin) of each other and have values for the property P_{
L
}that fall within the range of property-bin *m* in H_{
L
}.

#### Step 5

*M*

_{1}and

*M*

_{2}, a property P

_{ L }along with the corresponding property histograms ${H}_{L}^{1}$ and ${H}_{L}^{2}$, and a bin

*m*of the property-histograms. Let ${D}_{m}^{{1}_{L}}$ and ${D}_{m}^{{2}_{L}}$ denote the distance-histograms of property-bin

*m*for molecules

*M*

_{1}and

*M*

_{2}respectively. The similarity

*γ*

_{ m }, of the spatial distribution of points lying in property-bin

*m*, for

*M*

_{1}and

*M*

_{2}is defined as the histogram intersection of ${D}_{m}^{{1}_{L}}$ and ${D}_{m}^{{2}_{L}}$:

*j*):

#### Step 6

*M*

_{1}and

*M*

_{2}, in context of the property P

_{ L }is denoted by

*Sim*

_{ L }(

*M*

_{1},

*M*

_{2}) and is defined as the histogram intersection of the corresponding property-histograms ${H}_{L}^{1}$ and ${H}_{L}^{2}$, where the intersection score for each property-bin

*m*is weighted by

*γ*

_{ m }. Formally:

_{ L }by the variable

*m*), the intersection of the property-histograms of two arbitrary molecules

*M*

_{ a }and

*M*

_{ b }is defined as:

#### Step 7

The similarity between two molecules *M*_{1} and *M*_{2} given *K* properties P_{1}...P_{
K
}is defined as the average similarity computed over all the *K* properties and is denoted as *Sim*_{
full
}(*M*_{1}, *M*_{2}).

#### Step 8

*Sim*

_{ full }(

*M*

_{1},

*M*

_{2}) over the set of conformations each of the molecules can attain (see Eq. (9)). The conformations can be generated using a package such as CONCORD [46].

Where *C*_{
i
}and *C*_{
j
}denote specific conformers of the molecules *M*_{1} and *M*_{2} respectively. Further, the sets ${C}_{1}=\{{C}_{1}^{1},{C}_{1}^{2},\mathrm{...},{C}_{1}^{r}\}\phantom{\rule{0.5em}{0ex}}and\phantom{\rule{0.5em}{0ex}}{C}_{2}=\{{C}_{2}^{1},{C}_{2}^{2},\mathrm{...},{C}_{2}^{r}\}$ respectively denote all the conformations attainable by the molecules *M*_{1} and *M*_{2}.

### Illustrative example

We use the point distributions shown in Figure 4(c) to illustrate, in a highly simplified setting, the working of the method. To facilitate the example, we assume that the coordinates of the squares in the left distribution are: X1(0, 0); X2(0, 2); X3(1, 2); X4(1, 0); Y1(0, 1); and Y2(1, 1). Similarly, the coordinates of the squares in the right distribution are: X1(0, 0); X2(0, 1); X3(1, 2); X4(1, 1); Y1(0, 2); and Y2(1, 0). We also note that the middle distribution is identical to the left one and related to it by a rotation. Let *L*, the property of interest be the grey-scale values of the squares. We shall assume that all the dark-coloured squares have a greyscale value of 0, while all the light-coloured squares have a greyscale value of 200. For the sake of simplicity, we also assume that the number of bins *N* equals 2. The property histograms for the three distributions computed in Step-1 are: ${H}_{L}^{1}={H}_{L}^{2}={H}_{L}^{3}=[\u30084\u3009\phantom{\rule{0.5em}{0ex}}\u30082\u3009]$. For Steps 2–3 which are repeated for each property-bin of each property-histogram, we simplify by computing all the pair-wise distances between the squares. In Step-4, we find that for each of the three distributions, the smallest (largest) pair-wise distances are: 1 (2.23). Constructing bins of unit size across this range, we obtain the following distance-histograms: ${D}_{1}^{{1}_{L}}={D}_{1}^{{2}_{L}}=[\u30082\u3009\phantom{\rule{0.5em}{0ex}}\u3008\text{4}\u3009\text{],}{D}_{2}^{{1}_{L}}={D}_{2}^{{2}_{L}}=\text{[}\u3008\text{1}\u3009\phantom{\rule{0.5em}{0ex}}\u3008\text{0}\u3009\text{],}{D}_{1}^{{3}_{L}}=\phantom{\rule{0.5em}{0ex}}[\u30085\u3009\phantom{\rule{0.5em}{0ex}}\u3008\text{1}\u3009\text{],}{D}_{2}^{{3}_{L}}=\text{[}\u3008\text{0}\u3009\phantom{\rule{0.5em}{0ex}}\u3008\text{1}\u3009\text{]}$. In Step-5, consequently, the similarity scores *γ*_{
m
}of the spatial distribution of points lying in each of the bins of ${H}_{L}^{1}$ and ${H}_{L}^{3}$ are: *γ*_{1} = 0.5; *γ*_{2} = 0. In Step-6, the similarity of the first and third distributions is therefore: *Sim*_{
L
}(*M*_{1}, *M*_{3}) = (4 × 0.5 + 2 × 0)/6 = 0.33. The reader may trivially verify that *Sim*_{
L
}(*M*_{1}, *M*_{3}) = 1.0.

## Declarations

### Acknowledgements

The author thanks the anonymous reviewer(s) for their comments. These have lead to significant improvements in the presentation of the material. This research was partially funded by the National Science Foundation grant IIS-0644418.

This article has been published as part of *BMC Cell Biology* Volume 8 Supplement 1, 2007: 2006 International Workshop on Multiscale Biological Imaging, Data Mining and Informatics. The full contents of the supplement are available online at http://www.biomedcentral.com/1471-2121/8?issue=S1

## Authors’ Affiliations

## References

- Bohm H-J, Schneider G: Virtual Screening for Bio-Active Molecules: Methods and Principles in Medicinal Chemistry. 2000, Wiley-VCHView ArticleGoogle Scholar
- Cramer R, Poss MA, Hermsmeier MA, Caulfield TJ, Kowala MC, Vlentine MT: Prospective Identification of Biologically Active Structures by Topomer Shape Similarity Searching. J Med Chem. 1999, 42: 3919-3933. 10.1021/jm990159q.View ArticlePubMedGoogle Scholar
- Kinoshita K, Nakamura H: Identification of protein biochemical functions by similarity search using the molecular surface database eF-site. Protein Science. 2003, 12: 1589-1595. 10.1110/ps.0368703.PubMed CentralView ArticlePubMedGoogle Scholar
- Ghuloum A, Sage C, Jain A: Molecular Hashkeys: A Novel Method for Molecular Characterization and its Application for Predicting Important Pharmaceutical Properties of Molecules. J Med Chem. 1999, 42 (10): 1739-1748. 10.1021/jm980527a.View ArticlePubMedGoogle Scholar
- Guba W, Cruciani G: Molecular Field-Derived Descriptors For The Multivariate Modeling of Pharmacokinetic Data. Molecular Modeling and Prediction of Bioactivity. Edited by: Gundertofte K, Jorgensen F. 2000, Kluwer Academic/Plenum Publishers, New York, 89-94.View ArticleGoogle Scholar
- Kubinyi H, Folkers G, Martin Y: 3D QSAR in Drug Design. 1998, KluwerGoogle Scholar
- Labute P, Williams C: Flexible Alignment of Small Molecules. J Med Chem. 2001, 44 (10): 1483-1490. 10.1021/jm0002634.View ArticlePubMedGoogle Scholar
- Norel R, Fischer D, Wolfson H, Nussinov R: Molecular Surface-Recognition by a Computer Vision-Based Technique. Protein Engineering. 1994, 7 (1): 39-46. 10.1093/protein/7.1.39.View ArticlePubMedGoogle Scholar
- Wiener H: Structural determination of Paraffin Boiling Points. J of Am Chem Soc. 1947, 69: 17-20. 10.1021/ja01193a005.View ArticleGoogle Scholar
- Randic M: On Characterization of Molecular Branching. J Am Chem Soc. 1975, 97: 6609-6615. 10.1021/ja00856a001.View ArticleGoogle Scholar
- Pearlman RS, Smith KM: Metric validation and the receptor-relevant subspace concept. J Chem Inf Comput Sci. 1999, 39: 28-35. 10.1021/ci980137x.View ArticleGoogle Scholar
- Silverman BD, Platt DE: Comparative molecular moment analysis (CoMMA): 3D-QSAR without molecular superposition. J Med Chem. 1996, 39: 2129-2140. 10.1021/jm950589q.View ArticlePubMedGoogle Scholar
- Bush B, Sheridan R: PATTY: A programmable Atom Typer and Languagefor Automatic Classification of Atoms in a Molecular Database. J Chem Inf Comp Sci. 1993, 33: 756-762. 10.1021/ci00015a015.View ArticleGoogle Scholar
- Nikolova N, Jaworska J: Approaches to measure chemical similarity – a review. QSAR Comb Sci. 2003, 22: 1006-1026. 10.1002/qsar.200330831.View ArticleGoogle Scholar
- Carbo-Dorca R, Girones X, Mezey PG: Fundamentals of Molecular Similarity. 2001, Kluwer Academic/PlenumView ArticleGoogle Scholar
- Barnard J, Downs G, Willett P: Descriptor-Based Similarity Measures for Screening Chemical Databases. Virtual Screening for Bio-Active Molecules, Methods and Principles in Medicinal Chemistry. Edited by: Bohm H-J, Schneider G. 2000, Wiley-VCH, 10: 59-80.Google Scholar
- Jain A, Koile K, Chapman D: Compass: Predicting Biological Activity from Molecular Surface Properties. Performance Comparison on a Steroid Benchmark. J Med Chem. 1994, 37: 2315-2327. 10.1021/jm00041a010.View ArticlePubMedGoogle Scholar
- Bemis G, Kuntz I: A fast and efficient method for 2D and 3D molecular shape description. J of Comp -Aided Mol Design. 1992, 6: 607-628. 10.1007/BF00126218.View ArticleGoogle Scholar
- Deshpande M, Kuramochi M, Wale N, Karypis G: Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds. IEEE Trans Knowl Data Eng. 2005, 17 (8): 1036-1050. 10.1109/TKDE.2005.127.View ArticleGoogle Scholar
- Raymond J, Gardiner E, Willett P: RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs. The Computer Journal. 2002, 46 (6): 631-644. 10.1093/comjnl/45.6.631.View ArticleGoogle Scholar
- [http://www.mdli.com]
- Chen J, Swamidass SJ, Dou Y, Bruamd J, Baldi P: ChemDB: A Public Database of Small Molecules and Related Chemoinformatics Resources. Bioinformatics. 2005, 21: 4133-4139. 10.1093/bioinformatics/bti683.View ArticlePubMedGoogle Scholar
- Holm L, Sander C: Dali: A network tool for protein structure comparison. Trends Biochem Sci. 1995, 20: 478-480. 10.1016/S0968-0004(00)89105-7.View ArticlePubMedGoogle Scholar
- Krissinel E, Henrick K: Secondary Structure Matching (SSM), a new tool for fast protein alignment in three dimensions. Acta crystallogr D Biol Crystallogr. 2004, 60: 2256-2268. 10.1107/S0907444904026460.View ArticlePubMedGoogle Scholar
- Orengo CA, Taylor WR: Protein Structure Alignment. J Theorl Biol. 1990, 147: 517-551. 10.1016/S0022-5193(05)80263-2.View ArticleGoogle Scholar
- Gerstein M, Levitt M: Comprehensive assessment of automatic structural alignment against a manual standard, the Scop classification of proteins. Protein Sci. 1998, 7 (2): 445-456.PubMed CentralView ArticlePubMedGoogle Scholar
- Shindyalov IN, Bourne PE: Protein structure alignment by incremental combinatorial extension (CE) of the optimal path. Protein Eng. 1998, 11: 739-747. 10.1093/protein/11.9.739.View ArticlePubMedGoogle Scholar
- Singh A, Brutlag D: Hierarchical protein structure superposition using both secondary structure and atomic representations. Proc 5th Intr Conf on Intell Syst for Mol Biol (ISMB). 1997, 284-293.Google Scholar
- Kleywegt GJ: Use of non-crystallographic symmetry in protein structure refinement. Acta Crystallogr D Biol Crystallogr. 1996, 52: 842-857. 10.1107/S0907444995016477.View ArticlePubMedGoogle Scholar
- Jain A, Dietterich T, Lathrop R, Chapman D, Critchlow R, Bauer B, Webster T, Lozano-Perez T: Compass: A Shape-Based Machine Learning Tool for Drug Design. Journal of Computer Aided Molecular Design. 1994, 8: 635-652. 10.1007/BF00124012.View ArticlePubMedGoogle Scholar
- Samet H: The Quadtree and Related Hierarchical Data Structures. ACM Computing Surveys. 1984, 16 (2): 187-260. 10.1145/356924.356930.View ArticleGoogle Scholar
- Guttman A: R-tree: A Dynamic Index Structure for Spatial Searching. ACM SIGMOD. 1984, 47-57. 10.1145/971697.602266.Google Scholar
- Bently J, Friedman J: Data Structures for Range Searching. ACM Computing Surveys. 1979, 11 (4): 397-409. 10.1145/356789.356797.View ArticleGoogle Scholar
- Brin S: Nearest Neighbor Search in Large Metric Spaces. VLDB. 1995, 574-584.Google Scholar
- Yanilos P: Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces. SODA. 1993, 311-321.Google Scholar
- Camoglu O, Kahveci T, Singh A: Index-based Similarity Search for Protein Structure Databases. J Bioinform Comput Biol. 2004, 2 (1): 99-126. 10.1142/S0219720004000491.View ArticlePubMedGoogle Scholar
- Livingstone DJ: The Characterization of Chemical Structures Using Molecular Properties. A Survey. J Chem Inf Comput Sci. 2000, 40: 195-209. 10.1021/ci990162i.View ArticlePubMedGoogle Scholar
- Cherkassky VF, Mulier F: Learning From Data. 1998, Wiley Inter-ScienceGoogle Scholar
- Connolly ML: The Molecular Surface Package. J Mol Graph. 1993, 11 (2): 139-141. 10.1016/0263-7855(93)87010-3.View ArticlePubMedGoogle Scholar
- Veber D, Johnson S, Cheng H-Y, Smith B, Ward K, Kopple K: Molecular Properties that Influence the Oral Bioavailability of Drug Candidates. J Med Chem. 2002, 45: 2615-2623. 10.1021/jm020017n.View ArticlePubMedGoogle Scholar
- Gauss KF: General Investigation of Curved Surfaces. 1965, Raven Press, New YorkGoogle Scholar
- Lysternik LA: Convex Figures and Polyhedra. 1963, Dover Publications, New YorkGoogle Scholar
- Hebert M, Ikeuchi K, Delingette H: A Spherical Representation for Recognition of Free-Form Surfaces. IEEE Trans on Pattern Analysis and Machine Intelligence. 1995, 17 (7): 681-689. 10.1109/34.391410.View ArticleGoogle Scholar
- Singh R: Reasoning About Molecular Similarity and Properties. Proc IEEE Comput Syst Bioinform Conf. 2004, 266-277.Google Scholar
- Swain M, Ballard D: Color Indexing. Int J of Comp Vision. 1991, 7 (1): 11-32. 10.1007/BF00130487.View ArticleGoogle Scholar
- [http://www.tripos.com]

## Copyright

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.