Experiments on the Accuracy of Algorithms for Inferring the Structure of Genetic Regulatory Networks from Microarray Expression Levels
|Abstract||After reviewing theoretical reasons for doubting that machine learning methods can accurately infer gene regulatory networks from microarray data, we test 10 algorithms on simulated data from the sea urchin network, and on microarray data for yeast compared with recent experimental determinations of the regulatory network in the same yeast species. Our results agree with the theoretical arguments: most algorithms are at chance for determining the existence of a regulatory connection between gene pairs, and the algorithms that perform better than chance are nonetheless so errorprone as to be of little practical use in these applications.|
|Keywords||No keywords specified (fix it)|
|Categories||No categories specified (fix it)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
David Danks, Clark Glymour & Peter Spirtes (2003). The Computational and Experimental Complexity of Gene Perturbations for Regulatory Network Search. In W. H. Hsu, R. Joehanes & C. D. Page (eds.), Proceedings of IJCAI-2003 workshop on learning graphical models for computational genomics.
Clark Glymour, Two Statistical Problems for Inference to Regulatory Structure From Associations of Gene Expression Measurements with Microarrays.
Tianjaio Chu, Two Statistical Problems for Inference to Regulatory Structure From Associations of Gene Expression Measurements with Microarrays.
J. Aracena & J. Demongeot (2004). Mathematical Methods for Inferring Regulatory Networks Interactions: Application to Genetic Regulation. Acta Biotheoretica 52 (4).
Clark Glymour, The Computational and Experimental Complexity of Gene Perturbations for Regulatory Network Search.
Ehud Lamm (2009). Conceptual and Methodological Biases in Network Models. Annals of the New York Academy of Sciences 1178:291-304.
Rosario M. Piro (2011). Are All Genes Regulatory Genes? Biology and Philosophy 26 (4):595-602.
Hedi Ben Amor, Fabien Corblin, Eric Fanchon, Adrien Elena, Laurent Trilling, Jacques Demongeot & Nicolas Glade (forthcoming). Formal Methods for Hopfield-Like Networks. Acta Biotheoretica.
Roger Sansom (2008). Countering Kauffman with Connectionism: Two Views of Gene Regulation and the Fundamental Nature of Ontogeny. British Journal for the Philosophy of Science 59 (2):169-200.
Christophe Malaterre (2009). Are Self-Organizing Biochemical Networks Emergent? In Maryvonne Gérin & Marie-Christine Maurel (eds.), Origins of Life: Self-Organization and/or Biological Evolution? EDP Sciences.
Thomas Bartz-Beielstein (2008). How Experimental Algorithmics Can Benefit From Mayo's Extensions to Neyman–Pearson Theory of Testing. Synthese 163 (3):385 - 396.
Sorry, there are not enough data points to plot this chart.
Added to index2010-12-22
Total downloads1 ( #274,652 of 549,065 )
Recent downloads (6 months)0
How can I increase my downloads?