Bayesian models and Markov chain Monte Carlo methods for protein motifs with the secondary characteristics.
Statistical methods have been developed for finding local patterns, also called motifs, in multiple protein sequences. The aligned segments may imply functional or structural core regions. However, the existing methods often have difficulties in aligning multiple proteins when sequence residue identities are low (e.g., less than 25%). In this article, we develop a Bayesian model and Markov chain Monte Carlo (MCMC) methods for identifying subtle motifs in protein sequences. Specifically, a motif is defined not only in terms of specific sites characterized by amino acid frequency vectors, but also as a combination of secondary characteristics such as hydrophobicity, polarity, etc. Markov chain Monte Carlo methods are proposed to search for a motif pattern with high posterior probability under the new model. A special MCMC algorithm is developed, involving transitions between state spaces of different dimensions. The proposed methods were supported by a simulated study. It was then tested by two real datasets, including a group of helix-turn-helix proteins, and one set from the CATH Protein Structure Classification Database. Statistical comparisons showed that the new approach worked better than a typical Gibbs sampling approach which is based only on an amino acid model.
Xie
Jun
J
Department of Statistics, Purdue University, 150 N. University Street, West Lafayette, IN 47907-2067, USA. junxie@stat.purdue.edu
Kim
Nak-Kyeong
NK
D020816:Amino Acid Motifs; D000595:Amino Acid Sequence; D001499:Bayes Theorem; D003198:Computer Simulation; D008390:Markov Chains; D008954:Models, Biological; D009010:Monte Carlo Method; D016415:Sequence Alignment / Q000379:methods / Q000706:statistics & numerical data; D020539:Sequence Analysis, Protein / Q000379:methods* / Q000706:statistics & numerical data; D040681:Structural Homology, Protein