Attributed community search based on effective scoring function and elastic greedy method

2021 ◽  
Vol 562 ◽  
pp. 78-93
Author(s):  
Chunnan Wang ◽  
Hongzhi Wang ◽  
Hanxiao Chen ◽  
Daxin Li
Keyword(s):  
Scoring Function ◽  
Greedy Method ◽  
Community Search

Permeability Through Bacterial Porins Dictates Whole Cell Compound Accumulation

2020 ◽  
Author(s):  
Silvia Acosta Gutiérrez ◽  
Igor Bodrenko ◽  
Matteo Ceccarelli
Keyword(s):  
Cell Envelope ◽  
Scoring Function ◽  
Modern Medicine ◽  
New Drugs ◽  
Prediction Ability ◽  
Whole Cell ◽  
Virtual Libraries ◽  
Major Bottleneck ◽  
Global Threat ◽  
Bacterial Porins

The lack of new drugs for Gram-negative pathogens is a global threat to modern medicine. The complexity of their cell envelope, with an additional outer membrane, hinders internal accumulation and thus, the access of molecules to targets. Our limited understanding of the molecular basis for compound influx and efflux from these pathogens is a major bottleneck for the discovery of effective antibacterial compounds. Here we analyse the correlation between the whole-cell compound accumulation of ~200 molecules and their predicted porin permeability coefficient (influx), using a recently developed scoring function. We found a strong linear relationship (75%) between the two, confirming porins key role in compound penetration. Further, the remarkable prediction ability of the scoring function demonstrates its potentiality to guide the optimization of hits to leads as well as the possibility of screening ultra-large virtual libraries. Eventually, the analysis of false positives, molecules with high-predicted influx but low accumulation, provides new hints on the molecular properties behind efflux.<br>

Evaluation of Grey Wolf Optimization Algorithm on Rigid and Flexible Receptor Docking

2020 ◽  
Author(s):  
Kin Meng Wong ◽  
Shirley Siu
Keyword(s):  
Scoring Function ◽  
Ligand Docking ◽  
Receptor Protein ◽  
Pose Prediction ◽  
Grey Wolf ◽  
Success Rates ◽  
Autodock Vina ◽  
Grey Wolf Optimization ◽  
Structure Based Drug Design ◽  
Docking Program

Protein-ligand docking programs are indispensable tools for predicting the binding pose of a ligand to the receptor protein in current structure-based drug design. In this paper, we evaluate the performance of grey wolf optimization (GWO) in protein-ligand docking. Two versions of the GWO docking program – the original GWO and the modified one with random walk – were implemented based on AutoDock Vina. Our rigid docking experiments show that the GWO programs have enhanced exploration capability leading to significant speedup in the search while maintaining comparable binding pose prediction accuracy to AutoDock Vina. For flexible receptor docking, the GWO methods are competitive in pose ranking but lower in success rates than AutoDockFR. Successful redocking of all the flexible cases to their holo structures reveals that inaccurate scoring function and lack of proper treatment of backbone are the major causes of docking failures.

Random Forest Refinement of Pairwise Potentials for Protein-ligand Decoy Detection

2019 ◽  
Author(s):  
Jun Pei ◽  
Zheng Zheng ◽  
Hyunji Kim ◽  
Lin Song ◽  
Sarah Walworth ◽  
...  
Keyword(s):  
Machine Learning ◽  
Random Forest ◽  
Probability Function ◽  
Pair Potential ◽  
Scoring Function ◽  
Stable Structure ◽  
Scoring Functions ◽  
Atom Pair ◽  
Data Set ◽  
Atom Pairs

An accurate scoring function is expected to correctly select the most stable structure from a set of pose candidates. One can hypothesize that a scoring function’s ability to identify the most stable structure might be improved by emphasizing the most relevant atom pairwise interactions. However, it is hard to evaluate the relevant importance for each atom pair using traditional means. With the introduction of machine learning methods, it has become possible to determine the relative importance for each atom pair present in a scoring function. In this work, we use the Random Forest (RF) method to refine a pair potential developed by our laboratory (GARF6) by identifying relevant atom pairs that optimize the performance of the potential on our given task. Our goal is to construct a machine learning (ML) model that can accurately differentiate the native ligand binding pose from candidate poses using a potential refined by RF optimization. We successfully constructed RF models on an unbalanced data set with the ‘comparison’ concept and, the resultant RF models were tested on CASF-2013.5 In a comparison of the performance of our RF models against 29 scoring functions, we found our models outperformed the other scoring functions in predicting the native pose. In addition, we used two artificial designed potential models to address the importance of the GARF potential in the RF models: (1) a scrambled probability function set, which was obtained by mixing up atom pairs and probability functions in GARF, and (2) a uniform probability function set, which share the same peak positions with GARF but have fixed peak heights. The results of accuracy comparison from RF models based on the scrambled, uniform, and original GARF potential clearly showed that the peak positions in the GARF potential are important while the well depths are not. <br>

Recent Advances of In-Silico Modeling of Potent Antagonists for the Adenosine Receptors

2019 ◽  
Vol 25 (7) ◽  
pp. 750-773 ◽  
Author(s):  
Pabitra Narayan Samanta ◽  
Supratik Kar ◽  
Jerzy Leszczynski
Keyword(s):  
Drug Targets ◽  
Biological Activities ◽  
Scoring Function ◽  
Md Simulations ◽  
Energy Calculation ◽  
Binding Modes ◽  
Macromolecular Systems ◽  
In Silico Modeling ◽  
Mathematical Algorithms ◽  
The Impact

