Conditional graphical models for protein structural motif recognition.
Determining protein structures is crucial to understanding the mechanisms of infection and designing drugs. However, the elucidation of protein folds by crystallographic experiments can be a bottleneck in the development process. In this article, we present a probabilistic graphical model framework, conditional graphical models, for predicting protein structural motifs. It represents the structure characteristics of a structural motif using a graph, where the nodes denote the secondary structure elements, and the edges indicate the side-chain interactions between the components either within one protein chain or between chains. Then the model defines the optimal segmentation of a protein sequence against the graph by maximizing its "conditional" probability so that it can take advantages of the discriminative training approach. Efficient approximate inference algorithms using reversible jump Markov Chain Monte Carlo (MCMC) algorithm are developed to handle the resulting complex graphical models. We test our algorithm on four important structural motifs, and our method outperforms other state-of-art algorithms for motif recognition. We also hypothesize potential membership proteins of target folds from Swiss-Prot, which further supports the evolutionary hypothesis about viral folds.
Liu
Yan
Y
IBM T.J. Watson Research Center, Yorktown Heights, New York 10598, USA. liuya@us.ibm.com
Carbonell
Jaime
J
Gopalakrishnan
Vanathi
V
Weigele
Peter
P
D000465:Algorithms; D020816:Amino Acid Motifs; D000595:Amino Acid Sequence; D003198:Computer Simulation; D008390:Markov Chains; D008433:Mathematics; D008958:Models, Molecular; D008969:Molecular Sequence Data; D011487:Protein Conformation; D017510:Protein Folding; D011506:Proteins / Q000737:chemistry* / Q000235:genetics; D016415:Sequence Alignment; D017422:Sequence Analysis, DNA
D011506:Proteins