Next, we coarse-grain this summary trajectory by extracting 20 equally distant frames in RMSD space using a Monte Carlo approach (Figure ), and kinks/loops in the trajectory, corresponding to kinetic traps, are detected and removed using Dijkstra's algorithm. This rough trajectory is then smoothed to achieve as close to 1.5 Å spacing as possible between adjacent frames, with frames added or removed when needed. New frames are derived by linear interpolation in the same fashion as done in the string method with optimal molecular alignment (Figure ). This set of waypoints forms what we call the "summary path".