title: A proof of the DBRF-MEGN method, an algorithm for deducing minimum equivalent gene networks.
abstract: BACKGROUND
  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.
  
  
  RESULTS
  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.
  
  
  CONCLUSIONS
  The DBRF-MEGN method provides all of the exact solutions of the most parsimonious SDGs consistent with expression profiles of gene deletion mutants.
authors.affiliation: 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. sonami@riken.jp.
authors.forename: Koji
authors.initials: K
authors.lastname: Kyoda
authors.forename: Kotaro
authors.initials: K
authors.lastname: Baba
authors.forename: Hiroaki
authors.initials: H
authors.lastname: Kitano
authors.forename: Shuichi
authors.initials: S
authors.lastname: Onami