Review article · Jul 2013
Conference abstractPublished 19 Jul 2021
Overcoming the heuristic nature of K-means clustering: Identification and characterization of binding modes from simulations of molecular recognition complexes
California State University Long Beach, USA
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
States in computational data is a non-trivial problem, particularly when the number of states is unknown a priori and for large, flexible chemical systems and complexes. To this end, we report a novel clustering protocol that combines high-resolution structural representation, brute-force repeat clustering, and optimization of clustering statistics to reproducibly identify the number of clusters present in a data set (k) for simulated ensembles of Butyrylcholinesterase in complex with two previously studied organophosphate inhibitors. Each structure within our simulated ensembles was depicted as a high-dimensionality vector with components defined by specific protein-inhibitor contacts at the chemical group level and the magnitudes of these components defined by their respective extents of pair-wise atomic contact, thus allowing for algorithmic differentiation between varying degrees of interaction. These surface-weighted interaction fingerprints were tabulated for each of over one million structures from more than 100 μs The accurate and reproducible detection and description of thermodynamic of all-atom molecular dynamics simulation per complex and used as input for repetitive k-means clustering. Minimization of cluster population variance and range afforded accurate and reproducible identification of k, thereby allowing for the characterization of discrete binding modes from molecular simulation data in the form of contact tables that concisely encapsulate the observed intermolecular contact motifs. While the protocol presented herein to determine k and achieve non-heuristic clustering is demonstrated on data from massive atomistic simulation, our approach is generalizable to other data types and clustering algorithms, and is tractable with limited computational resources.
Subjects
Biochemistry & BiotechnologyAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Conference abstract · 6 Dec 2017
The identification, binding mode and prospective chemical structural features of NS3 helicase inhibitors as potential anti-Zika virus drugs: Insights from comprehensive molecular and thermodynamic simulations
Mini review · 26 Nov 2022
CT Images of Pyogenic and Amoebic Liver Abscess with K-Means Clustering: An Application of Image Processing In Medical Emergency
Editorial · 2021
Early-Stage Multiple Brain Tumor Detection and Localization Using A Hybrid Technique of Patch-Based Processing, K-Means Clustering, and Object Counting
Research article · 12 Dec 2018
A review on optimized K-means and FCM clustering techniques for biomedical image segmentation using level set formulation
More from this journal
The newest in Journal of Bioprocessing & Biotechniques.
Commentary · 29 Nov 2025
Bioseparation Evolution: Enhanced Efficiency and Selectivity
Commentary · 29 Nov 2025
Advancing Bioprocess Scale-Down: Technologies for Optimization
Brief report · 29 Nov 2025
Bioprocessing Sustainable Packaging Biomaterials: A Review
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalJournal of Bioprocessing & Biotechniques
- SubjectBiochemistry & Biotechnology
- BylineArticles whose byline prints “Eric J Sorin”

