Learning sparse models for a dynamic Bayesian network classifier of protein secondary structure
Open Access
- 13 May 2011
- journal article
- research article
- Published by Springer Nature in BMC Bioinformatics
- Vol. 12 (1) , 154
Abstract
Background: Protein secondary structure prediction provides insight into protein function and is a valuable preliminary step for predicting the 3D structure of a protein. Dynamic Bayesian networks (DBNs) and support vector machines (SVMs) have been shown to provide state-of-the-art performance in secondary structure prediction. As the size of the protein database grows, it becomes feasible to use a richer model in an effort to capture subtle correlations among the amino acids and the predicted labels. In this context, it is beneficial to derive sparse models that discourage over-fitting and provide biological insight. Results: In this paper, we first show that we are able to obtain accurate secondary structure predictions. Our per-residue accuracy on a well established and difficult benchmark (CB513) is 80.3%, which is comparable to the state-of-the-art evaluated on this dataset. We then introduce an algorithm for sparsifying the parameters of a DBN. Using this algorithm, we can automatically remove up to 70-95% of the parameters of a DBN while maintaining the same level of predictive accuracy on the SD576 set. At 90% sparsity, we are able to compute predictions three times faster than a fully dense model evaluated on the SD576 set. We also demonstrate, using simulated data, that the algorithm is able to recover true sparse structures with high accuracy, and using real data, that the sparse model identifies known correlation structure (local and non-local) related to different classes of secondary structure elements. Conclusions: We present a secondary structure prediction method that employs dynamic Bayesian networks and support vector machines. We also introduce an algorithm for sparsifying the parameters of the dynamic Bayesian network. The sparsification approach yields a significant speed-up in generating predictions, and we demonstrate that the amino acid correlations identified by the algorithm correspond to several known features of protein secondary structure. Datasets and source code used in this study are available at http://noble.gs.washington.edu/proj/pssp.Keywords
This publication has 43 references indexed in Scilit:
- A Dirichlet process mixture of hidden Markov models for protein structure predictionThe Annals of Applied Statistics, 2010
- Prediction of backbone dihedral angles and protein secondary structure using support vector machinesBMC Bioinformatics, 2009
- A generative, probabilistic model of local protein structureProceedings of the National Academy of Sciences, 2008
- A dynamic Bayesian network approach to protein secondary structure predictionBMC Bioinformatics, 2008
- An evolutionary method for learning HMM structure: prediction of protein secondary structureBMC Bioinformatics, 2007
- Sampling Realistic Protein Conformations Using Local Structural BiasPLOS Computational Biology, 2006
- Protein secondary structure prediction based on position-specific scoring matrices 1 1Edited by G. Von HeijneJournal of Molecular Biology, 1999
- Gapped BLAST and PSI-BLAST: a new generation of protein database search programsNucleic Acids Research, 1997
- Predicting the secondary structure of globular proteins using neural network modelsJournal of Molecular Biology, 1988
- Dictionary of protein secondary structure: Pattern recognition of hydrogen‐bonded and geometrical featuresBiopolymers, 1983