Siqin Cao

Siqin Cao

Auto-generated profile, based on publicly available information

Siqin Cao

University of Wisconsin–Madison

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
11 July 2024 in ChemRxiv
Verified
Preprint
Open access
PDF file
MXMingyi Xue
Mingyi Xue
BLBojun Liu
Bojun Liu
SCSiqin Cao
Siqin Cao
XHXuhui Huang
Xuhui Huang
Molecular docking, the task of predicting the binding structures between a protein and a small molecule ligand, plays a significant role in structural-based drug discovery. In recent years, numerous deep learning-based methods for molecular docking have emerged. State-of-the-art approaches such as DiffDock formulate the docking problem using diffusion generative models, exhibiting superior performance than traditional docking algorithms. However, despite the strong performance of these deep learning-based docking methods in predicting binding poses, they often lack a well-defined scoring function. This limitation poses challenges in effectively distinguishing between the strong and weak inhibitors during virtual screening. To address this limitation, we introduce FeatureDock, a transformer-based deep learning framework, which can accurately predict the protein-ligand binding poses as well as achieve a strong scoring power for virtual screening. FeatureDock extracts chemical features from local environments within protein structures and utilizes a Transformer encoder to predict probability density envelopes indicating where ligands are most likely to bind in the protein pocket. We also designed a scoring function, which encodes the predicted probability density envelope, to optimize and score the ligand poses. In addition, the attention mechanism in FeatureDock’s Transformer further enhances the model’s interpretability by providing the attention weights of each chemical feature from the protein structures in predicting the binding probabilities. When applied to virtual screening, we demonstrated that FeatureDock outperforms DiffDock, Smina and AutoDock Vina in distinguishing strong inhibitors from weak ones for both Cyclin-Dependent Kinase 2 (CDK2, an inactivated form) and Angiotensin-converting enzyme (ACE). The performance was assessed using Kullback–Leibler (KL) divergence and area under receiver operating characteristic (AUC) evaluation metrics. We also demonstrate that FeatureDock can accurately predict the binding poses, achieving an average RMSD of 2.4 Å when compared to CDK2-ligand co-crystal structures. We anticipate that our FeatureDock holds promise to be widely applied in virtual screening to assist in drug design. FeatureDock is available at https://github.com/xuhuihuang/featuredock.

16 January 2023 in ChemRxiv
Verified
Preprint
Open access
PDF file
SCSiqin Cao
Siqin Cao
YQYunrui Qiu
Yunrui Qiu
MKMichael Kalin
Michael Kalin
XHXuhui Huang
Xuhui Huang
The generalized master equation (GME) provides a powerful approach to study biomolecular dynamics via non-Markovian dynamic models built from molecular dynamics (MD) simulations. Previously, we have implemented the GME for biomolecular dynamics, namely the quasi Markov State Model (qMSM), where we explicitly calculate the memory kernel and propagate protein dynamics using a discretized GME. qMSM can be constructed with much shorter MD simulation trajectories than the Markov State Model (MSM). However, since qMSM needs to explicitly compute the time-dependent memory kernels, it is heavily affected by the numerical fluctuations of simulation data when applied to study complicated conformational changes of biomolecules. This can lead to numerical instability of predicted long-time dynamics, greatly limiting the applicability of the qMSM in complicated molecules. In this paper, we propose a new theory, the Integrative GME (IGME), to overcome the challenges of the qMSM by using the time integrations of memory kernels. The IGME avoids the numerical instability induced by explicit computation of time-dependent memory kernel functions, giving more robust predictions of long-time dynamics. Using our analytical solution of the IGME, we propose a new approach to compute memory kernels and long-time dynamics in a numerically stable, accurate and efficient way. To demonstrate its effectiveness, we have applied the IGME in three biomolecules: the alanine dipeptide, the FIP35 WW domain, and Taq RNAP. In each system, the IGME achieves significantly smaller fluctuations for both memory kernels and long-time dynamics compared to the qMSM. We anticipate that the IGME can be widely applied to investigate complex conformational changes of biomolecules.

28 November 2023 in ChemRxiv
Verified
Preprint
Open access
PDF file
YWYue Wu
Yue Wu
SCSiqin Cao
Siqin Cao
YQYunrui Qiu
Yunrui Qiu
XHXuhui Huang
Xuhui Huang
Protein conformational changes play crucial roles in their biological functions. In recent years, the Markov State Model (MSM) constructed from extensive Molecular Dynamics (MD) simulations has emerged as a powerful tool for modeling complex protein conformational changes. In MSMs, dynamics are modeled as a sequence of Markovian transitions among metastable conformational states at discrete time intervals (called lag time). A major challenge for MSM is that the lag time must be long enough to allow transitions among states to become memoryless (or Markovian). However, this lag time is constrained by the length of individual MD simulations available to track these transitions. To address this challenge, we have recently developed Generalized Master Equation (GME)-based approaches, encoding non-Markovian dynamics using a time-dependent memory kernel. In this tutorial, we introduce the theory behind two recently developed GME-based non-Markovian dynamic models: the Quasi Markov State Model (qMSM) and the Integrative Generalized Master Equation (IGME). We subsequently outline the procedures for constructing these models and provide a step-by-step tutorial on applying qMSM and IGME to study two peptide systems: the alanine dipeptide and villin headpiece. This tutorial is available at https://github.com/xuhuihuang/GME_tutorials. The protocols detailed in this tutorial aim to be accessible for non-experts interested in studying the biomolecular dynamics using these non-Markovian dynamic models.

