Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Distribution of Molecular Speeds01:27

Distribution of Molecular Speeds

The motion of molecules in a gas is random in magnitude and direction for individual molecules, but a gas of many molecules has a predictable distribution of molecular speeds. This predictable distribution of molecular speeds is known as the Maxwell-Boltzmann distribution. The distribution of molecular speeds in liquids is comparable to that of gases but not identical and can help to understand the phenomenon of the boiling and vapor pressure of a liquid. Consider that a molecule requires a...
Molecular Models02:00

Molecular Models

Physical models representing molecular architectures of chemical compounds play essential roles in understanding chemistry. The use of molecular models makes it easier to visualize the structures and shapes of atoms and molecules.
Cluster Sampling Method01:20

Cluster Sampling Method

Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

From delocalized orbitals to Lewis structures: Trade-offs in the imperfect art of chemical bonding analysis.

The Journal of chemical physics·2026
Same author

Navigating the Electronic Grand Potential Surface with Analytical Nuclear Derivatives of Grand-Canonical Density-Functional Theory.

Journal of chemical theory and computation·2025
Same author

Linking DNA-packing density distribution and TAD boundary locations.

Proceedings of the National Academy of Sciences of the United States of America·2025
Same author

Natural Fragment Bond Orbital Method for Interfragment Bonding Interaction Analysis.

Journal of the American Chemical Society·2024
Same author

Fragment Aligned Molecular Orbital Analysis: An Innovative Tool for Analyzing Atypical Chemical Bonding.

Journal of chemical theory and computation·2024
Same author

Marriage of High-Throughput Gradient Surface Generation With Statistical Learning for the Rational Design of Functionalized Biomaterials.

Advanced materials (Deerfield Beach, Fla.)·2023

Related Experiment Video

Updated: May 18, 2026

Structure-Based Simulation and Sampling of Transcription Factor Protein Movements along DNA from Atomic-Scale Stepping to Coarse-Grained Diffusion
09:17

Structure-Based Simulation and Sampling of Transcription Factor Protein Movements along DNA from Atomic-Scale Stepping to Coarse-Grained Diffusion

Published on: March 1, 2022

A fast parallel clustering algorithm for molecular simulation trajectories.

Yutong Zhao1, Fu Kit Sheong, Jian Sun

  • 1Department of Chemistry, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong.

Journal of Computational Chemistry
|September 22, 2012
PubMed
Summary

We developed a faster GPU-powered k-centers algorithm for clustering molecular dynamics (MD) simulations. This method significantly accelerates analysis, revealing correlations between simulation data clusters and underlying densities.

More Related Videos

Spatial Separation of Molecular Conformers and Clusters
10:37

Spatial Separation of Molecular Conformers and Clusters

Published on: January 9, 2014

Related Experiment Videos

Last Updated: May 18, 2026

Structure-Based Simulation and Sampling of Transcription Factor Protein Movements along DNA from Atomic-Scale Stepping to Coarse-Grained Diffusion
09:17

Structure-Based Simulation and Sampling of Transcription Factor Protein Movements along DNA from Atomic-Scale Stepping to Coarse-Grained Diffusion

Published on: March 1, 2022

Spatial Separation of Molecular Conformers and Clusters
10:37

Spatial Separation of Molecular Conformers and Clusters

Published on: January 9, 2014

Area of Science:

  • Computational Biology
  • Biophysics
  • Algorithm Development

Background:

  • Molecular dynamics (MD) simulations generate large datasets of molecular conformations.
  • Efficient clustering algorithms are crucial for analyzing these complex datasets.
  • Existing CPU-based methods can be computationally intensive and slow.

Purpose of the Study:

  • To develop and implement a GPU-powered parallel k-centers algorithm for efficient clustering of MD simulation data.
  • To significantly improve the speed of clustering compared to traditional CPU implementations.
  • To analyze the performance and effectiveness of the algorithm across various protein systems.

Main Methods:

  • Implementation of a GPU-accelerated parallel k-centers algorithm.
  • Utilizing the triangle inequality property of metric spaces for optimization.
  • Testing on diverse protein MD simulation datasets, including Alanine Dipeptide and Maltose Binding Protein (MBP).
  • Analysis of algorithm runtime scalability with respect to the number of cluster centers.

Main Results:

  • The GPU-powered algorithm achieves speedups of up to two orders of magnitude over CPU implementations.
  • Successfully clustered 250,000 conformations of MBP into 4000 clusters in under 40 seconds.
  • Demonstrated linear runtime complexity concerning the number of cluster centers.
  • Observed reduced effectiveness of triangle inequality in higher dimensions, with a provided mathematical explanation.
  • Showcased a strong correlation between k-centers cluster populations and underlying density using Alanine Dipeptide.

Conclusions:

  • The GPU-parallel k-centers algorithm offers a highly efficient solution for clustering large-scale MD simulation data.
  • The algorithm's performance is significantly enhanced by GPU parallelization and metric space properties.
  • The findings provide valuable insights into the relationship between simulation conformations, clustering, and molecular density.