Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Evolutionary Relationships through Genome Comparisons

Evolutionary Relationships through Genome Comparisons

Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...

You might also read

Related Articles

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

Sort by

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

Search research articles

Related Experiment Video

Updated: Mar 28, 2026

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

Expectation Maximization of Frequent Patterns, a Specific, Local, Pattern-Based Biclustering Algorithm for Biological

Erin Jessica Moore, Thirmachos Bourlai

IEEE/ACM Transactions on Computational Biology and Bioinformatics

|December 25, 2015

Summary

This summary is machine-generated.

A new algorithm, EMFP, efficiently analyzes large biological datasets for microarray analysis. It overcomes limitations of existing methods by reducing false positives and resource requirements, making biclustering accessible on standard hardware.

More Related Videos

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

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

Published on: January 16, 2019

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

Published on: October 19, 2021

Related Experiment Videos

Last Updated: Mar 28, 2026

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

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

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

Published on: January 16, 2019

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

Published on: October 19, 2021

Area of Science:

Computational Biology
Bioinformatics
Data Mining

Background:

Current binary biclustering algorithms struggle with large biological datasets due to slow speed and high resource demands.
Existing methods often yield excessive false positives, hindering biological discovery in microarray analysis.

Purpose of the Study:

To develop an efficient and accessible binary biclustering algorithm for large biological datasets.
To improve the specificity and reduce the error rates of biclustering results.

Main Methods:

Proposed a hybrid, axis-parallel, pattern-based algorithm (EMFP) utilizing local density comparisons.
Implemented a variable confidence threshold for identifying near-constant, deterministic, binary submatrices.
Introduced a novel framework for calculating internal measures and comparing algorithms.

Main Results:

EMFP analyzes datasets with large attribute sets and varying densities, suitable for laptop operation.
The algorithm achieves very low Root Mean Squared Error and false positive rates.
Demonstrated effectiveness through comparisons with existing binary and general biclustering algorithms on real and synthetic datasets.

Conclusions:

EMFP offers an accessible and efficient solution for binary biclustering in computational biology.
The algorithm significantly reduces errors and resource needs, facilitating biological discovery.
The introduced framework aids in the evaluation and comparison of biclustering methods.