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...
RNA-seq03:21

RNA-seq

RNA sequencing, or RNA-Seq, is a high-throughput sequencing technology used to study the transcriptome of a cell. Transcriptomics helps to interpret the functional elements of a genome and identify the molecular constituents of an organism. Additionally, it also helps in understanding the development of an organism and the occurrence of diseases. 
Before the discovery of RNA-seq, microarray-based methods and Sanger sequencing were used for transcriptome analysis. However, while microarray-based...

You might also read

Related Articles

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

Sort by
Same author

Calcium/calmodulin-dependent protein kinase II links ER stress with Fas and mitochondrial apoptosis pathways.

The Journal of clinical investigation·2009
Same author

Cripto-1 overexpression is involved in the tumorigenesis of nasopharyngeal carcinoma.

BMC cancer·2009
Same author

Range of motion and orientation of the lumbar facet joints in vivo.

Spine·2009
Same author

[Silencing of COX-2 in nasopharyngeal carcinoma cells with a shRNAmir lentivirus vector].

Nan fang yi ke da xue xue bao = Journal of Southern Medical University·2009
Same author

The risk of melamine-induced nephrolithiasis in young children starts at a lower intake level than recommended by the WHO.

Pediatric nephrology (Berlin, Germany)·2009
Same author

Adult scoliosis in patients over sixty-five years of age: outcomes of operative versus nonoperative treatment at a minimum two-year follow-up.

Spine·2009
Same journal

circ2DGNN: circRNA-Disease Association Prediction via Transformer-Based Graph Neural Network.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Hierarchical Hypergraph Learning in Association- Weighted Heterogeneous Network for miRNA- Disease Association Identification.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Discriminative Domain Adaption Network for Simultaneously Removing Batch Effects and Annotating Cell Types in Single-Cell RNA-Seq.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

MLW-BFECF: A Multi-Weighted Dynamic Cascade Forest Based on Bilinear Feature Extraction for Predicting the Stage of Kidney Renal Clear Cell Carcinoma on Multi-Modal Gene Data.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

An End-to-End Knowledge Graph Fused Graph Neural Network for Accurate Protein-Protein Interactions Prediction.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Generative Biomedical Event Extraction With Constrained Decoding Strategy.

IEEE/ACM transactions on computational biology and bioinformatics·2024
See all related articles

Related Experiment Video

Updated: Jun 7, 2026

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes
07:55

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes

Published on: May 31, 2011

A cluster refinement algorithm for motif discovery.

Gang Li1, Tak-Ming Chan, Kwong-Sak Leung

  • 1Department of Computer Science and Engineering, Chinese University of Hong Kong, Hong Kong. gli@cse.cuhk.edu.hk

IEEE/ACM Transactions on Computational Biology and Bioinformatics
|October 30, 2010
PubMed
Summary
This summary is machine-generated.

Cluster Refinement Algorithm for Motif Discovery (CRMD) efficiently finds transcription factor binding sites. This novel approach balances accuracy and speed, outperforming existing methods for gene regulatory analysis.

More Related Videos

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

A Protocol for Computer-Based Protein Structure and Function Prediction
16:41

A Protocol for Computer-Based Protein Structure and Function Prediction

Published on: November 3, 2011

Related Experiment Videos

Last Updated: Jun 7, 2026

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes
07:55

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes

Published on: May 31, 2011

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

A Protocol for Computer-Based Protein Structure and Function Prediction
16:41

A Protocol for Computer-Based Protein Structure and Function Prediction

Published on: November 3, 2011

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Identifying transcription factor binding sites (motif discovery) is essential for understanding gene regulation.
  • Motifs are often weakly conserved, making motif discovery a computationally challenging (NP-hard) problem.

Purpose of the Study:

  • To introduce a novel algorithm, the Cluster Refinement Algorithm for Motif Discovery (CRMD), for accurate and efficient motif discovery.
  • To address the challenges of variable motif instances and multiple motif occurrences.

Main Methods:

  • CRMD utilizes a flexible statistical motif model supporting a variable number of motifs and instances.
  • Employs entropy-based clustering for initial candidate motif identification.
  • Applies greedy refinement with adaptive thresholds for optimizing motifs and their instance counts.

Main Results:

  • CRMD demonstrates superior performance compared to four state-of-the-art algorithms in solution quality.
  • Achieves competitive computing times, balancing true positive and false positive motif identification.
  • Shows robustness across various problem difficulties and is enhanced by single motif occurrence per sequence.

Conclusions:

  • CRMD offers an effective and robust solution for motif discovery in biological sequences.
  • The algorithm provides a significant advancement in analyzing gene regulatory relationships through accurate motif identification.