Minimizing and learning energy functions for side-chain prediction

Journal of Computational Biology

Volumn 15, Issue 7, 2008, Pages 899-911

  Yanover, Chen ^a,c   Schueler Furman, Ora ^b   Weiss, Yair ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b HEBREW UNIVERSITY   (Israel)

^c Fred Hutchinson Cancer Research Center   (United States)

Author keywords

Energy functions; Graphical models; Inference; Optimization; Side chain prediction

Indexed keywords

ACCURACY; CONFERENCE PAPER; ENERGY; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL; PROTEIN FOLDING; SCIENTIFIC LITERATURE;

ALGORITHMS; AMINO ACID SEQUENCE; MATHEMATICS; MODELS, MOLECULAR; MOLECULAR SEQUENCE DATA; PROTEIN CONFORMATION; PROTEIN FOLDING; SOFTWARE;

EID: 51349094337     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2007.0158     Document Type: Conference Paper

References (32)

1. Canutescu, A.A., Shelenkov, A.A., and Dunbrack, Jr., R.L. 2003. A graph-theory algorithm for rapid protein side-chain prediction. Protein Sci. 12, 2001-2014.
2. Dantas, G., Corrent, C., Reichow, S.L., et al. 2007. High-resolution structural and thermodynamic analysis of extreme stabilization of human procarboxypeptidase by computational protein design. J. Mol. Biol. 366, 1209-1221.
3. Desmet, J., Maeyer, M.D., Hazes, B., et al. 1992. The dead-end elmination theorem and its use in protein side-chain positioning. Nature 356, 539-542.
4. Dunbrack, Jr., R.L., and Karplus, M. 1993. Back-bone dependent rotamer library for proteins: application to side-chain prediction. J. Mol. Biol. 230, 543-574.
5. Fraenkel, A.S. 1997. Protein folding, spin glass and computational complexity. Proc. 3rd DIMACS Workshop DNA Based Comput. 175-191.
6. Goldstein, R.F. 1994. Efficient rotamer elimination applied to protein side-chains and related spin glasses. Biophys. J. 66, 1335-1340.
7. Gray, J.J., Moughon, S., Wang, C., et al. 2003. Protein-protein docking with simultaneous optimization of rigid-body displacement and side-chain conformations. J. Mol. Biol. 331, 281-299.
8. Gunawardana, A., Mahajan, M., Acero, A., et al. 2005. Hidden conditional random fields for phone classification. INTERSPEECH, pgs. 1117-1120.
9. Kingsford, C.L., Chazelle, B., and Singh, M. 2005. Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinformatics 21, 1028-1039.
10. Kolmogorov, V. 2005. Convergent tree-reweighted message passing for energy minimization. Proc. AI Stats, 182-189.
11. Kolmogorov, V., and Wainwright, M. 2005. On the optimality of tree-reweighted max-product message passing. Uncertainty Artif. Intellig. (UAI), 316-332.
12. Kortemme, T., Morozov, A.V., and Baker, D. 2003. An orientation-dependent hydrogen bonding potential improves prediction of specificity and structure for proteins and protein-protein complexes. J. Mol. Biol. 326, 1239-1259.
13. Kuhlman, B., and Baker, D. 2000. Native protein sequences are close to optimal for their structures. Proc. Natl. Acad. Sci. USA 97, 10383-10388.
14. Lafferty, J., McCallum, A., and Pereira, F. 2001. Conditional random fields: probabilistic models for segmenting and labeling sequence data. ICML 282-289.
15. Lafferty, J., Zhu, X., and Liu, Y. 2004. Kernel conditional random fields: representation and clique selection. ICML, 64-71.
16. Lazaridis, T., and Karplus, M. 1999. Effective energy function for proteins in solution. Proteins 35, 133-152.
17. Leaver-Fay, A., Kuhlman, B., and Snoeyink, J. 2005. An adaptive dynamic programming algorithm for the side chain placement problem. Pac. Symp. Biocomput. 10, 16-27.
18. LeCun, Y., and Huang, F. 2005. Loss functions for discriminative training of energy-based models. Proc. AIStats'05, 206-213.
19. Liu, Y., and Kuhlman, B. 2006. Rosettadesign server for protein design. NAR 34, W235-W238.
20. Meltzer, T., Yanover, C., and Weiss, Y. 2005. Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation. Proc. ICCV, 428-435.
21. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, New York.
22. Peterson, R.W., Dutton, P.L., and Wand, A.J. 2004. Improved side-chain prediction accuracy using an ab initio potential energy function and a very large rotamer library. Protein Sci. 13, 735-751.
23. Pierce, N.A., Spriet, J.A., Desmet, J., et al. 2000. Conformational splitting: A more powerful criterion for dead-end elimination. J. Comput. Chem. 21, 999-1009.
24. Quattoni, A., Collins, M., and Darrell, T. 2005. Conditional random fields for object recognition. In: S. Thrun, L. Saul, and B. Schölkopf (eds.), Advances in Neural Information Processing Systems 17. MIT Press, Cambridge, MA, 1097-1104.
25. Rohl, C.A., Strauss, C.E.M., Chivian, D., et al. 2004. Modeling structurally variable regions in homologous proteins with Rosetta. Proteins 55, 656-677.
26. Taskar, B., Guestrin, C., and Koller, D. 2004. Max-margin markov networks. In: S. Thrun, L. Saul, and B. Schölkopf (eds.), Advances in Neural Information Processing Systems 16. MIT Press, Cambridge, MA, 25-32.
27. Vishwanathan, S., Schraudolph, N., Schmidt, M., et al. 2006. Accelerated training of conditional random fields with stochastic meta-descent. ICML, 969-976.
28. Wainwright, M.J., Jaakkola, T., and Willsky, A.S. 2005. MAP estimation via agreement on (hyper)trees: message-passing and linear-programming approaches. IEEE Trans. Inform. Theory 51, 3697-3717.
29. Wang, C., Schueler-Furman, O., and Baker, D. 2005. Improved side-chain modeling for protein-protein docking. Protein Sci. 14, 1328-1339.
30. Yanover, C., and Weiss, Y. 2002. Approximate inference and protein folding. Adv. Neural Inform. Proc. Systems, 1457-1464.
31. Yanover, C., Meltzer, T., and Weiss, Y. 2006. Linear programming relaxations and belief propagation - an empirical study. J. Mach. Learning Res. 7, 1887-1907.
32. Yedidia, J.S., Freeman, W.T., and Weiss, Y. 2001. Understanding belief propagation and its generalizations. IJCAI (Distinguished Lecture Track).