The computational and experimental complexity of Gene perturbations for regulatory network search
| Abstract | Our primary interest is in determining how many gene perturbation experiments are required to determine the Various algorithms have been proposed for learning.. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,653 |
| External links |
  Try with proxy. Try with proxy. Try with proxy. Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesColin Farrelly (2007). Genetic Justice Must Track Genetic Complexity. Cambridge Quarterly of Healthcare Ethics 17 (01).
Brendan Kitts (1999). Representation Operators and Computation. Minds and Machines 9 (2):223-240.
Jacques Demongeot, Adrien Elena & Sylvain Sené (forthcoming). Robustness in Regulatory Networks: A Multi-Disciplinary Approach. Acta Biotheoretica.
Degeng Wang (2005). “Molecular Gene”: Interpretation in the Right Context. Biology and Philosophy 20 (2-3):453-464.
Rosario M. Piro (2011). Are All Genes Regulatory Genes? Biology and Philosophy 26 (4):595-602.
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.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads3 ( #201,730 of 548,980 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
