Protein Decoy Generation Using Branch and Bound with Efficient Bounding
We propose a new discrete protein structure model (using a modified face-centered cubic lattice). A novel branch and bound algorithm for finding global minimum structures in this model is suggested. The objective energy function is very simple as it depends on the predicted half-sphere exposure numbers of C α -atoms. Bounding and branching also exploit predicted secondary structures and expected radius of gyration. The algorithm is fast and is able to generate the decoy set in less than 48 hours on all proteins tested.
Despite the simplicity of the model and the energy function, many of the lowest energy structures, using exact measures, are near the native structures (in terms of RMSD). As expected, when using predicted measures, the fraction of good decoys decreases, but in all cases tested, we obtained structures within 6 Å RMSD in a set of low-energy decoys. To the best of our knowledge, this is the first de novo branch and bound algorithm for protein decoy generation that only depends on such one-dimensional predictable measures. Another important advantage of the branch and bound approach is that the algorithm searches through the entire conformational space. Contrary to search heuristics, like Monte Carlo simulation or tabu search, the problem of escaping local minima is indirectly solved by the branch and bound algorithm when good lower bounds can be obtained.
KeywordsSecondary Structure Tabu Search Conformational Space Contact Number Relative Solvent Accessibility
Unable to display preview. Download preview PDF.
- 3.Chothia, C., Lesk, A.M.: The relation between the divergence of sequence and structure in proteins. The EMBO Journal 5, 823–826 (1986)Google Scholar
- 11.Palu, A.D., Dovier, A., Fogolari, F.: Constraint logic programming approach to protein structure prediction. BMC Bioinformatics 5(186) (2004)Google Scholar
- 12.Paluszewski, M., Hamelryck, T., Winter, P.: Reconstructing protein structure from solvent exposure using tabu search. Algorithms for Molecular Biology 1 (2006)Google Scholar
- 13.Paluszewski, M., Winter, P.: EBBA: Efficient branch and bound algorithm for protein decoy generation, Department of Computer Science, Univ. of Copenhagen, vol. 08(08) (2008)Google Scholar
- 17.Standley, D.M., Eyrich, V.A., Felts, A.K., Friesner, R.A., McDermott, A.E.: A branch and bound algorithm for protein structure refinement from sparse nmr data sets. J. Mol. Biol. 285, 1961–1710 (1999)Google Scholar
- 19.Vilhjalmsson, B., Hamelryck, T.: Predicting a New Type of Solvent Exposure. In: ECCB, Computational Biology Madrid 2005, P-C35, Poster (2005)Google Scholar