A Companion Guide to the String Method with Swarms of Trajectories: Characterization, Performance, and Pitfalls

by Chen, Haochuan; Ogden, Dylan; Pant, Shashank; Cai, Wensheng; Tajkhorshid, Emad; Moradi, Mahmoud; Roux, Benoit; Chipot, Christophe

The string method with swarms of trajectories (SMwST) is an algorithm that identifies a physically meaningful transition pathway-a one-dimensional curve, embedded within a high-dimensional space of selected collective variables. The SMwST algorithm leans on a series of short, unbiased molecular dynamics simulations spawned at different locations of the discretized path, from whence an average dynamic drift is determined to evolve the string toward an optimal pathway. However conceptually simple in both its theoretical formulation and practical implementation, the SMwST algorithm is computationally intensive and requires a careful choice of parameters for optimal costeffectiveness in applications to challenging problems in chemistry and biology. In this contribution, the SMwST algorithm is presented in a self-contained manner, discussing with a critical eye its theoretical underpinnings, applicability, inherent limitations, and use in the context of path-following free-energy calculations and their possible extension to kinetics modeling. Through multiple simulations of a prototypical polypeptide, combining the search of the transition pathway and the computation of the potential of mean force along it, several practical aspects of the methodology are examined with the objective of optimizing the computational effort, yet without sacrificing accuracy. In light of the results reported here, we propose some general guidelines aimed at improving the efficiency and reliability of the computed pathways and free-energy profiles underlying the conformational transitions at hand.

Journal of Chemical Theory and Computation
Start Page
1549-9626; 1549-9618