AI Article Synopsis

  • This paper introduces a new simulation technique called tree search molecular dynamics (TS-MD) that enhances the process of exploring conformational changes in molecules, which usually takes a lot of computational resources.
  • In TS-MD, a reinforcement learning-based algorithm known as upper confidence bounds for trees is utilized to intelligently sample transition pathways by learning from earlier simulation results.
  • The results show that TS-MD outperforms the current leading method, parallel cascade selection molecular dynamics, especially for the folding processes of two small proteins—Chignolin and Trp-cage—in water.

Article Abstract

This paper proposes a novel molecular simulation method, called tree search molecular dynamics (TS-MD), to accelerate the sampling of conformational transition pathways, which require considerable computation. In TS-MD, a tree search algorithm, called upper confidence bounds for trees, which is a type of reinforcement learning algorithm, is applied to sample the transition pathway. By learning from the results of the previous simulations, TS-MD efficiently searches conformational space and avoids being trapped in local stable structures. TS-MD exhibits better performance than parallel cascade selection molecular dynamics, which is one of the state-of-the-art methods, for the folding of miniproteins, Chignolin and Trp-cage, in explicit water.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC6714528PMC
http://dx.doi.org/10.1021/acsomega.9b01480DOI Listing

Publication Analysis

Top Keywords

tree search
12
molecular dynamics
12
reinforcement learning
8
search molecular
8
simulation method
8
enhancing biomolecular
4
biomolecular sampling
4
sampling reinforcement
4
learning tree
4
molecular
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!