• 1
  • 2
  • 5
  • 6
  • 7
  • 8
  • 9
  • 3
  • 4
IPM
30
YEARS OLD

“School of Biological”

Back to Papers Home
Back to Papers of School of Biological

Paper   IPM / Biological / 13166
School of Biological Sciences
  Title:   An Algorithm for Inference of Gene Networks UsingBayesian Network
  Author(s): 
1 . A. Ebrahimi.
2 . R. Aghdam.
3 . N. Parisa.
4 . M. ganjali.
5 . C. Eslahchi.
  Status:   Published
  Journal: Emerging Trends in Computing and information Science
  Vol.:  5
  Year:  2012
  Pages:   774-782
  Supported by:  IPM
  Abstract:
Gene regulatory networks explain how cells control the expression of genes, which, together with some additional regulation downstream, determines the production of proteins essential for cellular function. Bayesian networks (BNs) are practical tools which have been successfully implemented in learning gene networks based on microarray gene expression data. Bayesian networks are graphical representation for probabilistic relationships among a set of random variables. PC algorithm is a structure learning algorithm based on conditional independence tests. The drawback of PC algorithm is that high-order conditional independence (CI) tests need large sample sizes. The number of records in microarray dataset is rarely enough to perform reliable high-order CI tests. In this paper, we extend the methodology for reduction of the order of the CI tests. In order to improve the PC algorithm, we introduce a heuristic algorithm, LSPC, for learning the structure of the BN. The results indicate that applying the LSPC methodology improves the precision of learning the skeleton of the graph (undirected graph) for Bayesian networks.

Download TeX format
back to top
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
scroll left or right