“School of Biological”

Back to Papers Home
Back to Papers of School of Biological

Paper   IPM / Biological / 13260
School of Biological Sciences
  Title:   IPCA-CMI: An algorithm for Inferring Gene Regulatory Networks Based on a Combination of PCA-CMI and MIT Score
1.  R. Aghdam.
2.  M. Ganjali.
3.  C. Eslahchi.
  Status:   Published
  Journal: Plos One
  No.:  4
  Vol.:  9
  Year:  2014
  Pages:   e92600
  Supported by:  IPM
Inferring gene regulatory networks (GRNs) is a major issue in systems biology, which explicitly characterizes regulatory processes in the cell. The Path Consistency Algorithm based on Conditional Mutual Information (PCA-CMI) is a well-known method in this field. In this study, we introduce a new algorithm (IPCA-CMI) and apply it to a number of gene expression data sets in order to evaluate the accuracy of the algorithm to infer GRNs. The IPCA-CMI can be categorized as a hybrid method, using the PCA-CMI and Hill-Climbing algorithm (based on MIT score). The conditional dependence between variables is determined by the conditional mutual information test which can take into account both linear and nonlinear genes relations. IPCA-CMI uses a score and search method and defines a selected set of variables which is adjacent to one of X or Y. This set is used to determine the dependency between X and Y. This method is compared with the method of evaluating dependency by PCA-CMI in which the set of variables adjacent to both X and Y, is selected. The merits of the IPCA-CMI are evaluated by applying this algorithm to the DREAM3 Challenge data sets with n variables and n samples (n 10,50,100) and to experimental data from Escherichia coil containing 9 variables and 9 samples. Results indicate that applying the IPCA-CMI improves the precision of learning the structure of the GRNs in comparison with that of the PCA-CMI.

Download TeX format
back to top
scroll left or right