A transdimensional Bayesian model for pattern recognition in DNA sequences

Identification of transcription factor binding sites (TFBSs) is essential to elucidate gene regulatory networks. This article is focused on the recognition of overpresented short patterns, called motifs, that may correspond to regulatory binding sites in the DNA sequences upstream of genes. An integrated Bayesian model is proposed to incorporate all unknown characteristics in motif discovery, including the number of motifs, motif widths, motif compositions, the number of motif sites, and locations of motif sites. Reversible jump Markov chain Monte Carlo is used to obtain posterior inference in the transdimensional parameter space. We present a number of suggestions for graphical summarization of the posterior distribution over the complex parameter space. The basic model is extended using a third-order Markov structure for nonmotif bases and allowing positions within a motif to be switched between 2 types: conserved and degenerate. We evaluate the prediction accuracy for the simulated data with 3 motifs and apply the model to upstream sequences in high signal-to-noise regions in a human ChIP-chip study. The performance of the Bayesian model is assessed using yeast data sets of various numbers of sequences and background structures, with and without true TFBSs. The performance is also compared to other computational methods, including 2 statistical approaches, AlignACE and multiple expectation maximization for motif elicitation, and 1 word numeration-based approach, yeast motif finder (YMF).