The comparison of automated clustering algorithms for resampling representative conformer ensembles with RMSD matrix
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Hyoungrae | - |
dc.contributor.author | Jang, Cheongyun | - |
dc.contributor.author | Yadav, Dharmendra K. | - |
dc.contributor.author | Kim, Mi-hyun | - |
dc.date.available | 2020-02-27T19:42:10Z | - |
dc.date.created | 2020-02-06 | - |
dc.date.issued | 2017-03-23 | - |
dc.identifier.issn | 1758-2946 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/6307 | - |
dc.description.abstract | Background: The accuracy of any 3D-QSAR, Pharmacophore and 3D-similarity based chemometric target fishing models are highly dependent on a reasonable sample of active conformations. Since a number of diverse conformational sampling algorithm exist, which exhaustively generate enough conformers, however model building methods relies on explicit number of common conformers. Results: In this work, we have attempted to make clustering algorithms, which could find reasonable number of representative conformer ensembles automatically with asymmetric dissimilarity matrix generated from openeye tool kit. RMSD was the important descriptor (variable) of each column of the N x N matrix considered as N variables describing the relationship (network) between the conformer (in a row) and the other N conformers. This approach used to evaluate the performance of the well-known clustering algorithms by comparison in terms of generating representative conformer ensembles and test them over different matrix transformation functions considering the stability. In the network, the representative conformer group could be resampled for four kinds of algorithms with implicit parameters. The directed dissimilarity matrix becomes the only input to the clustering algorithms. Conclusions: Dunn index, Davies-Bouldin index, Eta-squared values and omega-squared values were used to evaluate the clustering algorithms with respect to the compactness and the explanatory power. The evaluation includes the reduction (abstraction) rate of the data, correlation between the sizes of the population and the samples, the computational complexity and the memory usage as well. Every algorithm could find representative conformers automatically without any user intervention, and they reduced the data to 14-19% of the original values within 1.13 s per sample at the most. The clustering methods are simple and practical as they are fast and do not ask for any explicit parameters. RCDTC presented the maximum Dunn and omega-squared values of the four algorithms in addition to consistent reduction rate between the population size and the sample size. The performance of the clustering algorithms was consistent over different transformation functions. Moreover, the clustering method can also be applied to molecular dynamics sampling simulation results. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | BIOMED CENTRAL LTD | - |
dc.relation.isPartOf | JOURNAL OF CHEMINFORMATICS | - |
dc.subject | DERIVATIVES | - |
dc.subject | GENERATION | - |
dc.subject | INHIBITORS | - |
dc.subject | MOLECULES | - |
dc.subject | OPTIMIZE | - |
dc.subject | DOCKING | - |
dc.subject | 3D-QSAR | - |
dc.subject | MODELS | - |
dc.subject | TOOLS | - |
dc.title | The comparison of automated clustering algorithms for resampling representative conformer ensembles with RMSD matrix | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.description.journalClass | 1 | - |
dc.identifier.wosid | 000397665500001 | - |
dc.identifier.doi | 10.1186/s13321-017-0208-0 | - |
dc.identifier.bibliographicCitation | JOURNAL OF CHEMINFORMATICS, v.9 | - |
dc.identifier.scopusid | 2-s2.0-85016130603 | - |
dc.citation.title | JOURNAL OF CHEMINFORMATICS | - |
dc.citation.volume | 9 | - |
dc.contributor.affiliatedAuthor | Kim, Mi-hyun | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | Conformer ensemble | - |
dc.subject.keywordAuthor | 3D shape-based alignment | - |
dc.subject.keywordAuthor | k-Means clustering of multidimensional scaled RMSD values (RCKmeans) | - |
dc.subject.keywordAuthor | Hierarchical clustering with dynamic tree cut (RCDT) | - |
dc.subject.keywordAuthor | Linear kernel PCA (RCPCA) | - |
dc.subject.keywordAuthor | Nonlinear kernel PCA (RCPCA_ RBF) | - |
dc.subject.keywordPlus | DERIVATIVES | - |
dc.subject.keywordPlus | GENERATION | - |
dc.subject.keywordPlus | INHIBITORS | - |
dc.subject.keywordPlus | MOLECULES | - |
dc.subject.keywordPlus | OPTIMIZE | - |
dc.subject.keywordPlus | DOCKING | - |
dc.subject.keywordPlus | 3D-QSAR | - |
dc.subject.keywordPlus | MODELS | - |
dc.subject.keywordPlus | TOOLS | - |
dc.relation.journalResearchArea | Chemistry | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Chemistry, Multidisciplinary | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
1342, Seongnam-daero, Sujeong-gu, Seongnam-si, Gyeonggi-do, Republic of Korea(13120)031-750-5114
COPYRIGHT 2020 Gachon University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.