期刊
JOURNAL OF COMPUTATIONAL CHEMISTRY
卷 28, 期 7, 页码 1234-1239出版社
WILEY
DOI: 10.1002/jcc.20622
关键词
self-organizing superimposition; self-organization; self-organizing; conformational sampling; conformational analysis; distance geometry; molecular fragment; superimposition; stochastic proximity embedding
A novel self-organizing algorithm for conformational sampling is introduced, in which precomputed conformations of rigid fragments are used as templates to enforce the desired geometry. Starting from completely random coordinates, the algorithm repeatedly superimposes the templates to adjust the positions of the atoms, thereby gradually refining the conformation of the molecule. Combined with pair-wise adjustments of the atoms to resolve steric clashes, conformations that satisfy all geometric constraints can be generated from this procedure. The algorithm is demonstrated to achieve good performance and promises potential applications on more challenging modeling problems. (C) 2007 Wiley Periodicals, Inc.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据