virtual screening virtual screening virtual screening (vs) is a computational technique used in drug discovery to search libraries of small molecules in order to identify those structures which are most likely to bind to a drug target, typically a protein receptor or enzyme. figure 1. flow chart of virtual screening virtual screening has been defined as "automatically evaluating very large libraries of compounds" using computer programs. as this definition suggests, vs has largely been a numbers game focusing on how the enormous chemical space of over 1060 conceivable compounds can be filtered to a manageable number that can be synthesized, purchased, and tested. although searching the entire chemical universe may be a theoretically interesting problem, more practical vs scenarios focus on designing and optimizing targeted combinatorial libraries and enriching libraries of available compounds from in-house compound repositories or vendor offerings. as the accuracy of the method has increased, virtual screening has become an integral part of the drug discovery process. virtual screening can be used to select in house database compounds for screening, choose compounds that can be purchased externally, and to choose which compound should be synthesized next. methods there are two broad categories of screening techniques: ligand-based and structure-based. the remainder of this page will reflect figure 1 flow chart of virtual screening. ligand-based methods given a set of structurally diverse ligands that binds to a receptor, a model of the receptor can be built by exploiting the collective information contained in such set of ligands. different computational techniques explore the structural, electronic, molecular shape, and physicochemical similarities of different ligands that could imply their mode of action against a specific molecular receptor or cell lines. a candidate ligand can then be compared to the pharmacophore model to determine whether it is compatible with it and therefore likely to bind. different 2d chemical similarity analysis methods have been used to scan a databases to find active ligands. another popular approach used in ligand-based virtual screening consist on searching molecules with shape similar to that of known actives, as such molecules will fit the target's binding site and hence will be likely to bind the target. there are a number of prospective applications of this class of techniques in the literature. pharmacophoric extensions of these 3d methods are also freely-available as webservers. also shape based virtual screening has gained significant popularity. structure-based methods structure-based virtual screening approach includes different computational techniques that consider the structure of the receptor that is the molecular target of the investigated active ligands. some of these techniques include molecular docking, structure-based pharmacophore prediction, and molecular dynamics simulations. molecular docking is the most used structure-based technique, and it applies a scoring function to estimate the fitness of each ligand against the binding site of the macromolecular receptor, helping to choose the ligands with the most high affinity. currently, there are some webservers oriented to prospective virtual screening. hybrid methods hybrid methods that rely on structural and ligand similarity were also developed to overcome the limitations of traditional vls approaches. this methodologies utilizes evolution‐based ligand‐binding information to predict small-molecule binders and can employ both global structural similarity and pocket similarity. a global structural similarity based approach employs both an experimental structure or a predicted protein model to find structural similarity with proteins in the pdb holo‐template library. upon detecting significant structural similarity, 2d fingerprint based tanimoto coefficient metric is applied to screen for small-molecules that are similar to ligands extracted from selected holo pdb templates. the predictions from this method have been experimentally assessed and shows good enrichment in identifying active small molecules. the above specified method depends on global structural similarity and is not capable of a priori selecting a particular ligand‐binding site in the protein of interest. further, since the methods rely on 2d similarity assessment for ligands, they are not capable of recognizing stereochemical similarity of small-molecules that are substantially different but demonstrate geometric shape similarity. to address these concerns, a new pocket centric approach, poli, capable of targeting specific binding pockets in holo‐protein templates, was developed and experimentally assessed. computing infrastructure the computation of pair-wise interactions between atoms, which is a prerequisite for the operation of many virtual screening programs, scales by o ( n 2 ) )} , n is the number of atoms in the system. due to the quadratic scaling, the computational costs increase quickly. ligand-based approach ligand-based methods typically require a fraction of a second for a single structure comparison operation. sometimes a single cpu is enough to perform a large screening within hours. however, several comparisons can be made in parallel in order to expedite the processing of a large database of compounds. structure-based approach the size of the task requires a parallel computing infrastructure, such as a cluster of linux systems, running a batch queue processor to handle the work, such as sun grid engine or torque pbs. a means of handling the input from large compound libraries is needed. this requires a form of compound database that can be queried by the parallel cluster, delivering compounds in parallel to the various compute nodes. commercial database engines may be too ponderous, and a high speed indexing engine, such as berkeley db, may be a better choice. furthermore, it may not be efficient to run one comparison per job, because the ramp up time of the cluster nodes could easily outstrip the amount of useful work. to work around this, it is necessary to process batches of compounds in each cluster job, aggregating the results into some kind of log file. a secondary process, to mine the log files and extract high scoring candidates, can then be run after the whole experiment has been run. accuracy the aim of virtual screening is to identify molecules of novel chemical structure that bind to the macromolecular target of interest. thus, success of a virtual screen is defined in terms of finding interesting new scaffolds rather than the total number of hits. interpretations of virtual screening accuracy should, therefore, be considered with caution. low hit rates of interesting scaffolds are clearly preferable over high hit rates of already known scaffolds. most tests of virtual screening studies in the literature are retrospective. in these studies, the performance of a vs technique is measured by its ability to retrieve a small set of previously known molecules with affinity to the target of interest (active molecules or just actives) from a library containing a much higher proportion of assumed inactives or decoys. there are several distinct ways to select decoys by matching the properties of the corresponding active molecule and more recently decoys are also selected in a property-unmatched manner. the actual impact of decoy selection, either for training or testing purposes, has also been discussed. by contrast, in prospective applications of virtual screening, the resulting hits are subjected to experimental confirmation (e.g., ic50 measurements). there is consensus that retrospective benchmarks are not good predictors of prospective performance and consequently only prospective studies constitute conclusive proof of the suitability of a technique for a particular target. application to drug discovery virtual screening is a very useful application when it comes to identifying hit molecules as a beginning for medicinal chemistry. as the virtual screening approach begins to become a more vital and substantial technique within the medicinal chemistry industry the approach has had an expeditious increase. ligand-based methods while not knowing the structure trying to predict how the ligands will bind to the receptor. with the use of pharmacophore features each ligand identified donor, and acceptors. equating features are overlaid, however given it is unlikely there is a single correct solution. pharmacophore models this technique is used when merging the results of searches by using unlike reference compounds, same descriptors and coefficient, but different active compounds. this technique is beneficial because it is more efficient than just using a single reference structure along with the most accurate performance when it comes to diverse actives. pharmacophore is an ensemble of steric and electronic features that are needed to have an optimal supramolecular interaction or interactions with a biological target structure in order to precipitate its biological response. choose a representative as a set of actives, most methods will look for similar bindings. it is preferred to have multiple rigid molecules and the ligands should be diversified, in other words ensure to have different features that don't occur during the binding phase. shape-based virtual screening shape-based molecular similarity approaches have been established as important and popular virtual screening techniques. at present, the highly optimized screening platform rocs (rapid overlay of chemical structures) is considered the de facto industry standard for shape-based, ligand-centric virtual screening. it uses a gaussian function to define molecular volumes of small organic molecules. the selection of the query conformation is less important, rendering shape-based screening ideal for ligand-based modeling: as the availability of a bioactive conformation for the query is not the limiting factor for screening — it is more the selection of query compound(s) that is decisive for screening performance. field-based virtual screening as an improvement to shape-based similarity methods, field-based methods try to take into account all the fields that influence a ligand-receptor interaction while being agnostic of the chemical structure used as a query. examples of other fields that are used in these methods are electrostatic or hidrophobic fields. quantitative-structure activity relationship quantitative-structure activity relationship (qsar) models consist of predictive models based on information extracted from a set of known active and known inactive compounds. sar's (structure activity relationship) where data is treated qualitatively and can be used with structural classes and more than one binding mode. models prioritize compounds for lead discovery. machine learning algorithms machine learning algorithms have been widely used in virtual screening approaches. supervised learning techniques use a training and test datasets composed of known active and known inactive compounds. different ml algorithms have been applied with success in virtual screening strategies, such as recursive partitioning, support vector machines, k-nearest neighbors and neural networks. these models find the probability that a compound is active and then ranking each compound based on its probability. substructural analysis in machine learning the first machine learning model used on large datasets is the substructure analysis that was created in 1973. each fragment substructure make a continuous contribution an activity of specific type. substructure is a method that overcomes the difficulty of massive dimensionality when it comes to analyzing structures in drug design. an efficient substructure analysis is used for structures that have similarities to a multi-level building or tower. geometry is used for numbering boundary joints for a given structure in the onset and towards the climax. when the method of special static condensation and substitutions routines are developed this method is proved to be more productive than the previous substructure analysis models. recursive partitioning recursively partitioning is method that creates a decision tree using qualitative data. understanding the way rules break classes up with a low error of misclassification while repeating each step until no sensible splits can be found. however, recursive partitioning can have poor prediction ability potentially creating fine models at the same rate. structure-based methods known protein ligand docking ligand can bind into an active site within a protein by using a docking search algorithm, and scoring function in order to identify the most likely cause for an individual ligand while assigning a priority order.