Analysis of data fusion methods in virtual screening: similarity and group fusion

In a recent companion paper we have related the operation of simple data fusion rules used in virtual screening to a multiple integral formalism. In this paper we extend these ideas to the analysis of data fusion methods applied to real data. We examine several cases of similarity fusion using different coefficients and different representations and consider the reasons for positive or negative results in terms of the similarity distributions. Results are obtained using the SUM-, MAX- MIN-, and CombMNZ-fusion rules. We also develop a customized fusion rule, which provides an estimate of the optimal possible result for fusing multiple searches of a specific database; this shows that similarity fusion can, in principle, achieve retrieval enhancements even if this is not achieved in practice with current fusion rules. The methods are extended to analyze the comparatively successful results of group fusion with multiple actives, and we provide a rationale for the observed superiority of the MAX-rule over the SUM-rule in this context.     

Comparison of topological, shape, and docking methods in virtual screening

Virtual screening benchmarking studies were carried out on 11 targets to evaluate the performance of three commonly used approaches: 2D ligand similarity (Daylight, TOPOSIM), 3D ligand similarity (SQW, ROCS), and protein structure-based docking (FLOG, FRED, Glide). Active and decoy compound sets were assembled from both the MDDR and the Merck compound databases. Averaged over multiple targets, ligand-based methods outperformed docking algorithms. This was true for 3D ligand-based methods only when chemical typing was included. Using mean enrichment factor as a performance metric, Glide appears to be the best docking method among the three with FRED a close second. Results for all virtual screening methods are database dependent and can vary greatly for particular targets.     

Effectiveness of graph-based and fingerprint-based similarity measures for virtual screening of 2D chemical structure databases

This paper reports an evaluation of both graph-based and fingerprint-based measures of structural similarity, when used for virtual screening of sets of 2D molecules drawn from the MDDR and ID Alert databases. The graph-based measures employ a new maximum common edge subgraph isomorphism algorithm, called RASCAL, with several similarity coefficients described previously for quantifying the similarity between pairs of graphs. The effectiveness of these graph-based searches is compared with that resulting from similarity searches using BCI, Daylight and Unity 2D fingerprints. Our results suggest that graph-based approaches provide an effective complement to existing fingerprint-based approaches to virtual screening.     

SHAFTS: a hybrid approach for 3D molecular similarity calculation. 1. Method and assessment of virtual screening

