Lena Simine
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lena Simine has a total of 57 co-authors. Here are the top co-authors by number of shared publications:
- Michael Kilgour
Department of Chemistry New York University 10003 New York NY USA
6 shared publications Michael Kilgour
Department of Chemistry McGill University 801 Sherbrooke St. W H3A 0B8 Montreal Quebec Canada
5 shared publicationsAta Madanchi
Department of Physics
4 shared publicationsYu Wang
Department of Chemistry, McGill University , 801 Sherbrooke West, Montreal, Quebec H3A 0B8, Canada
4 shared publications- Nicolas Gastellu
Department of Chemistry McGill University Montréal Québec Canada
3 shared publications - Tao Liu
McGill University
3 shared publications
Latest Publications
- Open Access
- 15 November 2026
- Published by American Chemical Society (ACS) in ChemRxiv
Sparse Hierarchy Integration-Inspired Protocol (SHIP): Hierarchical Exploration of Sparse-Reward Spaces with GFlowNets
Generative modelling is a useful methodology for large-scale combinatorial problems involving many possible candidates. Such problems typically suffer from exponential scaling in complexity as the size of the system being studied is increased, and this impedes search space exploration and discovery. This work explores the parallel between the problem of generating high-value samples from a high-dimensional distribution and choosing a sparse set of grid points for high-dimensional integration using the Smolyak hierarchy. The proposed method, called Sparse Hierarchy Integration-Inspired Protocol (SHIP), is a Generative Flow Network (GFlowNet) based framework in which high-value higher-dimensional samples are generated by extending up from high-value lower-dimensional samples sequentially and iteratively. This protocol is tested on a model problem of approximating path-integral solutions to open quantum dynamics using Small Matrix Path Integral for reward evaluation. We show that the capacity of this approach to circumvent problems related to poor reward connectivity is drastically improved when action space representation is updated based on interpretable features identified in solutions at intermediate steps. These results serve to motivate the implementation of this protocol more broadly for other generative problems in physical and chemical systems.
- 15 November 2026
- Published by American Chemical Society (ACS) in ChemRxiv
Open AccessSparse Hierarchy Integration-Inspired Protocol (SHIP): Hierarchical Exploration of Sparse-Reward Spaces with GFlowNets
Generative modelling is a useful methodology for large-scale combinatorial problems involving many possible candidates. Such problems typically suffer from exponential scaling in complexity as the size of the system being studied is increased, and this impedes search space exploration and discovery. This work explores the parallel between the problem of generating high-value samples from a high-dimensional distribution and choosing a sparse set of grid points for high-dimensional integration using the Smolyak hierarchy. The proposed method, called Sparse Hierarchy Integration-Inspired Protocol (SHIP), is a Generative Flow Network (GFlowNet) based framework in which high-value higher-dimensional samples are generated by extending up from high-value lower-dimensional samples sequentially and iteratively. This protocol is tested on a model problem of approximating path-integral solutions to open quantum dynamics using Small Matrix Path Integral for reward evaluation. We show that the capacity of this approach to circumvent problems related to poor reward connectivity is drastically improved when action space representation is updated based on interpretable features identified in solutions at intermediate steps. These results serve to motivate the implementation of this protocol more broadly for other generative problems in physical and chemical systems.
- Open Access
- 24 May 2026
- Published by American Chemical Society (ACS) in ChemRxiv
Predicting DNA Aptamer-Ligand Binding Affinities with DeltaGzip
Accurately predicting DNA–ligand binding affinities is critical for the scalable design of DNA aptamer-based sensors, yet the field lacks computational tools in virtual screening that balance computational efficiency with experiment-level accuracy. Here, we adapt DeltaGzip, an affinity prediction protocol combining molecular dynamics simulation with Gzip lossless compression, to DNA aptamer–ligand systems. To this end we refined the calculation of enthalpy, performed representation learning to improve the entropy calculation, and introduced a pre-screening step to filter out non-binding ligands. In the absence of suitable datasets for method validation, we have performed isothermal titration calorimetry (ITC) measurements of the binding free energy for a dopamine-binding DNA aptamer binding 22 different molecular ligands with varying affinity. Our experiments show that DeltaGzip’s predictions agree with the ITC measurements, both qualitatively and quantitatively.
- 24 May 2026
- Published by American Chemical Society (ACS) in ChemRxiv
Open AccessPredicting DNA Aptamer-Ligand Binding Affinities with DeltaGzip
Accurately predicting DNA–ligand binding affinities is critical for the scalable design of DNA aptamer-based sensors, yet the field lacks computational tools in virtual screening that balance computational efficiency with experiment-level accuracy. Here, we adapt DeltaGzip, an affinity prediction protocol combining molecular dynamics simulation with Gzip lossless compression, to DNA aptamer–ligand systems. To this end we refined the calculation of enthalpy, performed representation learning to improve the entropy calculation, and introduced a pre-screening step to filter out non-binding ligands. In the absence of suitable datasets for method validation, we have performed isothermal titration calorimetry (ITC) measurements of the binding free energy for a dopamine-binding DNA aptamer binding 22 different molecular ligands with varying affinity. Our experiments show that DeltaGzip’s predictions agree with the ITC measurements, both qualitatively and quantitatively.
- Open Access
- 20 February 2026
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 164 (7)
MAPping dynamic heterogeneity in supercooled glass-formers
A central question in glass physics is whether dynamic heterogeneity of supercooled liquids can be inferred from static structure. Successful models based on supervised and unsupervised machine-learning predict mobility from particle positions but either require labels in training and/or do not offer simple interpretation. Here, we propose to diagnose dynamic heterogeneity using an autoregressive generative model called MAP that learns probabilities of particle configurations conditioned on fragmented local environments from molecular-dynamics data. We verify that in its generative capacity, MAP reproduces key benchmarks for the supercooled Kob–Andersen binary system, such as the relevant pair-correlation functions and the point-to-set distance temperature scaling. We then explore the behavior of the MAP-derived reaction coordinate Ω and find that its modulations coincide with dynamic excitations. We tune Ω into a hypersensitive regime and find that it reports more broadly on local dynamic events, which we characterize as concurrent nearby excitations. This unsupervised-learning signal links rare events to atypical states of fragmented local environments, and it offers a new intuitive way to characterize and explore the dynamic heterogeneity in supercooled glass-formers.
- 20 February 2026
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 164 (7)
Open AccessMAPping dynamic heterogeneity in supercooled glass-formers
A central question in glass physics is whether dynamic heterogeneity of supercooled liquids can be inferred from static structure. Successful models based on supervised and unsupervised machine-learning predict mobility from particle positions but either require labels in training and/or do not offer simple interpretation. Here, we propose to diagnose dynamic heterogeneity using an autoregressive generative model called MAP that learns probabilities of particle configurations conditioned on fragmented local environments from molecular-dynamics data. We verify that in its generative capacity, MAP reproduces key benchmarks for the supercooled Kob–Andersen binary system, such as the relevant pair-correlation functions and the point-to-set distance temperature scaling. We then explore the behavior of the MAP-derived reaction coordinate Ω and find that its modulations coincide with dynamic excitations. We tune Ω into a hypersensitive regime and find that it reports more broadly on local dynamic events, which we characterize as concurrent nearby excitations. This unsupervised-learning signal links rare events to atypical states of fragmented local environments, and it offers a new intuitive way to characterize and explore the dynamic heterogeneity in supercooled glass-formers.
- 29 April 2025
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry Letters
- Vol. 16 (18) , 4522-4528
Disentangling Morphology and Conductance in Amorphous Graphene
Amorphous graphene or amorphous monolayer carbon (AMC) is a family of carbon films that exhibit a surprising sensitivity of electronic conductance to morphology. We combine deep learning-enhanced simulation techniques with percolation theory to analyze three morphologically distinct mesoscale AMCs. Our approach avoids the pitfalls of applying periodic boundary conditions to these fundamentally aperiodic systems or equating crystalline inclusions with conducting sites. We reproduce the previously reported dependence of charge conductance on morphology and explore the limitations of partial morphology descriptors in witnessing conductance properties. Finally, we perform crystallinity analysis of conductance networks along the electronic energy spectrum and show that they metamorphose from being localized on crystallites at band edges to localized on defects around the Fermi energy opening the possibility of control through gate voltage.
- 29 April 2025
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry Letters
- Vol. 16 (18) , 4522-4528
Disentangling Morphology and Conductance in Amorphous Graphene
Amorphous graphene or amorphous monolayer carbon (AMC) is a family of carbon films that exhibit a surprising sensitivity of electronic conductance to morphology. We combine deep learning-enhanced simulation techniques with percolation theory to analyze three morphologically distinct mesoscale AMCs. Our approach avoids the pitfalls of applying periodic boundary conditions to these fundamentally aperiodic systems or equating crystalline inclusions with conducting sites. We reproduce the previously reported dependence of charge conductance on morphology and explore the limitations of partial morphology descriptors in witnessing conductance properties. Finally, we perform crystallinity analysis of conductance networks along the electronic energy spectrum and show that they metamorphose from being localized on crystallites at band edges to localized on defects around the Fermi energy opening the possibility of control through gate voltage.
- Open Access
- 31 December 2024
- Published by American Chemical Society (ACS) in ACS Physical Chemistry Au
- Vol. 5 (1) , 3-16
Is the Future of Materials Amorphous? Challenges and Opportunities in Simulations of Amorphous Materials
Amorphous solids form an enormous and underutilized class of materials. In order to drive the discovery of new useful amorphous materials further we need to achieve a closer convergence between computational and experimental methods. In this review, we highlight some of the important gaps between computational simulations and experiments, discuss popular state-of-the-art computational techniques such as the Activation Relaxation Technique nouveau (ARTn) and Reverse Monte Carlo (RMC), and introduce more recent advances: machine learning interatomic potentials (MLIPs) and generative machine learning for simulations of amorphous matter (e.g., MAP). Examples are drawn from amorphous silicon and silica literature as well as from molecular glasses. Our outlook stresses the need for new computational methods to extend the time- and length-scales accessible through numerical simulations.
- 31 December 2024
- Published by American Chemical Society (ACS) in ACS Physical Chemistry Au
- Vol. 5 (1) , 3-16
Open AccessIs the Future of Materials Amorphous? Challenges and Opportunities in Simulations of Amorphous Materials
Amorphous solids form an enormous and underutilized class of materials. In order to drive the discovery of new useful amorphous materials further we need to achieve a closer convergence between computational and experimental methods. In this review, we highlight some of the important gaps between computational simulations and experiments, discuss popular state-of-the-art computational techniques such as the Activation Relaxation Technique nouveau (ARTn) and Reverse Monte Carlo (RMC), and introduce more recent advances: machine learning interatomic potentials (MLIPs) and generative machine learning for simulations of amorphous matter (e.g., MAP). Examples are drawn from amorphous silicon and silica literature as well as from molecular glasses. Our outlook stresses the need for new computational methods to extend the time- and length-scales accessible through numerical simulations.
- Top Cited Papers
- 16 December 2024
- Published by Springer Nature in Nature Reviews Materials
- Vol. 10 (3) , 228-241
The amorphous state as a frontier in computational materials design
- 16 December 2024
- Published by Springer Nature in Nature Reviews Materials
- Vol. 10 (3) , 228-241
Top Cited PapersThe amorphous state as a frontier in computational materials design
- 8 October 2024
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 161 (14)
Path-filtering in path-integral simulations of open quantum systems using GFlowNets
An important class of methods for modeling dynamics in open quantum systems is based on the well-known influence functional (IF) approach to solving path-integral equations of motion. Within this paradigm, path-filtering schemes based on the removal of IF elements that fall below a certain threshold aim to reduce the effort needed to calculate and store the influence functional, making very challenging simulations possible. A filtering protocol of this type is considered acceptable as long as the simulation remains mathematically stable. This, however, does not guarantee that the approximated dynamics preserve the physics of the simulated process. In this paper, we explore the possibility of training Generative Flow Networks (GFlowNets) to produce filtering protocols while optimizing for mathematical stability and for physical accuracy. Trained using the trajectory balance objective, the model produces sets of paths to be added to a truncated initial set; it is rewarded if the combined set of paths gives rise to solutions in which the trace of the density matrix is conserved, the populations remain real, and the dynamics approach the exact reference. Using a simple two-level system coupled to a dissipative reservoir, we perform proof-of-concept simulations and demonstrate the elegant and surprising filtering solutions proposed by the GFlowNet.
- 8 October 2024
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 161 (14)
Path-filtering in path-integral simulations of open quantum systems using GFlowNets
An important class of methods for modeling dynamics in open quantum systems is based on the well-known influence functional (IF) approach to solving path-integral equations of motion. Within this paradigm, path-filtering schemes based on the removal of IF elements that fall below a certain threshold aim to reduce the effort needed to calculate and store the influence functional, making very challenging simulations possible. A filtering protocol of this type is considered acceptable as long as the simulation remains mathematically stable. This, however, does not guarantee that the approximated dynamics preserve the physics of the simulated process. In this paper, we explore the possibility of training Generative Flow Networks (GFlowNets) to produce filtering protocols while optimizing for mathematical stability and for physical accuracy. Trained using the trajectory balance objective, the model produces sets of paths to be added to a truncated initial set; it is rewarded if the combined set of paths gives rise to solutions in which the trace of the density matrix is conserved, the populations remain real, and the dynamics approach the exact reference. Using a simple two-level system coupled to a dissipative reservoir, we perform proof-of-concept simulations and demonstrate the elegant and surprising filtering solutions proposed by the GFlowNet.
- 9 July 2024
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Modeling
- Vol. 64 (14) , 5617-5623
DeltaGzip: Computing Biopolymer–Ligand Binding Affinity via Kolmogorov Complexity and Lossless Compression
The design of biosequences for biosensing and therapeutics is a challenging multistep search and optimization task. In principle, computational modeling may speed up the design process by virtual screening of sequences based on their binding affinities to target molecules. However, in practice, existing machine-learned models trained to predict binding affinities lack the flexibility with respect to reaction conditions, and molecular dynamics simulations that can incorporate reaction conditions suffer from high computational costs. Here, we describe a computational approach called DeltaGzip that evaluates the free energy of binding in biopolymer-ligand complexes from ultrashort equilibrium molecular dynamics simulations. The entropy of binding is evaluated using the Kolmogorov complexity definition of entropy and approximated using a lossless compression algorithm, Gzip. We benchmark the method on a well-studied data set of protein-ligand complexes comparing the predictions of DeltaGzip to the free energies of binding obtained using Jarzynski equality and experimental measurements.
- 9 July 2024
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Modeling
- Vol. 64 (14) , 5617-5623
DeltaGzip: Computing Biopolymer–Ligand Binding Affinity via Kolmogorov Complexity and Lossless Compression
The design of biosequences for biosensing and therapeutics is a challenging multistep search and optimization task. In principle, computational modeling may speed up the design process by virtual screening of sequences based on their binding affinities to target molecules. However, in practice, existing machine-learned models trained to predict binding affinities lack the flexibility with respect to reaction conditions, and molecular dynamics simulations that can incorporate reaction conditions suffer from high computational costs. Here, we describe a computational approach called DeltaGzip that evaluates the free energy of binding in biopolymer-ligand complexes from ultrashort equilibrium molecular dynamics simulations. The entropy of binding is evaluated using the Kolmogorov complexity definition of entropy and approximated using a lossless compression algorithm, Gzip. We benchmark the method on a well-studied data set of protein-ligand complexes comparing the predictions of DeltaGzip to the free energies of binding obtained using Jarzynski equality and experimental measurements.
- Open Access
- 10 May 2024
- Published by American Chemical Society (ACS) in ChemRxiv
Truncations and in silico Docking to Enhance the Analytical Response of Aptamer-Based Biosensors
Aptamers are short oligonucleotides capable of binding specifically to various targets (i.e., small molecules, proteins, and whole cells) which have been introduced in biosensors such as in the electrochemical aptamer-based (E-AB) sensing platform. E-AB sensors are comprised of a redox-reporter-modified aptamer attached to an electrode that undergoes, upon target addition, a binding-induced change in electron transfer rates. To date, E-AB sensors have faced a limitation in the translatability of aptamers into the sensing platform presumably because sequences obtained from Systematic Evolution of Ligands by Exponential Enrichment (SELEX) are typically long (> 80 nucleotides) and that obtaining structural information remains time and resource consuming. In response, we explore the utility of aptamer base truncations and in silico docking to improve their translatability into E-AB sensors. Here, we first apply this to the glucose aptamer, which we characterize in solution using NMR methods to guide design and translate truncated variants in E-AB biosensors. We further investigated applicability of the truncation and computational approaches to five other aptamer systems (vancomycin, cocaine, methotrexate, theophylline, and ochratoxin A) from which we derived functional E-AB sensors. We foresee that our strategy will increase the success rate of translating aptamers into sensing platforms to afford low-cost measurements of molecules directly in undiluted complex matrices.
- 10 May 2024
- Published by American Chemical Society (ACS) in ChemRxiv
Open AccessTruncations and in silico Docking to Enhance the Analytical Response of Aptamer-Based Biosensors
Aptamers are short oligonucleotides capable of binding specifically to various targets (i.e., small molecules, proteins, and whole cells) which have been introduced in biosensors such as in the electrochemical aptamer-based (E-AB) sensing platform. E-AB sensors are comprised of a redox-reporter-modified aptamer attached to an electrode that undergoes, upon target addition, a binding-induced change in electron transfer rates. To date, E-AB sensors have faced a limitation in the translatability of aptamers into the sensing platform presumably because sequences obtained from Systematic Evolution of Ligands by Exponential Enrichment (SELEX) are typically long (> 80 nucleotides) and that obtaining structural information remains time and resource consuming. In response, we explore the utility of aptamer base truncations and in silico docking to improve their translatability into E-AB sensors. Here, we first apply this to the glucose aptamer, which we characterize in solution using NMR methods to guide design and translate truncated variants in E-AB biosensors. We further investigated applicability of the truncation and computational approaches to five other aptamer systems (vancomycin, cocaine, methotrexate, theophylline, and ochratoxin A) from which we derived functional E-AB sensors. We foresee that our strategy will increase the success rate of translating aptamers into sensing platforms to afford low-cost measurements of molecules directly in undiluted complex matrices.
- Open Access
- 6 March 2024
- Published by American Chemical Society (ACS) in ChemRxiv
DeltaGzip: Computing Biopolymer-Ligand Binding Affinity via Kolmogorov Complexity and Lossless Compression
The design of bio-sequences for biosensing and therapeutics is a challenging multi-step search and optimization task. In principle, computational modeling may speed up the design process by virtual screening of sequences based on their binding affinities to target molecules. However, in practice, existing machine-learned models trained to predict binding affinities lack the flexibility with respect to reaction conditions, and molecular dynamics simulations that can incorporate reaction conditions suffer from high computational costs. Here, we describe a computational approach called DeltaGzip that evaluates the free energy of binding in biopolymer-ligand complexes from ultra-short equilibrium molecular dynamics simulations. The entropy of binding is evaluated using the Kolmogorov complexity definition of entropy and approximated using a lossless compression algorithm, Gzip. We benchmark the method on a well-studied dataset of protein-ligand complexes comparing the predictions of DeltaGzip to the free energies of binding obtained using the Jarzynski equality and experimental measurements.
- 6 March 2024
- Published by American Chemical Society (ACS) in ChemRxiv
Open AccessDeltaGzip: Computing Biopolymer-Ligand Binding Affinity via Kolmogorov Complexity and Lossless Compression
The design of bio-sequences for biosensing and therapeutics is a challenging multi-step search and optimization task. In principle, computational modeling may speed up the design process by virtual screening of sequences based on their binding affinities to target molecules. However, in practice, existing machine-learned models trained to predict binding affinities lack the flexibility with respect to reaction conditions, and molecular dynamics simulations that can incorporate reaction conditions suffer from high computational costs. Here, we describe a computational approach called DeltaGzip that evaluates the free energy of binding in biopolymer-ligand complexes from ultra-short equilibrium molecular dynamics simulations. The entropy of binding is evaluated using the Kolmogorov complexity definition of entropy and approximated using a lossless compression algorithm, Gzip. We benchmark the method on a well-studied dataset of protein-ligand complexes comparing the predictions of DeltaGzip to the free energies of binding obtained using the Jarzynski equality and experimental measurements.