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

Parallel-axis Theorem01:06

Parallel-axis Theorem

8.5K
The parallel-axis theorem provides a convenient and quick method of finding the moment of inertia of an object about an axis parallel to the axis passing through its center of mass. Consider a thin rod as an example. There is a striking similarity between the process of finding the moment of inertia of a thin rod about an axis through its middle, where the center of mass lies, and about an axis through its end using the conventional method. In the conventional method, the concept of linear mass...
8.5K
Cluster Sampling Method01:20

Cluster Sampling Method

15.4K
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...
15.4K
Lattice Centering and Coordination Number02:33

Lattice Centering and Coordination Number

14.3K
The structure of a crystalline solid, whether a metal or not, is best described by considering its simplest repeating unit, which is referred to as its unit cell. The unit cell consists of lattice points that represent the locations of atoms or ions. The entire structure then consists of this unit cell repeating in three dimensions. The three different types of unit cells present in the cubic lattice are illustrated in Figure 1.
Types of Unit Cells
Imagine taking a large number of identical...
14.3K
Distributed Loads: Problem Solving01:21

Distributed Loads: Problem Solving

1.2K
Beams are structural elements commonly employed in engineering applications requiring different load-carrying capacities. The first step in analyzing a beam under a distributed load is to simplify the problem by dividing the load into smaller regions, which allows one to consider each region separately and calculate the magnitude of the equivalent resultant load acting on each portion of the beam. The magnitude of the equivalent resultant load for each region can be determined by calculating...
1.2K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

387
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
387
Parallel-Axis Theorem for an Area01:12

Parallel-Axis Theorem for an Area

3.2K
The moment of inertia is a fundamental concept in mechanical engineering that plays a significant role in designing rotationally symmetric objects such as flywheels, gears, and other mechanical systems. In this context, we will discuss the moment of inertia of a flywheel rotating about its centroidal axis and how it relates to the moment of inertia about an axis parallel to it.
For a flywheel approximated as a solid disc, consider an infinitesimal differential element with an arbitrary distance...
3.2K

You might also read

Related Articles

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

Sort by
Same author

Enhancing Single-Cell and Bulk Hi-C Data Using a Generative Transformer Model.

Biology·2025
Same author

Inferring gene regulatory networks from time-series scRNA-seq data via GRANGER causal recurrent autoencoders.

Briefings in bioinformatics·2025
Same author

DeepIMAGER: Deeply Analyzing Gene Regulatory Networks from scRNA-seq Data.

Biomolecules·2024
Same author

Self-supervised deep clustering of single-cell RNA-seq data to hierarchically detect rare cell populations.

Briefings in bioinformatics·2023
Same author

scTIGER: A Deep-Learning Method for Inferring Gene Regulatory Networks from Case versus Control scRNA-seq Datasets.

International journal of molecular sciences·2023
Same author

Decoding brain memory formation by single-cell RNA sequencing.

Briefings in bioinformatics·2022

Related Experiment Video

Updated: Mar 16, 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

12.0K

CLIMP: Clustering Motifs via Maximal Cliques with Parallel Computing Design.

Shaoqiang Zhang1, Yong Chen2,3

  • 1College of Computer and Information Engineering, Tianjin Normal University, Tianjin, China.

Plos One
|August 4, 2016
PubMed
Summary

A new algorithm, CLIMP, efficiently clusters transcription factor binding motifs using maximal cliques. This method improves upon existing algorithms for genome-wide motif prediction pipelines.

More Related Videos

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

8.8K
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

7.4K

Related Experiment Videos

Last Updated: Mar 16, 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

12.0K
Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

8.8K
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

7.4K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Transcription factor binding sites, known as motifs, are crucial for gene regulation.
  • Comparative genomics identifies motifs, but clustering numerous predicted motifs is challenging.
  • Existing clustering algorithms struggle with large datasets of putative motifs.

Purpose of the Study:

  • To develop an efficient algorithm for clustering transcription factor binding motifs.
  • To improve the accuracy and efficiency of genome-wide motif prediction pipelines.
  • To provide a robust tool for separating true motifs from spurious predictions.

Main Methods:

  • Proposed a novel motif clustering algorithm named CLIMP.
  • Utilized maximal cliques for motif similarity representation.
  • Accelerated the algorithm through parallelization.

Main Results:

  • CLIMP demonstrated superior performance in motif clustering compared to two other high-performance algorithms.
  • The algorithm was tested on synthetic (JASPAR), phylogenetic footprinting, and ChIP-seq datasets.
  • CLIMP effectively clustered motifs from diverse genome-wide data sources.

Conclusions:

  • CLIMP is an efficient and effective motif clustering algorithm.
  • It offers a valuable addition to genome-wide motif prediction workflows.
  • The algorithm is available for public use at http://sqzhang.cn/climp.html.