Kyoda Koji, Baba Kotaro, Kitano Hiroaki, Onami Shuichi
Laboratory 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.
Source Code Biol Med. 2011 Jun 24;6(1):12. doi: 10.1186/1751-0473-6-12.
We previously developed the DBRF-MEGN (difference-based regulation finding-minimum equivalent gene network) method, which deduces the most parsimonious signed directed graphs (SDGs) consistent with expression profiles of single-gene deletion mutants. However, until the present study, we have not presented the details of the method's algorithm or a proof of the algorithm.
We describe in detail the algorithm of the DBRF-MEGN method and prove that the algorithm deduces all of the exact solutions of the most parsimonious SDGs consistent with expression profiles of gene deletion mutants.
The DBRF-MEGN method provides all of the exact solutions of the most parsimonious SDGs consistent with expression profiles of gene deletion mutants.
我们之前开发了DBRF-MEGN（基于差异的调控发现-最小等效基因网络）方法，该方法可推导与单基因缺失突变体表达谱一致的最简约带符号有向图（SDG）。然而，直到本研究，我们尚未展示该方法算法的细节或算法的证明。
我们详细描述了DBRF-MEGN方法的算法，并证明该算法可推导与基因缺失突变体表达谱一致的最简约SDG的所有精确解。
DBRF-MEGN方法提供了与基因缺失突变体表达谱一致的最简约SDG的所有精确解。
