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

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...
Parallel Processing01:20

Parallel Processing

The brain processes sensory information rapidly due to parallel processing, which involves sending data across multiple neural pathways at the same time. This method allows the brain to manage various sensory qualities, such as shapes, colors, movements, and locations, all concurrently. For instance, when observing a forest landscape, the brain simultaneously processes the movement of leaves, the shapes of trees, the depth between them, and the various shades of green. This enables a quick and...
Maximum Size of Aggregate01:12

Maximum Size of Aggregate

The maximum size of aggregate is defined as the aperture of the sieve retaining 15 percent or more of the particles present in the aggregate sample. The aggregate's maximum size impacts the concrete's water requirement, workability, and strength. Larger aggregates reduce the surface area needing cement paste coverage, which can lower water needs, thereby allowing a decrease in the water-to-cement ratio when the desired workability and richness of the mix are to be maintained, which can result...
Extraction: Partition and Distribution Coefficients01:14

Extraction: Partition and Distribution Coefficients

The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an organic...
Extraction: Advanced Methods00:56

Extraction: Advanced Methods

Metal ions can be separated from one another by complexation with organic ligands–the chelating agent– to form uncharged chelates. Here, the chelating agent must contain hydrophobic groups and behave as a weak acid, losing a proton to bind with the metal. Since most organic ligands used in this process are insoluble or undergo oxidation in the aqueous phase, the chelating agent is initially added to the organic phase and extracted into the aqueous phase. The metal-ligand complex is formed in...
Statistical Software for Data Analysis and Clinical Trials01:12

Statistical Software for Data Analysis and Clinical Trials

Statistical software is pivotal in data analysis and clinical trials by providing tools to analyze data, draw conclusions, and make predictions. These software packages range from simple data management applications to complex analytical platforms, supporting various statistical tests, models, and simulation techniques. Their significance lies in their ability to handle vast amounts of data with precision and efficiency, enabling researchers to validate hypotheses, identify trends, and make...

You might also read

Related Articles

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

Sort by
Same author

A Dataset of Benchmark Boolean Models for Gene Regulatory Networks.

Scientific data·2026
Same author

Identification of ordinal relations and alternative suborders within high-dimensional molecular data.

Frontiers in bioinformatics·2025
Same author

Integrated, Cross-Entity Information on Preventive Measures for Bowel, Breast, and Prostate Cancer: Evaluation Study of the Web Application "Prevent-Take-Up".

JMIR cancer·2025
Same author

A novel quantum algorithm for efficient attractor search in gene regulatory networks.

Patterns (New York, N.Y.)·2025
Same author

CLL to Richter syndrome: Integrating network strategies with experiments elucidating disease drivers and personalized therapies.

Science advances·2025
Same author

Uncovering the Understanding of the Concept of Patient Similarity in Cancer Research and Treatment: Scoping Review.

Journal of medical Internet research·2025
Same journal

OpenIMC: an open-source platform for analyzing single-cell and spatial proteomics by imaging mass cytometry.

BMC bioinformatics·2026
Same journal

NAP: an open source pipeline for cross-domain microbiome profiling using Nanopore sequencing-derived amplicon data.

BMC bioinformatics·2026
Same journal

SurvGME: an R package for survival analysis with graphical and measurement error models.

BMC bioinformatics·2026
Same journal

SimMapNet: a Bayesian framework for gene regulatory network inference using gene ontology similarities as external hint.

BMC bioinformatics·2026
Same journal

Dual channel drug-drug interactions extraction based on cross attention.

BMC bioinformatics·2026
Same journal

FeSseqdb: a curated sequence-level database and interpretable machine learning framework for identifying iron-sulfur proteins.

BMC bioinformatics·2026
See all related articles

Related Experiment Video

Updated: Jun 14, 2026

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

A highly efficient multi-core algorithm for clustering extremely large datasets.

Johann M Kraus1, Hans A Kestler

  • 1Institute of Neural Information Processing, University of Ulm, 89069 Ulm, Germany.

BMC Bioinformatics
|April 8, 2010
PubMed
Summary
This summary is machine-generated.

Parallelizing clustering algorithms on multi-core processors significantly speeds up analysis of large biological datasets. This approach enhances computational efficiency for tasks like gene expression and SNP data analysis without sacrificing accuracy.

More Related Videos

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

Related Experiment Videos

Last Updated: Jun 14, 2026

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

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

Area of Science:

  • Computational Biology
  • Bioinformatics
  • High-Throughput Data Analysis

Background:

  • Increasing data volumes from microarray and high-throughput technologies necessitate greater computational power in biology.
  • Traditional data analysis algorithms require parallelization for efficient processing.
  • Network-based parallelization methods are often complex and resource-intensive.

Purpose of the Study:

  • To develop and evaluate multi-core parallelization strategies for clustering algorithms.
  • To leverage shared-memory capabilities of modern processors for biological data analysis.
  • To improve the speed and efficiency of clustering gene expression and SNP data.

Main Methods:

  • Implementation of multi-core parallelization for k-means and k-modes clustering algorithms.
  • Application of transactional memory design principles.
  • Utilizing shared memory parallelism on multi-core processors.
  • Testing with gene expression microarray and categorical SNP data.

Main Results:

  • Achieved a 10-fold increase in computation speed for large datasets compared to single-core implementations.
  • Demonstrated high efficiency and preserved computational accuracy.
  • Validated utility in cluster stability and sensitivity analysis.
  • Outperformed a recently published network-based parallelization method.

Conclusions:

  • Modern multi-core processors enable efficient parallelization of complex bioinformatics tasks.
  • Multi-core algorithms allow for laborious analyses like cluster sensitivity estimation on standard laboratory computers.
  • This approach offers a practical solution for accelerating biological data analysis.