The rapid advancement of computer architectures and development of mathematical algorithms offer a unique opportunity to leverage the simulation of macromolecular systems at physiologically relevant timescales. Herein, we discuss the impact of diverse structure-based and ligand-based molecular modeling techniques in designing potent and selective antagonists against each adenosine receptor (AR) subtype that constitutes multitude of drug targets. The efficiency and robustness of high-throughput empirical scoring function-based approaches for hit discovery and lead optimization in the AR family are assessed with the help of illustrative examples that have led to nanomolar to sub-micromolar inhibition activities. Recent progress in computer-aided drug discovery through homology modeling, quantitative structure-activity relation, pharmacophore models, and molecular docking coupled with more accurate free energy calculation methods are reported and critically analyzed within the framework of structure-based virtual screening of AR antagonists. Later, the potency and applicability of integrated molecular dynamics (MD) methods are addressed in the context of diligent inspection of intricated AR-antagonist binding processes. MD simulations are exposed to be competent for studying the role of the membrane as well as the receptor flexibility toward the precise evaluation of the biological activities of antagonistbound AR complexes such as ligand binding modes, inhibition affinity, and associated thermodynamic and kinetic parameters.

scholarly journals ASFP (Artificial Intelligence based Scoring Function Platform): a web server for the development of customized scoring functions

2021 ◽  
Vol 13 (1) ◽  
Author(s):  
Xujun Zhang ◽  
Chao Shen ◽  
Xueying Guo ◽  
Zhe Wang ◽  
Gaoqi Weng ◽  
...  
Keyword(s):  
High Efficiency ◽  
Low Cost ◽  
Pearson Correlation ◽  
Scoring Function ◽  
Web Server ◽  
Scoring Functions ◽  
Protein Ligand Interactions ◽  
Prediction Module ◽  
Ligand Interactions ◽  
Benchmark Datasets

AbstractVirtual screening (VS) based on molecular docking has emerged as one of the mainstream technologies of drug discovery due to its low cost and high efficiency. However, the scoring functions (SFs) implemented in most docking programs are not always accurate enough and how to improve their prediction accuracy is still a big challenge. Here, we propose an integrated platform called ASFP, a web server for the development of customized SFs for structure-based VS. There are three main modules in ASFP: (1) the descriptor generation module that can generate up to 3437 descriptors for the modelling of protein–ligand interactions; (2) the AI-based SF construction module that can establish target-specific SFs based on the pre-generated descriptors through three machine learning (ML) techniques; (3) the online prediction module that provides some well-constructed target-specific SFs for VS and an additional generic SF for binding affinity prediction. Our methodology has been validated on several benchmark datasets. The target-specific SFs can achieve an average ROC AUC of 0.973 towards 32 targets and the generic SF can achieve the Pearson correlation coefficient of 0.81 on the PDBbind version 2016 core set. To sum up, the ASFP server is a powerful tool for structure-based VS.

scholarly journals GNINA 1.0: molecular docking with deep learning

2021 ◽  
Vol 13 (1) ◽  
Author(s):  
Andrew T. McNutt ◽  
Paul Francoeur ◽  
Rishal Aggarwal ◽  
Tomohide Masuda ◽  
Rocco Meli ◽  
...  
Keyword(s):  
Molecular Docking ◽  
Root Mean Square ◽  
Root Mean Square Deviation ◽  
Computational Cost ◽  
Scoring Function ◽  
Binding Pocket ◽  
Protein Docking ◽  
Mean Square ◽  
Mean Square Deviation ◽  
Autodock Vina

AbstractMolecular docking computationally predicts the conformation of a small molecule when binding to a receptor. Scoring functions are a vital piece of any molecular docking pipeline as they determine the fitness of sampled poses. Here we describe and evaluate the 1.0 release of the Gnina docking software, which utilizes an ensemble of convolutional neural networks (CNNs) as a scoring function. We also explore an array of parameter values for Gnina 1.0 to optimize docking performance and computational cost. Docking performance, as evaluated by the percentage of targets where the top pose is better than 2Å root mean square deviation (Top1), is compared to AutoDock Vina scoring when utilizing explicitly defined binding pockets or whole protein docking. Gnina, utilizing a CNN scoring function to rescore the output poses, outperforms AutoDock Vina scoring on redocking and cross-docking tasks when the binding pocket is defined (Top1 increases from 58% to 73% and from 27% to 37%, respectively) and when the whole protein defines the binding pocket (Top1 increases from 31% to 38% and from 12% to 16%, respectively). The derived ensemble of CNNs generalizes to unseen proteins and ligands and produces scores that correlate well with the root mean square deviation to the known binding pose. We provide the 1.0 version of Gnina under an open source license for use as a molecular docking tool at https://github.com/gnina/gnina.

scholarly journals Attribute Driven Temporal Active Online Community Search

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Badhan Chandra Das ◽  
Md. Musfique Anwar ◽  
Md. Al-Amin Bhuiyan ◽  
Iqbal H. Sarker ◽  
Salem A. Alyami ◽  
...  
Keyword(s):  
Online Community ◽  
Community Search
Sign in / Sign up

Export Citation Format

Share Document