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

Cluster Sampling Method01:20

Cluster Sampling Method

11.6K
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...
11.6K
Column Efficiency: Rate Theory01:12

Column Efficiency: Rate Theory

238
The rate theory of chromatography provides quantitative insight into the shapes and widths of elution bands. These bands are based on the random-walk mechanism governing molecular migration within a column. The Gaussian profile of chromatographic bands arises from the cumulative effect of random molecular motions as they progress through the column.
During elution, a solute molecule experiences numerous transitions between stationary and mobile phases, exhibiting irregular residence times in...
238
Heuristics01:21

Heuristics

64
Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
64
The Availability Heuristic01:08

The Availability Heuristic

5.9K
A heuristic is a general problem-solving framework (Tversky & Kahneman, 1974). You can think of these as mental shortcuts that are used to solve problems. Different types of heuristics are used in different types of situations, and the impulse to use a heuristic occurs when one of five conditions is met (Pratkanis, 1989):
5.9K
Sampling Plans01:23

Sampling Plans

163
Sampling is a crucial step in analytical chemistry, allowing researchers to collect representative data from a large population. Common sampling methods include random, judgmental, systematic, stratified, and cluster sampling.
Random sampling is a method where each member of the population has an equal chance of being selected for the sample. It involves selecting individuals randomly, often using random number generators or lottery-type methods. For example, when analyzing the properties of a...
163
Randomized Experiments01:13

Randomized Experiments

6.7K
The randomization process involves assigning study participants randomly to experimental or control groups based on their probability of being equally assigned. Randomization is meant to eliminate selection bias and balance known and unknown confounding factors so that the control group is similar to the treatment group as much as possible. A computer program and a random number generator can be used to assign participants to groups in a way that minimizes bias.
Simple randomization
Simple...
6.7K

You might also read

Related Articles

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

Sort by
Same author

Deep Learning-Driven Saccharide Online Sequencing for Elucidating the Pathological Alterations of Heparan Sulfate in APAP-Induced Acute Liver Injury.

Analytical chemistry·2026
Same author

Pathway Representation via Intrinsic Structural Medoids (PRISM): A Structural Mapping Approach to Clustering Molecular Pathways.

bioRxiv : the preprint server for biology·2026
Same author

A New Family of Seniority-Restricted Coupled Cluster Methods.

The journal of physical chemistry. A·2026
Same author

Exploring New Construction Schemes for Extended-Hierarchy Configuration-Interaction Wave Functions.

The journal of physical chemistry. A·2026
Same author

Efficient exploration of peptide libraries using active learning with AlphaFold-based screening.

bioRxiv : the preprint server for biology·2026
Same author

Scaling <i>k</i>-Means for Multi-Million Frames: A Stratified NANI Approach for Large-Scale MD Simulations.

Journal of chemical information and modeling·2026
Same journal

Genetic Impacts on Variability of Body Fat Distribution Uncover Gene-Environment and Gene-Gene Interactions.

bioRxiv : the preprint server for biology·2026
Same journal

16S ribosomal RNA modification drives transcript-specific translation efficiency.

bioRxiv : the preprint server for biology·2026
Same journal

FlcE latches onto the FliL-stator complex to turbocharge flagellar motility in <i>Borrelia burgdorferi</i>.

bioRxiv : the preprint server for biology·2026
Same journal

Synaptic pruning, myelination and the emergence of psychiatric disorders in late adolescence.

bioRxiv : the preprint server for biology·2026
Same journal

Structural and functional insights into the Rcs phosphorelay.

bioRxiv : the preprint server for biology·2026
Same journal

The structural basis of RanGAP1 regulation and catalysis in nuclear transport.

bioRxiv : the preprint server for biology·2026
See all related articles

Related Experiment Video

Updated: May 23, 2025

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

6.9K

CADENCE: Clustering Algorithm - Density-based Exploration and Novelty Clustering with Efficiency.

Lexin Chen1,2, Daniel R Roe3, Ramón Alain Miranda-Quintana1,2

  • 1Department of Chemistry, University of Florida, Gainesville, Florida 32611, USA.

Biorxiv : the Preprint Server for Biology
|March 10, 2025
PubMed
Summary
This summary is machine-generated.

This study introduces a novel density clustering algorithm using n-ary similarity for molecular dynamics analysis. It enhances protein folding landscape exploration and identifies key conformations efficiently.

Keywords:
algorithmscluster chemistrymolecular simulation

More Related Videos

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

11.3K
Novel Object Exploration as a Potential Assay for Higher Order Repetitive Behaviors in Mice
08:28

Novel Object Exploration as a Potential Assay for Higher Order Repetitive Behaviors in Mice

Published on: August 20, 2016

8.3K

Related Experiment Videos

Last Updated: May 23, 2025

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

6.9K
ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

11.3K
Novel Object Exploration as a Potential Assay for Higher Order Repetitive Behaviors in Mice
08:28

Novel Object Exploration as a Potential Assay for Higher Order Repetitive Behaviors in Mice

Published on: August 20, 2016

8.3K

Area of Science:

  • Computational chemistry and biophysics
  • Machine learning applications in molecular dynamics

Background:

  • Unsupervised learning is crucial for analyzing complex molecular dynamics data, including protein folding and drug binding.
  • Current clustering methods face performance issues due to pairwise similarity limitations, hindering the effective identification of metastable states.
  • Efficient algorithms like k-means struggle with complex landscapes, while density-based methods are computationally intensive.

Purpose of the Study:

  • To introduce a novel density clustering algorithm based on n-ary similarity.
  • To enhance the Molecular Dynamics Analysis with N-ary Clustering Ensembles (MDANCE) software package.
  • To overcome limitations of traditional clustering methods in analyzing molecular dynamics data.

Main Methods:

  • Development of a novel density clustering algorithm utilizing an n-ary similarity framework.
  • Integration of the new algorithm into the MDANCE software package.
  • Leveraging extended similarity techniques for linear time complexity O(N) analysis.

Main Results:

  • The new algorithm efficiently identifies high and low-density regions in complex conformational landscapes.
  • Enables focused exploration of rare events and identification of representative conformations (e.g., medoids).
  • Addresses performance bottlenecks associated with traditional pairwise similarity calculations.

Conclusions:

  • The developed n-ary density clustering algorithm offers a computationally efficient and robust approach for molecular dynamics analysis.
  • This advancement facilitates a deeper understanding of protein folding landscapes and molecular interactions.
  • The MDANCE package is enhanced, providing researchers with improved tools for complex data exploration.