Enhancing Biomolecular Sampling with Reinforcement Learning: A Tree Search Molecular Dynamics Simulation Method
Author(s) -
Shin Kento,
Duy Phuoc Tran,
Kazuhiro Takemura,
Akio Kitao,
Kei Terayama,
Koji Tsuda
Publication year - 2019
Publication title -
acs omega
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.779
H-Index - 40
ISSN - 2470-1343
DOI - 10.1021/acsomega.9b01480
Subject(s) - molecular dynamics , reinforcement learning , computer science , tree (set theory) , folding (dsp implementation) , sampling (signal processing) , computation , cascade , tree structure , algorithm , theoretical computer science , chemistry , artificial intelligence , computational chemistry , mathematics , binary tree , combinatorics , engineering , filter (signal processing) , chromatography , electrical engineering , computer vision
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom