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 Experiment Video

Updated: May 22, 2026

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

Pattern-driven neighborhood search for biclustering of microarray data.

Wassim Ayadi1, Mourad Elloumi, Jin-Kao Hao

  • 1LERIA, Université d'Angers, 2 Boulevard Lavoisier, 49045 Angers Cedex 01, France.

BMC Bioinformatics
|May 19, 2012
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

DNA Microarrays02:34

DNA Microarrays

Microarrays are high-throughput and relatively inexpensive assays that can be automated to analyze large quantities of data at a time. They are used in genome-wide studies to compare gene or protein expression under two varied conditions, such as healthy and diseased states. Microarrays consist of glass or silica slides on which probe molecules are covalently attached through surface functionalization. Most commonly, the slides are prepared through the chemisorption of silanes to silica...

You might also read

Related Articles

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

Sort by
Same author

Revolutionizing Transcriptomics: From Single-Cell Insights to RNA-based Interventions.

SLAS technology·2026
Same author

Personalized Hearing Loss Care Using SNOMED CT-Aligned Ontology and Random Forest Machine Learning: A Hybrid Decision-Support Framework.

Audiology research·2026
Same author

HyMSS-GAD: a hybrid multi-stage framework for multi-view graph anomaly detection with structural, contextual, and geometric reasoning.

Scientific reports·2026
Same author

Unified representation and scoring framework for anomaly detection in attributed networks with emphasis on structural consistency and attribute integrity.

Scientific reports·2025
Same author

A double-decomposition based parallel exact algorithm for the feedback length minimization problem.

PeerJ. Computer science·2023
Same author

Dynamic thresholding search for the feedback vertex set problem.

PeerJ. Computer science·2023
Same journal

Covariance decomposition for distance based species tree estimation.

BMC bioinformatics·2026
Same journal

SNPio: a Python interface for population genomic data processing.

BMC bioinformatics·2026
Same journal

SpaHNR: a spatial domain identification method via sparse attention-based hierarchical node representation and multi-view contrastive learning.

BMC bioinformatics·2026
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
See all related articles

This study introduces a fast, pattern-driven algorithm for biclustering, identifying gene subgroups with correlated behaviors in microarray data. The method efficiently finds significant biclusters and enhances existing ones.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Biclustering identifies gene subgroups with correlated behaviors across conditions.
  • It is crucial for analyzing microarray data and has broad applications.
  • The combinatorial nature of biclustering necessitates optimization methods.

Purpose of the Study:

  • To develop an efficient algorithm for biclustering.
  • To improve the discovery of statistically and biologically significant gene-condition subgroups.

Main Methods:

  • A stochastic pattern-driven neighborhood search algorithm was developed.
  • The algorithm iteratively refines biclusters by adjusting genes and conditions based on quality metrics.
  • Performance was evaluated on Yeast cell cycle and Saccharomyces cerevisiae datasets.

Related Experiment Videos

Last Updated: May 22, 2026

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

Main Results:

  • The method successfully identified statistically and biologically significant biclusters.
  • It demonstrated competitive or superior performance compared to six existing methods.
  • The algorithm is computationally efficient.

Conclusions:

  • The proposed biclustering method is fast and effective for discovering significant biclusters.
  • It can also improve the quality of biclusters generated by other algorithms.