A reversible jump Markov chain Monte Carlo algorithm for bacterial promoter motifs discovery.
Effective probabilistic modeling approaches have been developed to find motifs of biological function in DNA sequences. However, the problem of automated model choice remains largely open and becomes more essential as the number of sequences to be analyzed is constantly increasing. Here we propose a reversible jump Markov chain Monte Carlo algorithm for estimating both parameters and model dimension of a Bayesian hidden semi-Markov model dedicated to bacterial promoter motif discovery. Bacterial promoters are complex motifs composed of two boxes separated by a spacer of variable but constrained length and occurring close to the protein translation start site. The algorithm allows simultaneous estimations of the width of the boxes, of the support size of the spacer length distribution, and of the order of the Markovian model used for the "background" nucleotide composition. The application of this method on three sequence sets points out the good behavior of the algorithm and the biological relevance of the estimated promoter motifs.
Nicolas
Pierre
P
Laboratoire Statistique et Génome, CNRS, Tour Evry2, 523 place des terrasses de l'Agora, F-91034 Evry, France. pierre.nicolas@jouy.inra.fr
Tocquet
Anne-Sophie
AS
Miele
Vincent
V
Muri
Florence
F
D000465:Algorithms; D001419:Bacteria / Q000235:genetics*; D001499:Bayes Theorem; D004269:DNA, Bacterial / Q000235:genetics*; D008390:Markov Chains; D009010:Monte Carlo Method; D010363:Pattern Recognition, Automated; D011401:Promoter Regions, Genetic / Q000235:genetics*; D017422:Sequence Analysis, DNA
D004269:DNA, Bacterial