Antimicrobial peptides (AMPs) are a valuable source of antimicrobial agents and a potential solution to the multi-drug resistance problem. In particular, short-length AMPs have been shown to have enhanced antimicrobial activities, higher stability, and lower toxicity to human cells. We present a shortlength (%30 aa) AMP prediction method, Deep-AmPEP30, developed based on an optimal feature set of PseKRAAC reduced amino acids composition and convolutional neural network. On a balanced benchmark dataset of 188 samples, Deep-AmPEP30 yields an improved performance of 77% in accuracy, 85% in the area under the receiver operating characteristic curve (AUC-ROC), and 85% in area under the precisionrecall curve (AUC-PR) over existing machine learning-based methods. To demonstrate its power, we screened the genome sequence of Candida glabrata-a gut commensal fungus expected to interact with and/or inhibit other microbes in the gut-for potential AMPs and identified a peptide of 20 aa (P3, FWELWKFLKSLWSIFPRRRP) with strong anti-bacteria activity against Bacillus subtilis and Vibrio parahaemolyticus. The potency of the peptide is remarkably comparable to that of ampicillin. Therefore, Deep-AmPEP30 is a promising prediction tool to identify short-length AMPs from genomic sequences for drug discovery. Our method is available at https://cbbio.cis.um.edu.mo/AxPEP for both individual sequence prediction and genome screening for AMPs.

BackgroundProtein-ligand docking programs are routinely used in structure-based drug design to find the optimal binding pose of a ligand in the protein’s active site. These programs are also used to identify potential drug candidates by ranking large sets of compounds. As more accurate and efficient docking programs are always desirable, constant efforts focus on developing better docking algorithms or improving the scoring function. Recently, chaotic maps have emerged as a promising approach to improve the search behavior of optimization algorithms in terms of search diversity and convergence speed. However, their effectiveness on docking applications has not been explored. Herein, we integrated five popular chaotic maps—logistic, Singer, sinusoidal, tent, and Zaslavskii maps—into PSOVina, a recent variant of the popular AutoDock Vina program with enhanced global and local search capabilities, and evaluated their performances in ligand pose prediction and virtual screening using four docking benchmark datasets and two virtual screening datasets.ResultsPose prediction experiments indicate that chaos-embedded algorithms outperform AutoDock Vina and PSOVina in ligand pose RMSD, success rate, and run time. In virtual screening experiments, Singer map-embedded PSOVina achieved a very significant five- to sixfold speedup with comparable screening performances to AutoDock Vina in terms of area under the receiver operating characteristic curve and enrichment factor. Therefore, our results suggest that chaos-embedded PSOVina methods might be a better option than AutoDock Vina for docking and virtual screening tasks. The success of chaotic maps in protein-ligand docking reveals their potential for improving optimization algorithms in other search problems, such as protein structure prediction and folding. The Singer map-embedded PSOVina which is named PSOVina-2.0 and all testing datasets are publicly available on https://cbbio.cis.umac.mo/software/psovina.Electronic supplementary materialThe online version of this article (10.1186/s13321-018-0320-9) contains supplementary material, which is available to authorized users.

Protein-ligand docking programs are indispensable tools for predicting the binding pose of a ligand to the receptor protein. In this paper, we introduce an efficient flexible docking method, GWOVina, which is a variant of the Vina implementation using the grey wolf optimizer (GWO) and random walk for the global search, and the Dunbrack rotamer library for side-chain sampling. The new method was validated for rigid and flexible-receptor docking using four independent datasets. In rigid docking, GWOVina showed comparable docking performance to Vina in terms of ligand pose RMSD, success rate, and affinity prediction. In flexible-receptor docking, GWOVina has improved success rate compared to Vina and AutoDockFR. It ran 2 to 7 times faster than Vina and 40 to 100 times faster than AutoDockFR. Therefore, GWOVina can play a role in solving the complex flexible-receptor docking cases and is suitable for virtual screening of compound libraries. GWOVina is freely available at https:// cbbio.cis.um.edu.mo/softw are/gwovina for testing.

No abstract

Target prediction is a crucial step in modern drug discovery. However, existing experimental approaches to target prediction are time-consuming and costly. Here, we introduce LigTMap, an online server with a fully automated workflow that can identify protein targets of chemical compounds among 17 classes of therapeutic proteins extracted from the PDBbind database. It combines ligand similarity search with docking and binding similarity analysis to predict putative targets. In the validation experiment of 1251 compounds, targets were successfully predicted for more than 70% of the compounds within the top-10 list. The performance of LigTMap is comparable to the current best servers SwissTargetPrediction and SEA. When testing with our newly compiled compounds from recent literature, we get improved top 10 success rate (66% ours vs. 60% SwissTargetPrediction and 64% SEA) and similar top 1 success rate (45% ours vs. 51% SwissTargetPrediction and 41% SEA). LigTMap directly provides ligand docking structures in PDB format, so that the results are ready for further structural studies in computer-aided drug design and drug repurposing projects. The LigTMap web server is freely accessible at https://cbbio.online/LigTMap. The source code is released on GitHub (https://github.com/ShirleyWISiu/LigTMap) under the BSD 3-Clause License to encourage re-use and further developments.