A Boolean algorithm for reconstructing the structure of regulatory networks.
Advances in transcriptional analysis offer great opportunities to delineate the structure and hierarchy of regulatory networks in biochemical systems. We present an approach based on Boolean analysis to reconstruct a set of parsimonious networks from gene disruption and over expression data. Our algorithms, Causal Predictor (CP) and Relaxed Causal Predictor (RCP) distinguish the direct and indirect causality relations from the non-causal interactions, thus significantly reducing the number of miss-predicted edges. The algorithms also yield substantially fewer plausible networks. This greatly reduces the number of experiments required to deduce a unique network from the plausible network structures. Computational simulations are presented to substantiate these results. The algorithms are also applied to reconstruct the entire network of galactose utilization pathway in Saccharomyces cerevisiae. These algorithms will greatly facilitate the elucidation of regulatory networks using large scale gene expression profile data.
Mehra
Sarika
S
Department of Chemical Engineering and Materials Science, University of Minnesota, 421 Washington Avenue SE, Minneapolis, MN 55455-0132, USA.
Hu
Wei-Shou
WS
Karypis
George
G
D000465:Algorithms; D019295:Computational Biology; D020869:Gene Expression Profiling; D015966:Gene Expression Regulation, Fungal / Q000502:physiology*; D005800:Genes, Fungal / Q000502:physiology*; D008957:Models, Genetic; D020411:Oligonucleotide Array Sequence Analysis; D012441:Saccharomyces cerevisiae / Q000502:physiology*