4.4 Article

Self-organizing superimposition algorithm for conformational sampling

Journal

JOURNAL OF COMPUTATIONAL CHEMISTRY
Volume 28, Issue 7, Pages 1234-1239

Publisher

WILEY
DOI: 10.1002/jcc.20622

Keywords

self-organizing superimposition; self-organization; self-organizing; conformational sampling; conformational analysis; distance geometry; molecular fragment; superimposition; stochastic proximity embedding

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available