David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
In W. H. Hsu, R. Joehanes & C. D. Page (eds.), Proceedings of IJCAI-2003 workshop on learning graphical models for computational genomics (2003)
Various algorithms have been proposed for learning (partial) genetic regulatory networks through systematic measurements of differential expression in wild type versus strains in which expression of specific genes has been suppressed or enhanced, as well as for determining the most informative next experiment in a sequence. While the behavior of these algorithms has been investigated for toy examples, the full computational complexity of the problem has not received sufficient attention. We show that finding the true regulatory network requires (in the worst-case) exponentially many experiments (in the number of genes). Perhaps more importantly, we provide an algorithm for determining the set of regulatory networks consistent with the observed data. We then show that this algorithm is infeasible for realistic data (specifically, nine genes and ten experiments). This infeasibility is not due to an algorithmic flaw, but rather to the fact that there are far too many networks consistent with the data (10 18 in the provided example). We conclude that gene perturbation experiments are useful in confirming regulatory network models discovered by other techniques, but not a feasible search strategy.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Clark Glymour, The Computational and Experimental Complexity of Gene Perturbations for Regulatory Network Search.
Joseph Ramsey & Clark Glymour, Experiments on the Accuracy of Algorithms for Inferring the Structure of Genetic Regulatory Networks From Microarray Expression Levels.
Rosario M. Piro (2011). Are All Genes Regulatory Genes? Biology and Philosophy 26 (4):595-602.
J. Aracena & J. Demongeot (2004). Mathematical Methods for Inferring Regulatory Networks Interactions: Application to Genetic Regulation. Acta Biotheoretica 52 (4):391-400.
Jacques Demongeot, Adrien Elena & Sylvain Sené (2008). Robustness in Regulatory Networks: A Multi-Disciplinary Approach. Acta Biotheoretica 56 (1-2):27-49.
Ehud Lamm (2009). Conceptual and Methodological Biases in Network Models. Annals of the New York Academy of Sciences 1178:291-304.
Hedi Amor, Fabien Corblin, Eric Fanchon, Adrien Elena & Laurent Trilling (2013). Formal Methods for Hopfield-Like Networks. Acta Biotheoretica 61 (1):21-39.
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.
Degeng Wang (2005). “Molecular Gene”: Interpretation in the Right Context. [REVIEW] Biology and Philosophy 20 (2-3):453-464.
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.
Sharon S. Krag (2010). Issues in Data Management. Science and Engineering Ethics 16 (4):743-748.
Margi Joshi & Sharon Krag (2010). Issues in Data Management. Science and Engineering Ethics 16 (4):743-748.
Robert C. Richardson (1997). Natural and Artificial Complexity. Philosophy of Science 64 (4):267.
Added to index2010-12-22
Total downloads7 ( #216,974 of 1,692,519 )
Recent downloads (6 months)2 ( #108,508 of 1,692,519 )
How can I increase my downloads?