Finding optimal models for small gene networks.
Finding gene networks from microarray data has been one focus of research in recent years. Given search spaces of super-exponential size, researchers have been applying heuristic approaches like greedy algorithms or simulated annealing to infer such networks. However, the accuracy of heuristics is uncertain, which--in combination with the high measurement noise of microarrays--makes it very difficult to draw conclusions from networks estimated by heuristics. We present a method that finds optimal Bayesian networks of considerable size and show first results of the application to yeast data. Having removed the uncertainty due to the heuristic methods, it becomes possible to evaluate the power of different statistical models to find biologically accurate networks.
Human Genome Center, Institute of Medical Science, The University of Tokyo 4-6-1 Shirokanedai, Minato-ku, Tokyo 108-8639, Japan. ott@ims.u-tokyo.ac.jp
S
S
Ott
S
S
Imoto
S
S
Miyano
D000465:Algorithms; D001499:Bayes Theorem; D019295:Computational Biology; D020869:Gene Expression Profiling / Q000706:statistics & numerical data; D018869:Heat-Shock Response / Q000235:genetics; D008957:Models, Genetic; D015233:Models, Statistical; D020411:Oligonucleotide Array Sequence Analysis / Q000706:statistics & numerical data