Related Experiment Video
Updated: Jul 13, 2026

Generating the Transcriptional Regulation View of Transcriptomic Features for Prediction Task and Dark Biomarker Detection on Small Datasets
Published on: March 1, 2024
Bayesian Orthogonal Least Squares (BOLS) algorithm for reverse engineering of gene regulatory networks.
1Bioinformatics Group, Turku Centre for Computer Science, Turku, Finland. cskim@kangwon.ac.kr
This study introduces a novel algorithm for gene regulatory network reverse engineering, effectively handling limited data and noise. The method accurately identifies true interactions and outperforms existing algorithms like Sparse Bayesian Learning.
Area of Science:
- Computational Biology
- Systems Biology
- Bioinformatics
Background:
- Gene regulatory network (GRN) reverse engineering is computationally challenging with large gene numbers and limited experimental data.
- Linear system-based GRN reverse engineering is ill-posed, sensitive to noise, and requires robust optimization.
- Limited microarray data necessitates rigorous algorithms for accurate GRN elucidation.
Purpose of the Study:
- To develop a novel algorithm for reverse engineering gene regulatory networks using linear systems.
- To address the challenges of limited data points and noise sensitivity in GRN reconstruction.
- To improve the accuracy and efficiency of identifying true positive interactions in gene regulatory networks.
Main Methods:
- The proposed algorithm combines orthogonal least squares, second-order derivative for network pruning, and Bayesian model comparison.
- The gene regulatory network is decomposed into smaller, manageable unit networks.
- Each unit network is assigned a confidence level, P(D|Hi), to assess the accuracy of its elucidation.
Main Results:
- The algorithm successfully elucidates gene regulatory networks even with limited experimental data and noisy conditions.
- Evaluation on synthetic data shows performance is dependent on gene count, noise level, and data points.
- Analysis of Saccharomyces cerevisiae expression data revealed a significant number of known physical or genetic interactions.
- Comparison with Sparse Bayesian Learning demonstrated the proposed algorithm yields sparser solutions with fewer false positives.
Conclusions:
- The developed algorithm effectively elucidates gene regulatory networks using limited experimental data.
- The algorithm demonstrates robustness in handling noisy data, a common issue in biological experiments.
- Validation with yeast expression data confirms the reliable identification of known biological interactions.
- The algorithm shows superior performance compared to Sparse Bayesian Learning, particularly with noisy and limited datasets.
More Related Videos
10:44Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
Published on: December 7, 2021
07:11CorrelationCalculator and Filigree: Tools for Data-Driven Network Analysis of Metabolomics Data
Published on: November 10, 2023
Related Concept Videos
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Combinatorial Gene Control
The expression of more than 30,000 genes is controlled by approximately 2000-3000 transcription factors. This is possible because a single transcription factor can recognize more than one regulatory sequence. The specificity in gene...
Cooperative Binding of Transcription Regulators
Cooperative Binding of Transcription Regulators
Regulation of Expression at Multiple Steps