1996
DOI: 10.1016/s0166-1280(96)90553-9
|View full text |Cite
|
Sign up to set email alerts
|

Conformer clustering algorithm and its application for crown-type macrocycles

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

1998
1998
2010
2010

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…1,2 A number of well-documented methods exist for clustering conformations. [3][4][5][6] Nearly all of these are based on some kind of distance measure between pairs of conformers, using either the distance matrix or a selection of dihedral angles. The most popular clustering methods for conformational selection are based on the hierarchical and Jarvis-Patrick schemes.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…1,2 A number of well-documented methods exist for clustering conformations. [3][4][5][6] Nearly all of these are based on some kind of distance measure between pairs of conformers, using either the distance matrix or a selection of dihedral angles. The most popular clustering methods for conformational selection are based on the hierarchical and Jarvis-Patrick schemes.…”
Section: Introductionmentioning
confidence: 99%
“…The word clustering generally implies the identification of groups such that the similarities within the groups are significantly greater than those between the groups. , A number of well-documented methods exist for clustering conformations. Nearly all of these are based on some kind of distance measure between pairs of conformers, using either the distance matrix or a selection of dihedral angles. The most popular clustering methods for conformational selection are based on the hierarchical and Jarvis−Patrick schemes.…”
Section: Introductionmentioning
confidence: 99%
“…Finding an adequate stop criterion for the hierarchical clustering is a difficult problem. Many criterions are based on an arbitrary fixed critical distance threshold, , or calculate F as the ratio of the sample variance between clusters to that within clusters, and then calculate the probability of F to exceed a fixed probability level . The optimal selection of such arbitrary values is difficult to do in a virtual screening context.…”
Section: Methodsmentioning
confidence: 99%
“…6 This approach may lose some important information about local states and transitions between them. 7,8 For this reason, some new approaches based on network method 5,7,[9][10][11][12][13][14][15][16][17] and graph theory 2,4,8,18,19 have been developed to investigate the freeenergy surface of peptides and protein. 20 For examples, Duan and Kollman 9 developed a clustering method to analyze a 1-ms simulation trajectory of the 36-residue peptide (HP-36).…”
Section: Introductionmentioning
confidence: 99%