We developed a novel approach called SHAFTS (SHApe-FeaTure Similarity) for 3D molecular similarity calculation and ligand-based virtual screening. SHAFTS adopts a hybrid similarity metric combined with molecular shape and colored (labeled) chemistry groups annotated by pharmacophore features for 3D similarity calculation and ranking, which is designed to integrate the strength of pharmacophore matching and volumetric overlay approaches. A feature triplet hashing method is used for fast molecular alignment poses enumeration, and the optimal superposition between the target and the query molecules can be prioritized by calculating corresponding "hybrid similarities". SHAFTS is suitable for large-scale virtual screening with single or multiple bioactive compounds as the query "templates" regardless of whether corresponding experimentally determined conformations are available. Two public test sets (DUD and Jain's sets) including active and decoy molecules from a panel of useful drug targets were adopted to evaluate the virtual screening performance. SHAFTS outperformed several other widely used virtual screening methods in terms of enrichment of known active compounds as well as novel chemotypes, thereby indicating its robustness in hit compounds identification and potential of scaffold hopping in virtual screening.     

A pose prediction approach based on ligand 3D shape similarity

Molecular docking predicts the best pose of a ligand in the target protein binding site by sampling and scoring numerous conformations and orientations of the ligand. Failures in pose prediction are often due to either insufficient sampling or scoring function errors. To improve the accuracy of pose prediction by tackling the sampling problem, we have developed a method of pose prediction using shape similarity. It first places a ligand conformation of the highest 3D shape similarity with known crystal structure ligands into protein binding site and then refines the pose by repacking the side-chains and performing energy minimization with a Monte Carlo algorithm. We have assessed our method utilizing CSARdock 2012 and 2014 benchmark exercise datasets consisting of co-crystal structures from eight proteins. Our results revealed that ligand 3D shape similarity could substitute conformational and orientational sampling if at least one suitable co-crystal structure is available. Our method identified poses within 2 Å RMSD as the top-ranking pose for 85.7 % of the test cases. The median RMSD for our pose prediction method was found to be 0.81 Å and was better than methods performing extensive conformational and orientational sampling within target protein binding sites. Furthermore, our method was better than similar methods utilizing ligand 3D shape similarity for pose prediction.     

Similarity search profiling reveals effects of fingerprint scaling in virtual screening

Fingerprint scaling is a method to increase the performance of similarity search calculations. It is based on the detection of bit patterns in keyed fingerprints that are signatures of specific compound classes. Application of scaling factors to consensus bits that are mostly set on emphasizes signature bit patterns during similarity searching and has been shown to improve search results for different fingerprints. Similarity search profiling has recently been introduced as a method to analyze similarity search calculations. Profiles separately monitor correctly identified hits and other detected database compounds as a function of similarity threshold values and make it possible to estimate whether virtual screening calculations can be successful or to evaluate why they fail. This similarity search profile technique has been applied here to study fingerprint scaling in detail and better understand effects that are responsible for its performance. In particular, we have focused on the qualitative and quantitative analysis of similarity search profiles under scaling conditions. Therefore, we have carried out systematic similarity search calculations for 23 biological activity classes under scaling conditions over a wide range of scaling factors in a compound database containing approximately 1.3 million molecules and monitored these calculations in similarity search profiles. Analysis of these profiles confirmed increases in hit rates as a consequence of scaling and revealed that scaling influences similarity search calculations in different ways. Based on scaled similarity search profiles, compound sets could be divided into different categories. In a number of cases, increases in search performance under scaling conditions were due to a more significant relative increase in correctly identified hits than detected false-positives. This was also consistent with the finding that preferred similarity threshold values increased due to fingerprint scaling, which was well illustrated by similarity search profiling.     

Fast 3D shape screening of large chemical databases through alignment-recycling

Background  

Large chemical databases require fast, efficient, and simple ways of looking for similar structures. Although such tasks are now fairly well resolved for graph-based similarity queries, they remain an issue for 3D approaches, particularly for those based on 3D shape overlays. Inspired by a recent technique developed to compare molecular shapes, we designed a hybrid methodology, alignment-recycling, that enables efficient retrieval and alignment of structures with similar 3D shapes.     

Comprehensive comparison of ligand-based virtual screening tools against the DUD data set reveals limitations of current 3D methods

In recent years, many virtual screening (VS) tools have been developed that employ different molecular representations and have different speed and accuracy characteristics. In this paper, we compare ten popular ligand-based VS tools using the publicly available Directory of Useful Decoys (DUD) data set comprising over 100?000 compounds distributed across 40 protein targets. The DUD was developed initially to evaluate docking algorithms, but our results from an operational correlation analysis show that it is also well suited for comparing ligand-based VS tools. Although it is conventional wisdom that 3D molecular shape is an important determinant of biological activity, our results based on permutational significance tests of several commonly used VS metrics show that the 2D fingerprint-based methods generally give better VS performance than the 3D shape-based approaches for surprisingly many of the DUD targets. To help understand this finding, we have analyzed the nature of the scoring functions used and the composition of the DUD data set itself. We propose that to improve the VS performance of current 3D methods, it will be necessary to devise screening queries that can represent multiple possible conformations and which can exploit knowledge of known actives that span multiple scaffold families.     

Toward high throughput 3D virtual screening using spherical harmonic surface representations

Searching chemical databases for possible drug leads is often one of the main activities conducted during the early stages of a drug development project. This article shows that spherical harmonic molecular shape representations provide a powerful way to search and cluster small-molecule databases rapidly and accurately. Our clustering results show that chemically meaningful clusters may be obtained using only low order spherical harmonic expansions. Our database search results show that using low order spherical harmonic shape-based correlation techniques could provide a practical and efficient way to search very large 3D molecular databases, hence leading to a useful new approach for high throughput 3D virtual screening. The approach described is currently being extended to allow the rapid search and comparison of arbitrary combinations of molecular surface properties.     

New methods for ligand-based virtual screening: use of data fusion and machine learning to enhance the effectiveness of similarity searching

Similarity searching using a single bioactive reference structure is a well-established technique for accessing chemical structure databases. This paper describes two extensions of the basic approach. First, we discuss the use of group fusion to combine the results of similarity searches when multiple reference structures are available. We demonstrate that this technique is notably more effective than conventional similarity searching in scaffold-hopping searches for structurally diverse sets of active molecules; conversely, the technique will do little to improve the search performance if the actives are structurally homogeneous. Second, we make the assumption that the nearest neighbors resulting from a similarity search, using a single bioactive reference structure, are also active and use this assumption to implement approximate forms of group fusion, substructural analysis, and binary kernel discrimination. This approach, called turbo similarity searching, is notably more effective than conventional similarity searching.     

Comparison of ranking methods for virtual screening in lead-discovery programs

This paper discusses the use of several rank-based virtual screening methods for prioritizing compounds in lead-discovery programs, given a training set for which both structural and bioactivity data are available. Structures from the NCI AIDS data set and from the Syngenta corporate database were represented by two types of fragment bit-string and by sets of high-level molecular features. These representations were processed using binary kernel discrimination, similarity searching, substructural analysis, support vector machine, and trend vector analysis, with the effectiveness of the methods being judged by the extent to which active test set molecules were clustered toward the top of the resultant rankings. The binary kernel discrimination approach yielded consistently superior rankings and would appear to have considerable potential for chemical screening applications.     

Exploring ensembles of bioactive or virtual analogs of X-ray ligands for shape similarity searching

Shape similarity searching is a popular approach for ligand-based virtual screening on the basis of three-dimensional reference compounds. It is generally thought that well-defined experimentally determined binding modes of active reference compounds provide the best possible basis for shape searching. Herein, we show that experimental binding modes are not essential for successful shape similarity searching. Furthermore, we show that ensembles of analogs of X-ray ligands—in the absence of these ligands—further improve the search performance of single crystallographic reference compounds. This is even the case if ensembles of virtually generated analogs are used whose activity status is unknown. Taken together, the results of our study indicate that analog ensembles representing fuzzy reference states are effective starting points for shape similarity searching.