Towards a MIP-based alignment and docking in computer-aided drug design

Alignment-free prediction of a drug-target complex network based on parameters of drug connectivity and protein sequence of receptors

There are many drugs described with very different affinity to a large number of receptors. In this work, we selected drug-receptor pairs (DRPs) of affinity/nonaffinity drugs to similar/dissimilar receptors and we represented them as a large network, which may be used to identify drugs that can act on a receptor. Computational chemistry prediction of the biological activity based on quantitative structure-activity relationships (QSAR) substantially increases the potentialities of this kind of networks avoiding time- and resource-consuming experiments. Unfortunately, most QSAR models are unspecific or predict activity against only one receptor. To solve this problem, we developed here a multitarget QSAR (mt-QSAR) classification model. Overall model classification accuracy was 72.25% (1390/1924 compounds) in training, 72.28% (459/635) in cross-validation. Outputs of this mt-QSAR model were used as inputs to construct a network. The observed network has 1735 nodes (DRPs), 1754 edges or pairs of DRPs with similar drug-target affinity (sPDRPs), and low coverage density d = 0.12%. The predicted network has 1735 DRPs, 1857 sPDRPs, and also low coverage density d = 0.12%. After an edge-to-edge comparison (chi-square = 9420.3; p < 0.005), we have demonstrated that the predicted network is significantly similar to the one observed and both have a distribution closer to exponential than to normal.

BRUTUS: Optimization of a grid-based similarity function for rigid-body molecular superposition. II. Description and characterization

Finding novel lead molecules is one of the primary goals in early phases of drug discovery projects. However, structurally dissimilar compounds may exhibit similar biological activity, and finding new and structurally diverse lead compounds is difficult for computer algorithms. Molecular energy fields are appropriate for finding structurally novel molecules, but they are demanding to calculate and this limits their usefulness in virtual screening of large chemical databases. In our approach, energy fields are computed only once per superposition and a simple interpolation scheme is devised to allow coarse energy field lattices having fewer grid points to be used without any significant loss of accuracy. The resulting processing speed of about 0.25 s per conformation on a 2.4 GHz Intel Pentium processor allows the method to be used for virtual screening on commonly available desktop machines. Moreover, the results indicate that grid-based superposition methods could be efficiently used for the virtual screening of compound libraries.