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

Combinatorial Gene Control02:33

Combinatorial Gene Control

Combinatorial gene control is the synergistic action of several transcriptional factors to regulate the expression of a single gene. The absence of one or more of these factors may lead to a significant difference in the level of gene expression or repression.
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...
Block Diagram Reduction01:22

Block Diagram Reduction

The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
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

Divergence of Cortical Force-Generating Mechanisms Underlies Differences in Spindle Behavior between <i>C. elegans</i> and <i>C. inopinata</i>.

bioRxiv : the preprint server for biology·2026
Same author

Search, organize, aggregate and share image data with BioFile Finder (BFF).

Nature methods·2026
Same author

Odor-specific olfactory stimulation is associated with selective transcriptional changes and partial improvement of stress-evoked bladder overactivity in mice.

Frontiers in neuroscience·2026
Same author

Creating an engine of scientific discovery, an Indo-Japan perspective: learnings from IJNTC 2025 workshop.

NPJ systems biology and applications·2026
Same author

Outplaying elite table tennis players with an autonomous robot.

Nature·2026
Same author

Riboswitch-controlled lipid conversion enables functional membrane asymmetry in artificial cells.

Communications biology·2026

Related Experiment Video

Updated: May 31, 2026

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
10:44

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

A proof of the DBRF-MEGN method, an algorithm for deducing minimum equivalent gene networks.

Koji Kyoda1, Kotaro Baba, Hiroaki Kitano

  • 1Laboratory for Developmental Dynamics, RIKEN Quantitative Biology Center, and Advanced Computational Sciences Department, RIKEN Advanced Science Institute, 1-7-22 Suehirocho, Tsurumi, Yokohama 230-0045, Japan. sonami@riken.jp.

Source Code for Biology and Medicine
|June 25, 2011
PubMed
Summary

The DBRF-MEGN method finds the simplest gene networks from mutant expression data. This study details the algorithm and proves it finds all exact solutions for parsimonious signed directed graphs.

More Related Videos

Using Human Differentially Expressed Gene Lists to Perform Downstream Pathway Enrichment Analysis and Target Prioritization
03:08

Using Human Differentially Expressed Gene Lists to Perform Downstream Pathway Enrichment Analysis and Target Prioritization

Published on: October 3, 2025

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
09:49

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks

Published on: September 25, 2021

Related Experiment Videos

Last Updated: May 31, 2026

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
10:44

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

Using Human Differentially Expressed Gene Lists to Perform Downstream Pathway Enrichment Analysis and Target Prioritization
03:08

Using Human Differentially Expressed Gene Lists to Perform Downstream Pathway Enrichment Analysis and Target Prioritization

Published on: October 3, 2025

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
09:49

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks

Published on: September 25, 2021

Area of Science:

  • Systems Biology
  • Computational Biology
  • Genomics

Background:

  • The DBRF-MEGN method was previously developed to infer gene networks.
  • It deduces parsimonious signed directed graphs (SDGs) from gene deletion mutant expression profiles.
  • The detailed algorithm and its proof were not previously published.

Purpose of the Study:

  • To provide a detailed description of the DBRF-MEGN algorithm.
  • To mathematically prove that the algorithm identifies all exact solutions.
  • To validate the method's capability in reconstructing gene regulatory networks.

Main Methods:

  • Detailed algorithmic explanation of DBRF-MEGN.
  • Mathematical proof of algorithm's completeness and correctness.
  • Application to expression profiles of single-gene deletion mutants.

Main Results:

  • The DBRF-MEGN algorithm is fully described.
  • Proof is provided that the algorithm finds all exact solutions.
  • The method generates the most parsimonious SDGs consistent with mutant data.

Conclusions:

  • The DBRF-MEGN method successfully identifies all exact solutions.
  • It provides a robust approach for reconstructing gene regulatory networks.
  • The method ensures parsimony in the deduced signed directed graphs.