Model reductions for inference: generality of pairwise, binary, and planar factor graphs.

We offer a solution to the problem of efficiently translating algorithms between different types of discrete statistical model. We investigate the expressive power of three classes of model-those with binary variables, with pairwise factors, and with planar topology-as well as their four intersections. We formalize a notion of "simple reduction" for the problem of inferring marginal probabilities and consider whether it is possible to "simply reduce" marginal inference from general discrete factor graphs to factor graphs in each of these seven subclasses. We characterize the reducibility of each class, showing in particular that the class of binary pairwise factor graphs is able to simply reduce only positive models. We also exhibit a continuous "spectral reduction" based on polynomial interpolation, which overcomes this limitation. Experiments assess the performance of standard approximate inference algorithms on the outputs of our reductions.

Discovering transcriptional modules by Bayesian data integration.

MOTIVATION: We present a method for directly inferring transcriptional modules (TMs) by integrating gene expression and transcription factor binding (ChIP-chip) data. Our model extends a hierarchical Dirichlet process mixture model to allow data fusion on a gene-by-gene basis. This encodes the intuition that co-expression and co-regulation are not necessarily equivalent and hence we do not expect all genes to group similarly in both datasets. In particular, it allows us to identify the subset of genes that share the same structure of transcriptional modules in both datasets. RESULTS: We find that by working on a gene-by-gene basis, our model is able to extract clusters with greater functional coherence than existing methods. By combining gene expression and transcription factor binding (ChIP-chip) data in this way, we are better able to determine the groups of genes that are most likely to represent underlying TMs. AVAILABILITY: If interested in the code for the work presented in this article, please contact the authors. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

EARLY FLOWERING4 recruitment of EARLY FLOWERING3 in the nucleus sustains the Arabidopsis circadian clock

The plant circadian clock is proposed to be a network of several interconnected feedback loops, and loss of any component leads to changes in oscillator speed. We previously reported that Arabidopsis thaliana EARLY FLOWERING4 (ELF4) is required to sustain this oscillator and that the elf4 mutant is arrhythmic. This phenotype is shared with both elf3 and lux. Here, we show that overexpression of either ELF3 or LUX ARRHYTHMO (LUX) complements the elf4 mutant phenotype. Furthermore, ELF4 causes ELF3 to form foci in the nucleus. We used expression data to direct a mathematical position of ELF3 in the clock network. This revealed direct effects on the morning clock gene PRR9, and we determined association of ELF3 to a conserved region of the PRR9 promoter. A cis-element in this region was suggestive of ELF3 recruitment by the transcription factor LUX, consistent with both ELF3 and LUX acting genetically downstream of ELF4. Taken together, using integrated approaches, we identified ELF4/ELF3 together with LUX to be pivotal for sustenance of plant circadian rhythms. © 2012 American Society of Plant Biologists.