Arjun Kaneriya

Mr. Arjun Kaneriya


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 February 2025 in Pharmaceuticals
Verified
Journal Article
Open access
PDF file
SDSomanath Dandibhotla
Somanath Dandibhotla
MSMadhav Samudrala
Madhav Samudrala
AKArjun Kaneriya
Arjun Kaneriya
Sivanesan DakshanamurthySivanesan Dakshanamurthy
Sivanesan Dakshanamurthy
Background/Objectives: Accurately predicting protein–ligand binding affinity is essential in drug discovery for identifying effective compounds. While existing sequence-based machine learning models for binding affinity prediction have shown potential, they lack accuracy and robustness in pattern recognition, which limits their generalizability across diverse and novel binding complexes. To overcome these limitations, we developed GNNSeq, a novel hybrid machine learning model that integrates a Graph Neural Network (GNN) with Random Forest (RF) and XGBoost. Methods: GNNSeq predicts ligand binding affinity by extracting molecular characteristics and sequence patterns from protein and ligand sequences. The fully optimized GNNSeq model was trained and tested on subsets of the PDBbind dataset. The novelty of GNNSeq lies in its exclusive reliance on sequence features, a hybrid GNN framework, and an optimized kernel-based context-switching design. By relying exclusively on sequence features, GNNSeq eliminates the need for pre-docked complexes or high-quality structural data, allowing for accurate binding affinity predictions even when interaction-based or structural information is unavailable. The integration of GNN, XGBoost, and RF improves GNNSeq performance by hierarchical sequence learning, handling complex feature interactions, reducing variance, and forming a robust ensemble that improves predictions and mitigates overfitting. The GNNSeq unique kernel-based context switching scheme optimizes model efficiency and runtime, dynamically adjusts feature weighting between sequence and basic structural information, and improves predictive accuracy and model generalization. Results: In benchmarking, GNNSeq performed comparably to several existing sequence-based models and achieved a Pearson correlation coefficient (PCC) of 0.784 on the PDBbind v.2020 refined set and 0.84 on the PDBbind v.2016 core set. During external validation with the DUDE-Z v.2023.06.20 dataset, GNNSeq attained an average area under the curve (AUC) of 0.74, demonstrating its ability to distinguish active ligands from decoys across diverse ligand–receptor pairs. To further evaluate its performance, we combined GNNSeq with two additional specialized models that integrate structural and protein–ligand interaction features. When tested on a curated set of well-characterized drug–target complexes, the hybrid models achieved an average PCC of 0.89, with the top-performing model reaching a PCC of 0.97. GNNSeq was designed with a strong emphasis on computational efficiency, training on 5000+ complexes in 1 h and 32 min, with real-time affinity predictions for test complexes. Conclusions: GNNSeq provides an efficient and scalable approach for binding affinity prediction, offering improved accuracy and generalizability while enabling large-scale virtual screening and cost-effective hit identification. GNNSeq is publicly available in a server-based graphical user interface (GUI) format.

29 April 2025 in ACS Bio & Med Chem Au
Verified
Journal Article
Open access
MSMadhav V. Samudrala
Madhav V. Samudrala
SDSomanath Dandibhotla
Somanath Dandibhotla
AKArjun Kaneriya
Arjun Kaneriya
Sivanesan DakshanamurthySivanesan Dakshanamurthy
Sivanesan Dakshanamurthy
Rapid prediction of protein–ligand binding affinity is important in the drug discovery process. The advent of machine learning methods has increased the speed of these predictions. Previous machine learning models based on structural, sequence, and interaction-based approaches have shown potential but often tend to memorize training data due to incomplete feature representations that lead to poor generalization on external complexes. To address this challenge, here, we developed PLAIG, a Graph Neural Network (GNN)-based machine learning framework for generalized binding affinity prediction. PLAIG represents binding complexes as graphs, integrating protein–ligand interactions and molecular topology to uniquely capture interaction and structural features. To reduce overfitting, we tested principal component analysis (PCA) and ensemble learning with a stacking regressor. During benchmarking, PLAIG achieved a PCC of 0.78 on 4852 complexes from the PDBbind v.2019 refined set and 0.82 on 285 complexes from the v.2016 core set, outperforming many existing models. External validation on the DUDE-Z data set demonstrated its ability to differentiate active ligands from decoys, achieving an average AUC of 0.69 and a maximum AUC of 0.89. To enrich de novo prediction capabilities for subsequent model versions, PLAIG was hybridized with sequence- and structure-based models. The hybrid models achieved an average PCC of 0.88 on well-known drug–target complexes, with the best reaching a PCC of 0.98. Future work will incorporate an explicit inclusion of a docking methodology into PLAIG’s pipeline and assess its performance on de novo ligands. PLAIG is freely available at https://plaig-demo.streamlit.app/.

10 May 2025 in Bioengineering
Verified
Journal Article
Open access
PDF file
AKArjun Kaneriya
Arjun Kaneriya
MSMadhav Samudrala
Madhav Samudrala
Harrish GaneshHarrish Ganesh
Harrish Ganesh
JMJames Robert Moran
James Robert Moran
SDSomanath Dandibhotla
Somanath Dandibhotla
Sivanesan DakshanamurthySivanesan Dakshanamurthy
Sivanesan Dakshanamurthy
Accurately predicting protein–ligand binding affinity is an important step in the drug discovery process. Deep learning (DL) methods have improved binding affinity prediction by using diverse categories of molecular data. However, many models rely heavily on interaction and sequence data, which impedes proper learning and limits performance in de novo applications. To address these limitations, we developed a novel graph neural network model, called StructureNet (structure-based graph neural network), to predict protein–ligand binding affinity. StructureNet improves existing DL methods by focusing entirely on structural descriptors to mitigate data memorization issues introduced by sequence and interaction data. StructureNet represents the protein and ligand structures as graphs, which are processed using a GNN-based ensemble deep learning model. StructureNet achieved a PCC of 0.68 and an AUC of 0.75 on the PDBBind v.2020 Refined Set, outperforming similar structure-based models. External validation on the DUDE-Z dataset showed that StructureNet can effectively distinguish between active and decoy ligands. Further testing on a small subset of well-known drugs indicates that StructureNet has high potential for rapid virtual screening applications. We also hybridized StructureNet with interaction- and sequence-based models to investigate their impact on testing accuracy and found minimal difference (0.01 PCC) between merged models and StructureNet as a standalone model. An ablation study found that geometric descriptors were the key drivers of model performance, with their removal leading to a PCC decrease of over 15.7%. Lastly, we tested StructureNet on ensembles of binding complex conformers generated using molecular dynamics (MD) simulations and found that incorporating multiple conformations of the same complex often improves model accuracy by capturing binding site flexibility. Overall, the results show that structural data alone are sufficient for binding affinity predictions and can address pattern recognition challenges introduced by sequence and interaction features. Additionally, structural representations of protein–ligand complexes can be considerably improved using geometric and topological descriptors. We made StructureNet GUI interface freely available online.