Inference of restricted stochastic Boolean GRN's by Bayesian error and entropy based criteria

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This work compares two frequently used criterion functions in inference of gene regulatory networks (GRN), one based on Bayesian error and another based on conditional entropy. The network model utilized was the stochastic restricted Boolean network model; the tests were realized in the well studied yeast cell-cycle and in randomly generated networks. The experimental results support the use of entropy in relation to the use of Bayesian error and indicate that the application of a fast greedy feature selection algorithm combined with an entropy-based criterion function can be used to infer accurate GRN's, allowing to accurately infer networks with thousands of genes in a feasible computational time cost, even though some genes are influenced by many other genes. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Martins, D. C., De Oliveira, E. A., Louzada, V. H., & Hashimoto, R. F. (2010). Inference of restricted stochastic Boolean GRN’s by Bayesian error and entropy based criteria. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6419 LNCS, pp. 144–152). https://doi.org/10.1007/978-3-642-16687-7_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free