Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Constructing gene networks using variational Bayesian variable selection
Tienda-Luna I., Yin Y., Huang Y., Ruiz Padillo D., Carrion Perez M., Wang Y. Artificial Life14 (1):65-79,2008.Type:Article
Date Reviewed: Jun 6 2008

Gene networks are models of molecular interaction (such as gene-protein regulation, protein-protein interaction, and protein-metabolite association), and are used to explain many complex cellular functions affected by such interaction. Gene networks, in turn, help in formulating drug targets and, subsequently, drug design. This paper is targeted at the part of the bioinformatics research community that explores the interaction of genes for information flow.

The paper presents a Bayesian solution for the identification of such gene networks. The Bayesian solutions can be categorized as a point (hard) or probabilistic (soft) solution. The hard-point solution is conceptually simple, and has been the basis of many works in the field. However, it fails to provide a measure of confidence in the network topology that results. The soft probabilistic methods compute a posteriori probabilities (APP) of network topology, which is a measure of confidence in the network topology.

In the method proposed in this paper, the problem of gene interactions is formulated as a variable selection problem. An algorithm using a variational Bayesian expectation maximization (VBEM), which does not explicitly consider the uncertainty of the network topology, is proposed. This treatment can reduce the complexity of learning, and does not necessarily faithfully model the problem.

The paper presents a mathematical formulation of the problem, the VBEM solutions with constraints, and the proposed algorithm, in a brief summary. A brief treatment of the Bayesian integration of two data sets is also presented. This is followed by a test result for a simulated network with six regulators for yeast cell pathways. The test set the noise variance at .01, and collected results from 100 independent episodes. The algorithm has been reported to correctly infer most of the molecular interaction. When Bayesian data integration was used, additional interactions were inferred with a high degree of confidence. The proposed algorithms are claimed to outperform the Gibbs sampling algorithm. These claims, however, require further support.

The approach in this paper will be useful to researchers modeling complex, distributed, real-time industrial systems.

Reviewer:  Anoop Malaviya Review #: CR135685 (0904-0390)
Bookmark and Share
  Reviewer Selected
 
 
Biology And Genetics (J.3 ... )
 
 
Inference Engines (I.2.3 ... )
 
 
Modeling Methodologies (I.6.5 ... )
 
 
Probabilistic Algorithms (Including Monte Carlo) (G.3 ... )
 
 
Deduction And Theorem Proving (I.2.3 )
 
 
Model Development (I.6.5 )
 
  more  
Would you recommend this review?
yes
no
Other reviews under "Biology And Genetics": Date
Discovering the secrets of DNA
Friedland P., Kedes L. Communications of the ACM 28(11): 1164-1186, 1985. Type: Article
May 1 1986
The formation of three-dimensional biological structures: computer uses and future needs
Levinthal C.  Computer culture: the scientific, intellectual, and social impact of the computer (, New York,1801984. Type: Proceedings
Sep 1 1986
Computer techniques in neuroanatomy
Capowski J., Plenum Press, New York, NY, 1989. Type: Book (9789780306432637)
Nov 1 1990
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy