{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:21:45Z","timestamp":1774941705362,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540716808","type":"print"},{"value":"9783540716815","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71681-5_27","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T12:07:05Z","timestamp":1179403625000},"page":"381-395","source":"Crossref","is-referenced-by-count":5,"title":["Minimizing and Learning Energy Functions for Side-Chain Prediction"],"prefix":"10.1007","author":[{"given":"Chen","family":"Yanover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ora","family":"Schueler-Furman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yair","family":"Weiss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"27_CR1","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1110\/ps.03154503","volume":"12","author":"A.A. Canutescu","year":"2003","unstructured":"Canutescu, A.A., Shelenkov, A.A., Dunbrack Jr., R.L.: A graph-theory algorithm for rapid protein side-chain prediction. Protein Sci.\u00a012(9), 2001\u20132014 (2003)","journal-title":"Protein Sci."},{"issue":"19","key":"27_CR2","doi-asserted-by":"publisher","first-page":"10383","DOI":"10.1073\/pnas.97.19.10383","volume":"97","author":"B. Kuhlman","year":"2000","unstructured":"Kuhlman, B., Baker, D.: Native protein sequences are close to optimal for their structures. PNAS\u00a097(19), 10383\u201310388 (2000), http:\/\/www.pnas.org\/cgi\/content\/abstract\/97\/19\/10383","journal-title":"PNAS"},{"key":"27_CR3","unstructured":"Fraenkel, A.S.: Protein Folding, Spin Glass and Computational Complexity. In: Proceedings of the 3rd DIMACS Workshop on DNA Based Computers, held at the University of Pennsylvania, June 23 \u2013 25, pp. 175\u2013191 (1997)"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1038\/356539a0","volume":"356","author":"J. Desmet","year":"1992","unstructured":"Desmet, J., Maeyer, M.D., Hazes, B., Lasters, I.: The dead-end elmination theorem and its use in protein side-chain positioning. Nature\u00a0356, 539\u2013542 (1992)","journal-title":"Nature"},{"issue":"5","key":"27_CR5","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1016\/S0006-3495(94)80923-3","volume":"66","author":"R.F. Goldstein","year":"1994","unstructured":"Goldstein, R.F.: Efficient rotamer elimination applied to protein side-chains and related spin glasses. Biophys. J.\u00a066(5), 1335\u20131340 (1994)","journal-title":"Biophys. J."},{"issue":"11","key":"27_CR6","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1002\/1096-987X(200008)21:11<999::AID-JCC9>3.0.CO;2-A","volume":"21","author":"N.A. Pierce","year":"2000","unstructured":"Pierce, N.A., Spriet, J.A., Desmet, J., Mayo, S.L.: Conformational splitting: A more powerful criterion for dead-end elimination. J. of Computational Chemistry\u00a021(11), 999\u20131009 (2000)","journal-title":"J. of Computational Chemistry"},{"issue":"7","key":"27_CR7","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1093\/bioinformatics\/bti144","volume":"21","author":"C.L. Kingsford","year":"2005","unstructured":"Kingsford, C.L., Chazelle, B., Singh, M.: Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinformatics\u00a021(7), 1028\u20131039 (2005)","journal-title":"Bioinformatics"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Dantas, G., Corrent, C., Reichow, S.L., Havranek, J.J., Eletr, Z.M., Isern, N.G., Kuhlman, B., Varani, G., Merritt, E.A., Baker, D.: High-resolution structural and thermodynamic analysis of extreme stabilization of human procarboxypeptidase by computational protein design\u2019. Journal of Molecular Biology (in Press, 2007)","DOI":"10.1016\/j.jmb.2006.11.080"},{"issue":"2","key":"27_CR9","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1006\/jmbi.1993.1170","volume":"230","author":"R.L. Dunbrack Jr.","year":"1993","unstructured":"Dunbrack Jr., R.L., M., K.: Back-bone dependent Rotamer Library for Proteins: Application to Side-chain Predicrtion. J. Mol. Biol\u00a0230(2), 543\u2013574 (1993)","journal-title":"J. Mol. Biol"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/prot.10629","volume":"55","author":"C.A. Rohl","year":"2004","unstructured":"Rohl, C.A., Strauss, C.E.M., Chivian, D., Baker, D.: Modeling structurally variable regions in homologous proteins with Rosetta. Proteins: Structure, Function, and Bioinformatics\u00a055(3), 656\u2013677 (2004)","journal-title":"Proteins: Structure, Function, and Bioinformatics"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1002\/(SICI)1097-0134(19990501)35:2<133::AID-PROT1>3.0.CO;2-N","volume":"35","author":"T. Lazaridis","year":"1999","unstructured":"Lazaridis, T., Karplus, M.: Effective energy function for proteins in solution. Proteins: Structure, Function, and Genetics\u00a035(2), 133\u2013152 (1999)","journal-title":"Proteins: Structure, Function, and Genetics"},{"issue":"4","key":"27_CR12","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1016\/S0022-2836(03)00021-4","volume":"326","author":"T. Kortemme","year":"2003","unstructured":"Kortemme, T., Morozov, A.V., Baker, D.: An Orientation-dependent Hydrogen Bonding Potential Improves Prediction of Specificity and Structure for Proteins and Protein-Protein Complexes. Journal of Molecular Biology\u00a0326(4), 1239\u20131259 (2003)","journal-title":"Journal of Molecular Biology"},{"key":"27_CR13","unstructured":"Lafferty, J., McCallum, A., Pereira, F.: Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data. In: ICML 2001, pp. 282\u2013289 (2001)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Lafferty, J., Zhu, X., Liu, Y.: Kernel conditional random fields: Representation and clique selection. In: ICML (2004)","DOI":"10.1145\/1015330.1015337"},{"key":"27_CR15","unstructured":"LeCun, Y., Huang, F.J.: Loss Functions for Discriminative Training of Energy-Based Models. In: Proc. of the 10-th International Workshop on Artificial Intelligence and Statistics (AIStats\u201905) (2005)"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Vishwanathan, S., Schraudolph, N., Schmidt, M., Murphy, K.: Accelerated Training of Conditional Random Fields with Stochastic Meta-Descent. In: ICML (2006)","DOI":"10.1145\/1143844.1143966"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Gunawardana, A., Mahajan, M., Acero, A., Platt, J.C.: Hidden conditional random fields for phone classification. In: INTERSPEECH (2005)","DOI":"10.21437\/Interspeech.2005-126"},{"key":"27_CR18","volume-title":"Advances in Neural Information Processing Systems, vol. 17","author":"A. Quattoni","year":"2005","unstructured":"Quattoni, A., Collins, M., Darrell, T.: Conditional random fields for object recognition. In: Thrun, S., Saul, L., Sch\u00f6lkopf, B. (eds.) Advances in Neural Information Processing Systems, vol. 17, MIT Press, Cambridge (2005)"},{"key":"27_CR19","volume-title":"Advances in Neural Information Processing Systems, vol. 16","author":"B. Taskar","year":"2004","unstructured":"Taskar, B., Guestrin, C., Koller, D.: Max-Margin Markov Networks. In: Thrun, S., Saul, L., Sch\u00f6lkopf, B. (eds.) Advances in Neural Information Processing Systems, vol. 16, MIT Press, Cambridge (2004)"},{"issue":"11","key":"27_CR20","doi-asserted-by":"publisher","first-page":"3697","DOI":"10.1109\/TIT.2005.856938","volume":"51","author":"M.J. Wainwright","year":"2005","unstructured":"Wainwright, M.J., Jaakkola, T., Willsky, A.S.: MAP estimation via agreement on (hyper)trees: Message-passing and linear-programming approaches. IEEE Transactions on Information Theory\u00a051(11), 3697\u20133717 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"27_CR21","unstructured":"Yedidia, J.S., Freeman, W.T., Weiss, Y.: Understanding Belief Propagation and its Generalizations. IJCAI (distinguished lecture track) (2001)"},{"key":"27_CR22","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)"},{"key":"27_CR23","unstructured":"Yanover, C., Weiss, Y.: Approximate inference and protein folding. Advances in Neural Information Processing Systems (2002)"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. In: Proceedings AI Stats. (2005)","DOI":"10.1109\/TPAMI.2006.200"},{"key":"27_CR25","unstructured":"Kolmogorov, V., Wainwright, M.J.: On the Optimality of Tree-reweighted Max-product Message Passing. In: Uncertainty in Artificial Intelligence (UAI),"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Meltzer, T., Yanover, C., Weiss, Y.: Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation. In: Proceedings International Conference on Computer Vision (ICCV) (2005)","DOI":"10.1109\/ICCV.2005.110"},{"key":"27_CR27","first-page":"1887","volume":"7","author":"C. Yanover","year":"2006","unstructured":"Yanover, C., Meltzer, T., Weiss, Y.: Linear Programming Relaxations and Belief Propagation \u2013 An Empirical Study. Journal of Machine Learning Research\u00a07, 1887\u20131907 (2006)","journal-title":"Journal of Machine Learning Research"},{"key":"27_CR28","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/nar\/gkl163","volume":"34","author":"Y. Liu","year":"2006","unstructured":"Liu, Y., Kuhlman, B.: RosettaDesign server for protein design. NAR\u00a034, W235\u2013238 (2006)","journal-title":"NAR"},{"issue":"5","key":"27_CR29","doi-asserted-by":"publisher","first-page":"1328","DOI":"10.1110\/ps.041222905","volume":"14","author":"C. Wang","year":"2005","unstructured":"Wang, C., Schueler-Furman, O., Baker, D.: Improved side-chain modeling for protein-protein docking. Protein Sci.\u00a014(5), 1328\u20131339 (2005)","journal-title":"Protein Sci."},{"issue":"1","key":"27_CR30","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0022-2836(03)00670-3","volume":"331","author":"J.J. Gray","year":"2003","unstructured":"Gray, J.J., Moughon, S., Wang, C., Schueler-Furman, O., Kuhlman, B., Rohl, C.A., Baker, D.: Protein-Protein Docking with Simultaneous Optimization of Rigid-body Displacement and Side-chain Conformations. Journal of Molecular Biology\u00a0331(1), 281\u2013299 (2003)","journal-title":"Journal of Molecular Biology"},{"key":"27_CR31","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1142\/9789812702456_0003","volume":"10","author":"A. Leaver-Fay","year":"2005","unstructured":"Leaver-Fay, A., Kuhlman, B., Snoeyink, J.: An Adaptive Dynamic Programming Algorithm for the Side Chain Placement Problem. Pacific Symposium on Biocomputing\u00a010, 16\u201327 (2005)","journal-title":"Pacific Symposium on Biocomputing"},{"issue":"3","key":"27_CR32","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1110\/ps.03250104","volume":"13","author":"R.W. Peterson","year":"2004","unstructured":"Peterson, R.W., Dutton, P.L., Wand, A.J.: Improved side-chain prediction accuracy using an ab initio potential energy function and a very large rotamer library. Protein Sci.\u00a013(3), 735\u2013751 (2004)","journal-title":"Protein Sci."}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71681-5_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T18:09:10Z","timestamp":1683828550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71681-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540716808","9783540716815"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71681-5_27","relation":{},"subject":[]}}