4 September 2024 in ChemRxiv
Verified
Preprint
Open access
PDF file
BLBojun Liu
Bojun Liu
SCSiqin Cao
Siqin Cao
JBJordan G Boysen
Jordan G Boysen
MXMingyi Xue
Mingyi Xue
XHXuhui Huang
Xuhui Huang
Identifying collective variables (CVs) that accurately capture the slowest timescales of protein conformational changes is crucial to comprehend numerous biological processes. In this work, we develop a novel algorithm, the Memory kErnel Minimization based Neural Networks (MEMnets), that accurately identifies the slow CVs of biomolecular dynamics. MEMnets is distinct from popular deep-learning approaches (such as VAMPnets or SRVs) that assume Markovian dynamics. Instead, MEMnets is built on the integrative generalized master equation (IGME) theory, which incorporates non-Markovian dynamics by encoding them in a memory kernel for continuous CVs. The key innovation of MEMnets is to identify optimal CVs by minimizing time-integrated memory kernels. To accomplish this, MEMnets process time sequences of molecular dynamics (MD) conformations by using parallel encoder neural networks that project high-dimensional MD data into a low-dimensional latent space. The time-integrated memory kernels, derived from IGME theory, are then computed in the latent space as the objective function. We demonstrate that our MEMnets algorithm can effectively identify the slow CVs involved in the folding of FIP35 WW-domain with high accuracy, and successfully reveal two parallel folding pathways. Furthermore, we test MEMnets’ on the clamp opening of a bacterial RNA polymerase (RNAP), a much more complex conformational change (a system containing over 540K atoms), where sampling from all-atom MD simulations is limited. Our results demonstrate that MEMnets greatly outperforms SRVs, which is based on Markovian dynamics and may result in disconnected dynamics along the identified CVs. We anticipate that MEMnets holds promise to be widely to study biomolecular conformational changes.

25 August 2025 in ChemRxiv
Verified
Preprint
Open access
PDF file
ZLZige Liu
Zige Liu
SCSiqin Cao
Siqin Cao
BLBojun Liu
Bojun Liu
XHXuhui Huang
Xuhui Huang
Supramolecular assembly is a versatile bottom-up strategy for creating advanced functional materials. Metallic platinum-platinum (Pt···Pt) interactions provide a distinctive driving force for supramolecular assembly due to their strong, directional, and long-range nature. Despite their importance, the microscopic dynamics underlying the self-assembly of Pt(II) complexes remain challenging to probe experimentally. Molecular dynamics (MD) simulations can capture these processes at atomic resolution, but extracting kinetic pathways is complicated by the indistinguishability and permutation of identical monomers within self-assembled structures. In this study, we employ GraphVAMPnet, a deep learning framework based on graph neural networks (GNN), on extensive MD simulations of amphiphilic PtB complexes during the early stage of self-assembly. GraphVAMPnet inherently accounts for permutational, rotational, and translational invariance, making it well suited for analyzing self-assembly dynamics. Our analysis reveals three slow collective variables (CVs) that govern PtB self-assembly. The slowest mode (CV1) separates two distinct kinetic growth routes: an incremental growth mechanism, in which single monomers join existing aggregates with predominantly anti-parallel packing (CV3), and a hopping growth mechanism, in which clusters of smaller size merge via heterogeneous collisions, yielding a mix of anti-parallel and parallel packing arrangements (CV2). Further energetic analysis indicates that incremental growth is favored, potentially leading to the well-ordered nanosheet morphologies observed experimentally. Our findings provide molecular-level insight into PtB self-assembly pathways and showcase the capability of GraphVAMPnet in dissecting the complex dynamics of supramolecular assembly.

26 April 2023 in ChemRxiv
Verified
Preprint
Open access
PDF file
AIAnthony Dominic Iii
Anthony Dominic Iii
SCSiqin Cao
Siqin Cao
AMAndres Montoya-Castillo
Andres Montoya-Castillo
XHXuhui Huang
Xuhui Huang
Conformational changes underpin function and encode complex biomolecular mechanisms. Gaining atomic-level detail of how such changes occur has the potential to reveal these mechanisms and is of critical importance in identifying drug targets, facilitating rational drug design, and enabling bioengineering applications. While the past two decades have brought Markov State Model techniques to the point where practitioners can regularly use them to glimpse the long-time dynamics of slow conformations in complex systems, many systems are still beyond their reach. In this perspective, we discuss how memory can reduce the computational cost to predict the long-time dynamics in these complex systems by orders of magnitude and with greater accuracy and resolution than state-of-the-art Markov State Models. We illustrate how memory lies at the heart of successful and promising techniques, ranging from the Fokker-Planck and generalized Langevin equations to deep learning recurrent neural networks and generalized master equations. We delineate how these techniques work, identify insights that they can offer in biomolecular systems, and discuss their advantages and disadvantages in practical settings. We show how generalized master equations can enable the investigation of, for example, the gate-opening process in RNA polymerase II and demonstrate how our recent advances tame the deleterious influence of statistical underconvergence of the molecular dynamics simulations used to parameterize these techniques. This represents a significant leap forward that will enable our memory-based techniques to interrogate systems that are currently beyond the reach of even the best Markov State Models. We conclude by discussing some current challenges and future prospects for how exploiting memory will open the door to many exciting opportunities.