Griffiths Matthew, Niblett Samuel P, Wales David J
Department of Chemistry, University of Cambridge , Lensfield Road, Cambridge CB2 1EW, United Kingdom.
J Chem Theory Comput. 2017 Oct 10;13(10):4914-4931. doi: 10.1021/acs.jctc.7b00543. Epub 2017 Sep 14.
Finding the optimal alignment between two structures is important for identifying the minimum root-mean-square distance (RMSD) between them and as a starting point for calculating pathways. Most current algorithms for aligning structures are stochastic, scale exponentially with the size of structure, and the performance can be unreliable. We present two complementary methods for aligning structures corresponding to isolated clusters of atoms and to condensed matter described by a periodic cubic supercell. The first method (Go-PERMDIST), a branch and bound algorithm, locates the global minimum RMSD deterministically in polynomial time. The run time increases for larger RMSDs. The second method (FASTOVERLAP) is a heuristic algorithm that aligns structures by finding the global maximum kernel correlation between them using fast Fourier transforms (FFTs) and fast SO(3) transforms (SOFTs). For periodic systems, FASTOVERLAP scales with the square of the number of identical atoms in the system, reliably finds the best alignment between structures that are not too distant, and shows significantly better performance than existing algorithms. The expected run time for Go-PERMDIST is longer than FASTOVERLAP for periodic systems. For finite clusters, the FASTOVERLAP algorithm is competitive with existing algorithms. The expected run time for Go-PERMDIST to find the global RMSD between two structures deterministically is generally longer than for existing stochastic algorithms. However, with an earlier exit condition, Go-PERMDIST exhibits similar or better performance.
找到两个结构之间的最优比对对于确定它们之间的最小均方根距离(RMSD)以及作为计算路径的起点非常重要。当前大多数用于比对结构的算法都是随机的,随着结构大小呈指数级增长,并且性能可能不可靠。我们提出了两种互补的方法,用于比对对应于孤立原子簇和由周期性立方超胞描述的凝聚态物质的结构。第一种方法(Go - PERMDIST)是一种分支定界算法,能在多项式时间内确定性地找到全局最小RMSD。运行时间会随着RMSD增大而增加。第二种方法(FASTOVERLAP)是一种启发式算法,通过使用快速傅里叶变换(FFT)和快速SO(3)变换(SOFT)找到它们之间的全局最大核相关性来比对结构。对于周期性系统,FASTOVERLAP与系统中相同原子数量的平方成正比,能可靠地找到不太遥远的结构之间的最佳比对,并且表现出比现有算法显著更好的性能。对于周期性系统,Go - PERMDIST的预期运行时间比FASTOVERLAP长。对于有限簇,FASTOVERLAP算法与现有算法具有竞争力。Go - PERMDIST确定性地找到两个结构之间全局RMSD的预期运行时间通常比现有随机算法长。然而,通过一个更早的退出条件,Go - PERMDIST表现出相似或更好的性能。