arXiv subjects

Jaya Vasavi Pamidimukkala

Publications and source records attributed to Jaya Vasavi Pamidimukkala.

3 recordsLinked to original sources

arXiv2026

An Integrative Computational Approach to Predict Viral Epitopes by Targeting the MHC-TCR Complexation

T-cell immunity acts as a major defense system against controlling viral infections in vertebrates. During viral entry, innate immune cells degrade the viral proteins (antigens) and present them on their surface via Major Histocompatibility (MHC) proteins. T-cell receptors (TCRs) recognize these antigens/peptides presented by MHC (pMHC), initiating a T-cell mediated immune response. Despite its significance, the mechanism by which pMHC-TCR binding triggers T-cell activation remains unclear. In this study, we employed an integrative computational approach combining Bioinformatics, Molecular Dynamics (MD) simulations, and Machine Learning (ML) to identify viral epitopes as potential vaccine candidates. We performed large-scale all-atom and coarse-grained MD simulations on MHC-peptide-TCR complexes embedded into dendritic and T-cells, for which experimental immunogenicity data is available. One hundred fifty such systems are simulated for 1 μs each to capture the conformational and dynamical changes that underlie T-cell activation. Our ML model (DynamiT), trained on simulation-derived structural and dynamical features extracted from 2500 time points, revealed key determinants responsible for T-cell activation with an accuracy of 73.3%. Notably, we have identified the bending of the TCR transmembrane region, major dynamic motions of the TCRα constant region and the buried surface area at the pMHC and TCR interface as critical factors influencing immune response initiation. Our approach unravels the mechanism of T-cell mediated immune response and helps ML-guided screening of viral epitopes for vaccine development.

q-bio.BM↗

arXiv2026

Accelerating De Novo Genome Assembly via Quantum-Assisted Graph Optimization with Bitstring Recovery

Genome sequencing is essential to decode genetic information, identify organisms, understand diseases and advance personalized medicine. A critical step in any genome sequencing technique is genome assembly. However, de novo genome assembly, which involves constructing an entire genome sequence from scratch without a reference genome, presents significant challenges due to its high computational complexity, affecting both time and accuracy. In this study, we propose a hybrid approach utilizing a quantum computing-based optimization algorithm integrated with classical pre-processing to expedite the genome assembly process. Specifically, we present a method to solve the Hamiltonian and Eulerian paths within the genome assembly graph using gate-based quantum computing through a Higher-Order Binary Optimization (HOBO) formulation with the Variational Quantum Eigensolver algorithm (VQE), in addition to a novel bitstring recovery mechanism to improve optimizer traversal of the solution space. A comparative analysis with classical optimization techniques was performed to assess the effectiveness of our quantum-based approach in genome assembly. The results indicate that, as quantum hardware continues to evolve and noise levels diminish, our formulation holds a significant potential to accelerate genome sequencing by offering faster and more accurate solutions to the complex challenges in genomic research.

quant-ph↗

arXiv2025

Capturing Protein Free Energy Landscape using Efficient Quantum Encoding

Protein folding is one of the age-old biological problems that refers to the mechanism of understanding and predicting how a protein's linear sequence of amino acids folds into its specific three dimensional structure.This structure is critical, as a protein's functionality is inherently linked to its final folded form. Misfolding can lead to severe diseases such as Alzheimer's and cystic fibrosis, highlighting the biological and clinical importance of understanding protein folding mechanisms. This work presents a novel turn based encoding optimization algorithm for predicting the folded structures of peptides and small proteins. Our approach builds upon our previous research, where our objective function focused on hydrophobic collapse, a fundamental phenomenon underlying the protein folding process. In this work, we extend that framework by not only incorporating hydrophobic interactions but also including all non bonded interactions modeled using the Miyazawa Jernigan potential. We constructed a Hamiltonian from the defined objective function that encodes the folding process on a three dimensional face centered cubic lattice, offering superior packing efficiency and a realistic representation of protein conformations. This Hamiltonian is then solved using classical and quantum solvers to explore the vast conformational space of proteins. To identify the lowest-energy folded configurations, we utilize the Variational Quantum Eigensolver implemented on IBM 133 qubit hardware. The predicted structures are validated against experimental data using root mean square deviation as a metric and compared against classical simulated annealing and molecular dynamics simulation results. Our findings highlight the promise of hybrid classical and quantum approaches in advancing protein folding predictions, particularly for sequences with low homology.

quant-ph↗