Hao Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Hao Wang has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Wenjian Liu
Shandong University
9 shared publications Ru Wang
Qingdao Institute for Theoretical and Computational Sciences and Center for Optics Research and Engineering
6 shared publicationsWenjian Liu
Qingdao Institute for Theoretical and Computational Sciences School of Chemistry and Chemical Engineering Shandong University 266237 Qingdao Shandong P. R. China
4 shared publications- Xiaojun Ji
Research Center for Mathematics and Interdisciplinary Sciences, Frontiers Science Center for Nonlinear Expectations (Ministry of Education), Shandong University
3 shared publications Linfeng Ye
Qingdao Institute for Theoretical and Computational Sciences, Institute of Frontier and Interdisciplinary Science, Shandong University , Qingdao, Shandong 266237, People’s Republic of China
2 shared publications- Ning Zhang
Shandong University
2 shared publications
Latest Publications
- 28 September 2026
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 165 (12)
New features of BDF since 2020
The Beijing Density Functional (BDF) program package, with a history of over 30 years, is primarily characterized by its inclusion of the full range of relativistic Hamiltonians (one-, two-, quasi-four-, effective-four-, and four-component, as well as quantum electrodynamics) alongside fully symmetry-adapted density functional theory (DFT), time-dependent (TD) DFT, and single/multi-reference wave function theories (WFTs) for electronic structures and response properties of molecular systems. New features of BDF since its last summary [Zhang et al., J. Chem. Phys. 152, 064113 (2020)] include approximate treatments of relativistic effects, improved SCF solvers, implicit and explicit solvation models, enhanced TDDFT, new multi-reference WFT for strong correlation, and analytic gradients, Hessians, and nonadiabatic coupling matrix elements for both ground and excited states, as well as extensions to various spectroscopies. These developments have transformed BDF into a comprehensive and efficient electronic structure program well-suited for real-world applications.
- 28 September 2026
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 165 (12)
New features of BDF since 2020
The Beijing Density Functional (BDF) program package, with a history of over 30 years, is primarily characterized by its inclusion of the full range of relativistic Hamiltonians (one-, two-, quasi-four-, effective-four-, and four-component, as well as quantum electrodynamics) alongside fully symmetry-adapted density functional theory (DFT), time-dependent (TD) DFT, and single/multi-reference wave function theories (WFTs) for electronic structures and response properties of molecular systems. New features of BDF since its last summary [Zhang et al., J. Chem. Phys. 152, 064113 (2020)] include approximate treatments of relativistic effects, improved SCF solvers, implicit and explicit solvation models, enhanced TDDFT, new multi-reference WFT for strong correlation, and analytic gradients, Hessians, and nonadiabatic coupling matrix elements for both ground and excited states, as well as extensions to various spectroscopies. These developments have transformed BDF into a comprehensive and efficient electronic structure program well-suited for real-world applications.
- 20 July 2026
- Published by American Chemical Society (ACS) in ACS Catalysis
- Vol. 16 (15) , 15378-15393
Nuclear Quantum Effects Matter: Zero-Point Energy Governs the Chemoselectivity of Desaturation over Hydroxylation in Nonheme Iron Enzyme AusE
The nonheme iron dioxygenase AusE from the austinol biosynthesis of Aspergillus nidulans catalyzes the regioselective oxidative desaturation of its substrate preaustinoid A1, producing preaustinoid A2 through C=C bond formation, rather than hydroxylated products which are far more common across iron dioxygenases. To elucidate the reaction mechanism underlying AusE-mediated formation of preaustinoid A2, we performed combined computational studies using molecular dynamics, QM/MM, and multireference methods. The results indicated that the reaction proceeds via two sequential hydrogen atom transfer reactions by an Fe(IV)=O species, i.e., C2–H abstraction from the α carbon of an ester group, followed by C1–H abstraction. The latter is more kinetically and thermodynamically favorable over hydroxyl rebound to the C2 radical intermediate (formed after C2–H abstraction), which is consistent with the experimental observation of the desaturation product as the sole product. Our study elucidates multiple critical factors that govern the desaturation selectivity of AusE. Nuclear quantum effects, namely, zero-point energy contributions associated with the C–H bond cleavage, make the dominant contribution to the desaturation selectivity. In addition, (1) substrate orientation relative to the iron center, (2) hydrogen bonding interactions, and (3) the long-range intrinsic electric fields within the enzyme, all contribute positively to the observed selectivity. The present findings are expected to shed light on the origins of chemoselectivity in other iron α-ketoglutarate (αKG)-dependent enzymes.
- 20 July 2026
- Published by American Chemical Society (ACS) in ACS Catalysis
- Vol. 16 (15) , 15378-15393
Nuclear Quantum Effects Matter: Zero-Point Energy Governs the Chemoselectivity of Desaturation over Hydroxylation in Nonheme Iron Enzyme AusE
The nonheme iron dioxygenase AusE from the austinol biosynthesis of Aspergillus nidulans catalyzes the regioselective oxidative desaturation of its substrate preaustinoid A1, producing preaustinoid A2 through C=C bond formation, rather than hydroxylated products which are far more common across iron dioxygenases. To elucidate the reaction mechanism underlying AusE-mediated formation of preaustinoid A2, we performed combined computational studies using molecular dynamics, QM/MM, and multireference methods. The results indicated that the reaction proceeds via two sequential hydrogen atom transfer reactions by an Fe(IV)=O species, i.e., C2–H abstraction from the α carbon of an ester group, followed by C1–H abstraction. The latter is more kinetically and thermodynamically favorable over hydroxyl rebound to the C2 radical intermediate (formed after C2–H abstraction), which is consistent with the experimental observation of the desaturation product as the sole product. Our study elucidates multiple critical factors that govern the desaturation selectivity of AusE. Nuclear quantum effects, namely, zero-point energy contributions associated with the C–H bond cleavage, make the dominant contribution to the desaturation selectivity. In addition, (1) substrate orientation relative to the iron center, (2) hydrogen bonding interactions, and (3) the long-range intrinsic electric fields within the enzyme, all contribute positively to the observed selectivity. The present findings are expected to shed light on the origins of chemoselectivity in other iron α-ketoglutarate (αKG)-dependent enzymes.
- 17 November 2025
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry B
- Vol. 129 (47) , 12076-12086
Unbinding Dynamics of Large HIV Non-Nucleoside Reverse Transcriptase Inhibitors Revealed by Atomistic Milestoning Simulations
Non-nucleoside reverse transcriptase inhibitors (NNRTIs) are a key component of anti-HIV therapy. Large and flexible NNRTIs, such as JLJ636, offer potential advantages in retaining efficacy against drug-resistant mutations in HIV reverse transcriptase. However, the dissociation pathways of such inhibitors from the enzyme’s hydrophobic binding pocket remain unclear. In this study, we use atomistic simulations to investigate the unbinding dynamics of JLJ636. A combination of random acceleration molecular dynamics and Milestoning simulations is adopted to identify dissociation pathways, estimate mean residence time, and compute free energy profiles. Among the three candidate exit routes (termed the “entrance”, “tunnel”, and “groove” channels), the “tunnel” channel is most favorable, followed by the “groove” channel, while the “entrance” channel is rarely visited. This unbinding behavior differs significantly from that of smaller NNRTIs, such as JLJ135 and its analogues, which predominantly dissociate through the “entrance” channel.
- 17 November 2025
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry B
- Vol. 129 (47) , 12076-12086
Unbinding Dynamics of Large HIV Non-Nucleoside Reverse Transcriptase Inhibitors Revealed by Atomistic Milestoning Simulations
Non-nucleoside reverse transcriptase inhibitors (NNRTIs) are a key component of anti-HIV therapy. Large and flexible NNRTIs, such as JLJ636, offer potential advantages in retaining efficacy against drug-resistant mutations in HIV reverse transcriptase. However, the dissociation pathways of such inhibitors from the enzyme’s hydrophobic binding pocket remain unclear. In this study, we use atomistic simulations to investigate the unbinding dynamics of JLJ636. A combination of random acceleration molecular dynamics and Milestoning simulations is adopted to identify dissociation pathways, estimate mean residence time, and compute free energy profiles. Among the three candidate exit routes (termed the “entrance”, “tunnel”, and “groove” channels), the “tunnel” channel is most favorable, followed by the “groove” channel, while the “entrance” channel is rarely visited. This unbinding behavior differs significantly from that of smaller NNRTIs, such as JLJ135 and its analogues, which predominantly dissociate through the “entrance” channel.
- 23 January 2025
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 21 (3) , 1078-1088
Experiment-Guided Refinement of Milestoning Network
Milestoning is an efficient method for calculating rare event kinetics by constructing a continuous-time kinetic network that connects the reactant and product states. Its accuracy depends on both the quality of the underlying force fields and the trajectory sampling. The sampling error can be effectively controlled through various methods. However, the force fields are often not accurate enough, leading to quantitative discrepancies between simulations and experimental data. To address this challenge, we present a refinement approach for Milestoning network based on the maximum caliber (MaxCal), a general variational principle for dynamical systems, to combine simulations and experimental data. The Kullback-Leibler divergence rate between two Milestoning networks is analytically evaluated and minimized as the loss function. Meanwhile, experimental thermodynamic (equilibrium constants) and kinetic (rate constants) data are incorporated as constraints. The use of MaxCal implies that the refined kinetic network is minimally perturbed from the original one while satisfying the experimental constraints. The refined network is expected to align better with available experimental data. The refinement approach is demonstrated using the binding and unbinding dynamics of a series of six small molecule ligands for the model host system, β-cyclodextrin.
- 23 January 2025
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 21 (3) , 1078-1088
Experiment-Guided Refinement of Milestoning Network
Milestoning is an efficient method for calculating rare event kinetics by constructing a continuous-time kinetic network that connects the reactant and product states. Its accuracy depends on both the quality of the underlying force fields and the trajectory sampling. The sampling error can be effectively controlled through various methods. However, the force fields are often not accurate enough, leading to quantitative discrepancies between simulations and experimental data. To address this challenge, we present a refinement approach for Milestoning network based on the maximum caliber (MaxCal), a general variational principle for dynamical systems, to combine simulations and experimental data. The Kullback-Leibler divergence rate between two Milestoning networks is analytically evaluated and minimized as the loss function. Meanwhile, experimental thermodynamic (equilibrium constants) and kinetic (rate constants) data are incorporated as constraints. The use of MaxCal implies that the refined kinetic network is minimally perturbed from the original one while satisfying the experimental constraints. The refined network is expected to align better with available experimental data. The refinement approach is demonstrated using the binding and unbinding dynamics of a series of six small molecule ligands for the model host system, β-cyclodextrin.
- Open Access
Milestoning network refinement by incorporating experimental thermodynamic and kinetic data
Milestoning is an accurate and efficient method for rare event kinetics calculations by constructing a continuous-time kinetic network connecting the reactant and product states. However, even with adequate sampling, its accuracy can also be limited by the force fields, which makes it challenging to achieve quantitative agreement with experimental data. To address this issue, we present a refinement approach by minimizing the Kullback-Leibler divergence rate between two Milestoning networks while incorporating experimental thermodynamic (equilibrium constants) and kinetic (rate constants) data as constraints. This approach ensures that the refined kinetic network is minimally perturbed with respect to the original one, while simultaneously satisfying the experimental constraints. The refinement approach is demonstrated using the binding and unbinding dynamics of a series of six small molecule ligands for the model host system, $β$-cyclodextrin.
Open AccessMilestoning network refinement by incorporating experimental thermodynamic and kinetic data
Milestoning is an accurate and efficient method for rare event kinetics calculations by constructing a continuous-time kinetic network connecting the reactant and product states. However, even with adequate sampling, its accuracy can also be limited by the force fields, which makes it challenging to achieve quantitative agreement with experimental data. To address this issue, we present a refinement approach by minimizing the Kullback-Leibler divergence rate between two Milestoning networks while incorporating experimental thermodynamic (equilibrium constants) and kinetic (rate constants) data as constraints. This approach ensures that the refined kinetic network is minimally perturbed with respect to the original one, while simultaneously satisfying the experimental constraints. The refinement approach is demonstrated using the binding and unbinding dynamics of a series of six small molecule ligands for the model host system, $β$-cyclodextrin.
- 17 June 2024
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 20 (13) , 5439-5450
Kinetic Network in Milestoning: Clustering, Reduction, and Transition Path Analysis
We present a reduction of the Milestoning (ReM) algorithm to analyze the high-dimensional Milestoning kinetic network. The algorithm reduces the Milestoning network to low dimensions but preserves essential kinetic information, such as local residence time, exit time, and mean first passage time between any two states. This is achieved in three steps. First, nodes (milestones) in the high-dimensional Milestoning network are grouped into clusters based on the metastability identified by an auxiliary continuous-time Markov chain. Our clustering method is applicable not only to time-reversible networks but also to nonreversible networks generated from practical simulations with statistical fluctuations. Second, a reduced network is established via network transformation, containing only the core sets of clusters as nodes. Finally, transition pathways are analyzed in the reduced network based on the transition path theory. The algorithm is illustrated using a toy model and a solvated alanine dipeptide in two and four dihedral angles.
- 17 June 2024
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 20 (13) , 5439-5450
Kinetic Network in Milestoning: Clustering, Reduction, and Transition Path Analysis
We present a reduction of the Milestoning (ReM) algorithm to analyze the high-dimensional Milestoning kinetic network. The algorithm reduces the Milestoning network to low dimensions but preserves essential kinetic information, such as local residence time, exit time, and mean first passage time between any two states. This is achieved in three steps. First, nodes (milestones) in the high-dimensional Milestoning network are grouped into clusters based on the metastability identified by an auxiliary continuous-time Markov chain. Our clustering method is applicable not only to time-reversible networks but also to nonreversible networks generated from practical simulations with statistical fluctuations. Second, a reduced network is established via network transformation, containing only the core sets of clusters as nodes. Finally, transition pathways are analyzed in the reduced network based on the transition path theory. The algorithm is illustrated using a toy model and a solvated alanine dipeptide in two and four dihedral angles.
- Open Access
Kinetic network in Milestoning: Clustering, reduction, and transition path analysis
We present a reduction of Milestoning (ReM) algorithm to analyze the high-dimensional Milestoning kinetic network. The algorithm reduces the Milestoning network to low dimensions but preserves essential kinetic information, such as local residence time, exit time, and mean first passage time between any two states. This is achieved in three steps. First, nodes (milestones) in the high-dimensional Milestoning network are grouped into clusters based on the metastability identified by an auxiliary continuous-time Markov chain. Our clustering method is applicable not only to time-reversible networks but also to non-reversible networks generated from practical simulations with statistical fluctuations. Second, a reduced network is established via network transformation, containing only the core sets of clusters as nodes. Finally, transition pathways are analyzed in the reduced network based on the transition path theory. The algorithm is illustrated using a toy model and a solvated alanine dipeptide in two and four dihedral angles.
Open AccessKinetic network in Milestoning: Clustering, reduction, and transition path analysis
We present a reduction of Milestoning (ReM) algorithm to analyze the high-dimensional Milestoning kinetic network. The algorithm reduces the Milestoning network to low dimensions but preserves essential kinetic information, such as local residence time, exit time, and mean first passage time between any two states. This is achieved in three steps. First, nodes (milestones) in the high-dimensional Milestoning network are grouped into clusters based on the metastability identified by an auxiliary continuous-time Markov chain. Our clustering method is applicable not only to time-reversible networks but also to non-reversible networks generated from practical simulations with statistical fluctuations. Second, a reduced network is established via network transformation, containing only the core sets of clusters as nodes. Finally, transition pathways are analyzed in the reduced network based on the transition path theory. The algorithm is illustrated using a toy model and a solvated alanine dipeptide in two and four dihedral angles.
- Open Access
- 28 December 2023
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 159 (24)
On committor functions in milestoning
As an optimal one-dimensional reaction coordinate, the committor function not only describes the probability of a trajectory initiated at a phase space point first reaching the product state before reaching the reactant state but also preserves the kinetics when utilized to run a reduced dynamics model. However, calculating the committor function in high-dimensional systems poses significant challenges. In this paper, within the framework of milestoning, exact expressions for committor functions at two levels of coarse graining are given, including committor functions of phase space point to point (CFPP) and milestone to milestone (CFMM). When combined with transition kernels obtained from trajectory analysis, these expressions can be utilized to accurately and efficiently compute the committor functions. Furthermore, based on the calculated committor functions, an adaptive algorithm is developed to gradually refine the transition state region. Finally, two model examples are employed to assess the accuracy of these different formulations of committor functions.
- 28 December 2023
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 159 (24)
Open AccessOn committor functions in milestoning
As an optimal one-dimensional reaction coordinate, the committor function not only describes the probability of a trajectory initiated at a phase space point first reaching the product state before reaching the reactant state but also preserves the kinetics when utilized to run a reduced dynamics model. However, calculating the committor function in high-dimensional systems poses significant challenges. In this paper, within the framework of milestoning, exact expressions for committor functions at two levels of coarse graining are given, including committor functions of phase space point to point (CFPP) and milestone to milestone (CFMM). When combined with transition kernels obtained from trajectory analysis, these expressions can be utilized to accurately and efficiently compute the committor functions. Furthermore, based on the calculated committor functions, an adaptive algorithm is developed to gradually refine the transition state region. Finally, two model examples are employed to assess the accuracy of these different formulations of committor functions.
- Open Access
On Committor Functions in Milestoning
As an optimal one-dimensional reaction coordinate, the committor function not only describes the probability of a trajectory initiated at a phase space point first reaching the product state before reaching the reactant state, but also preserves the kinetics when utilized to run a reduced dynamics model. However, calculating the committor function in high-dimensional systems poses significant challenges. In this paper, within the framework of Milestoning, exact expressions for committor functions at two levels of coarse graining are given, including committor functions of phase space point to point (CFPP) and milestone to milestone (CFMM). When combined with transition kernels obtained from trajectory analysis, these expressions can be utilized to accurately and efficiently compute the committor functions. Furthermore, based on the calculated committor functions, an adaptive algorithm is developed to gradually refine the transition state region. Finally, two model examples are employed to assess the accuracy of these different formulations of committor functions.
Open AccessOn Committor Functions in Milestoning
As an optimal one-dimensional reaction coordinate, the committor function not only describes the probability of a trajectory initiated at a phase space point first reaching the product state before reaching the reactant state, but also preserves the kinetics when utilized to run a reduced dynamics model. However, calculating the committor function in high-dimensional systems poses significant challenges. In this paper, within the framework of Milestoning, exact expressions for committor functions at two levels of coarse graining are given, including committor functions of phase space point to point (CFPP) and milestone to milestone (CFMM). When combined with transition kernels obtained from trajectory analysis, these expressions can be utilized to accurately and efficiently compute the committor functions. Furthermore, based on the calculated committor functions, an adaptive algorithm is developed to gradually refine the transition state region. Finally, two model examples are employed to assess the accuracy of these different formulations of committor functions.
- Open Access
Approximating First Hitting Point Distribution in Milestoning for Rare Event Kinetics
Milestoning is an efficient method for rare event kinetics calculation using short trajectory parallelization. Mean first passage time (MFPT) is the key kinetic output of Milestoning, whose accuracy crucially depends the initial distribution of the short trajectory ensemble. The true initial distribution, i.e., first hitting point distribution (FHPD), has no analytic expression in the general case. Here, we introduce two algorithms, local passage time weighted Milestoning (LPT-M) and Bayesian inference Milestoning (BI-M), to accurately and efficiently approximate FHPD for systems at equilibrium condition. Starting from sampling Boltzmann distribution on milestones, we calculate the proper weighting factor for the short trajectory ensemble. The methods are tested on two model examples for illustration purpose. Both methods improve significantly over the widely used classical Milestoning method in terms of the accuracy of MFPT. In particular, BI-M covers the directional Milestoning method as a special case in the deterministic Hamiltonian dynamics. LPT-M is especially advantageous in terms of computational costs and robustness with respect to the increasing number of intermediate milestones. Furthermore, a locally iterative correction algorithm for non-equilibrium stationary FHPD is developed for exact MFPT calculation, which can be combined with LPT-M/BI-M and is much cheaper than the exact Milestoning method.
Open AccessApproximating First Hitting Point Distribution in Milestoning for Rare Event Kinetics
Milestoning is an efficient method for rare event kinetics calculation using short trajectory parallelization. Mean first passage time (MFPT) is the key kinetic output of Milestoning, whose accuracy crucially depends the initial distribution of the short trajectory ensemble. The true initial distribution, i.e., first hitting point distribution (FHPD), has no analytic expression in the general case. Here, we introduce two algorithms, local passage time weighted Milestoning (LPT-M) and Bayesian inference Milestoning (BI-M), to accurately and efficiently approximate FHPD for systems at equilibrium condition. Starting from sampling Boltzmann distribution on milestones, we calculate the proper weighting factor for the short trajectory ensemble. The methods are tested on two model examples for illustration purpose. Both methods improve significantly over the widely used classical Milestoning method in terms of the accuracy of MFPT. In particular, BI-M covers the directional Milestoning method as a special case in the deterministic Hamiltonian dynamics. LPT-M is especially advantageous in terms of computational costs and robustness with respect to the increasing number of intermediate milestones. Furthermore, a locally iterative correction algorithm for non-equilibrium stationary FHPD is developed for exact MFPT calculation, which can be combined with LPT-M/BI-M and is much cheaper than the exact Milestoning method.