{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T12:45:36Z","timestamp":1781613936228,"version":"3.54.5"},"reference-count":53,"publisher":"Oxford University Press (OUP)","issue":"17","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,9,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: The main challenge for structure-based computational protein design (CPD) remains the combinatorial nature of the search space. Even in its simplest fixed-backbone formulation, CPD encompasses a computationally difficult NP-hard problem that prevents the exact exploration of complex systems defining large sequence-conformation spaces.<\/jats:p>\n               <jats:p>Results: We present here a CPD framework, based on cost function network (CFN) solving, a recent exact combinatorial optimization technique, to efficiently handle highly complex combinatorial spaces encountered in various protein design problems. We show that the CFN-based approach is able to solve optimality a variety of complex designs that could often not be solved using a usual CPD-dedicated tool or state-of-the-art exact operations research tools. Beyond the identification of the optimal solution, the global minimum-energy conformation, the CFN-based method is also able to quickly enumerate large ensembles of suboptimal solutions of interest to rationally build experimental enzyme mutant libraries.<\/jats:p>\n               <jats:p>Availability: The combined pipeline used to generate energetic models (based on a patched version of the open source solver Osprey 2.0), the conversion to CFN models (based on Perl scripts) and CFN solving (based on the open source solver toulbar2) are all available at http:\/\/genoweb.toulouse.inra.fr\/\u223ctschiex\/CPD<\/jats:p>\n               <jats:p>Contacts: \u00a0thomas.schiex@toulouse.inra.fr or sophie.barbe@insa-toulouse.fr<\/jats:p>\n               <jats:p>Supplementary information: \u00a0Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btt374","type":"journal-article","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T00:34:28Z","timestamp":1373502868000},"page":"2129-2136","source":"Crossref","is-referenced-by-count":69,"title":["A new framework for computational protein design through cost function network optimization"],"prefix":"10.1093","volume":"29","author":[{"given":"Seydou","family":"Traor\u00e9","sequence":"first","affiliation":[{"name":"1 Universit\u00e9 de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France, 2INRA, UMR792, Ing\u00e9nierie des Syst\u00e8mes Biologiques et des Proc\u00e9d\u00e9s, F-31400 Toulouse, France, 3CNRS, UMR5504, F-31400 Toulouse, France and 4Unit\u00e9 de Math\u00e9matiques et Informatique Appliqu\u00e9es, UR 875, INRA, F-31320 Castanet Tolosan, France"},{"name":"1 Universit\u00e9 de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France, 2INRA, UMR792, Ing\u00e9nierie des Syst\u00e8mes Biologiques et des Proc\u00e9d\u00e9s, F-31400 Toulouse, France, 3CNRS, UMR5504, F-31400 Toulouse, France and 4Unit\u00e9 de Math\u00e9matiques et Informatique Appliqu\u00e9es, UR 875, INRA, F-31320 Castanet Tolosan, France"},{"name":"1 Universit\u00e9 de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France, 2INRA, UMR792, Ing\u00e9nierie des Syst\u00e8mes Biologiques et des Proc\u00e9d\u00e9s, F-31400 Toulouse, France, 3CNRS, UMR5504, F-31400 Toulouse, France and 4Unit\u00e9 de Math\u00e9matiques et Informatique Appliqu\u00e9es, UR 875, INRA, F-31320 Castanet Tolosan, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Allouche","sequence":"additional","affiliation":[{"name":"1 Universit\u00e9 de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France, 2INRA, UMR792, Ing\u00e9nierie des Syst\u00e8mes Biologiques et des Proc\u00e9d\u00e9s, F-31400 Toulouse, France, 3CNRS, UMR5504, F-31400 Toulouse, France and 4Unit\u00e9 de Math\u00e9matiques et Informatique Appliqu\u00e9es, UR 875, INRA, F-31320 Castanet Tolosan, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Isabelle","family":"Andr\u00e9","sequence":"additional","affiliation":[{"name":"1 Universit\u00e9 de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France, 2INRA, UMR792, Ing\u00e9nierie des Syst\u00e8mes Biologiques et des Proc\u00e9d\u00e9s, F-31400 Toulouse, France, 3CNRS, UMR5504, F-31400 Toulouse, France and 4Unit\u00e9 de Math\u00e9matiques et Informatique Appliqu\u00e9es, UR 875, INRA, F-31320 Castanet Tolosan, France"},{"name":"1 Universit\u00e9 de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France, 2INRA, UMR792, Ing\u00e9nierie des Syst\u00e8mes Biologiques et des Proc\u00e9d\u00e9s, F-31400 Toulouse, France, 3CNRS, UMR5504, F-31400 Toulouse, France and 4Unit\u00e9 de Math\u00e9matiques et Informatique Appliqu\u00e9es, UR 875, INRA, F-31320 Castanet Tolosan, France"},{"name":"1 Universit\u00e9 de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France, 2INRA, UMR792, Ing\u00e9nierie des Syst\u00e8mes Biologiques et des Proc\u00e9d\u00e9s, F-31400 Toulouse, France, 3CNRS, UMR5504, F-31400 Toulouse, France and 4Unit\u00e9 de Math\u00e9matiques et Informatique Appliqu\u00e9es, UR 875, INRA, F-31320 Castanet Tolosan, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon","family":"de Givry","sequence":"additional","affiliation":[{"name":"1 Universit\u00e9 de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France, 2INRA, UMR792, Ing\u00e9nierie des Syst\u00e8mes Biologiques et des Proc\u00e9d\u00e9s, F-31400 Toulouse, France, 3CNRS, UMR5504, F-31400 Toulouse, France and 4Unit\u00e9 de Math\u00e9matiques et Informatique Appliqu\u00e9es, UR 875, INRA, F-31320 Castanet Tolosan, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George","family":"Katsirelos","sequence":"additional","affiliation":[{"name":"1 Universit\u00e9 de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France, 2INRA, UMR792, Ing\u00e9nierie des Syst\u00e8mes Biologiques et des Proc\u00e9d\u00e9s, F-31400 Toulouse, France, 3CNRS, UMR5504, F-31400 Toulouse, France and 4Unit\u00e9 de Math\u00e9matiques et Informatique Appliqu\u00e9es, UR 875, INRA, F-31320 Castanet Tolosan, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Schiex","sequence":"additional","affiliation":[{"name":"1 Universit\u00e9 de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France, 2INRA, UMR792, Ing\u00e9nierie des Syst\u00e8mes Biologiques et des Proc\u00e9d\u00e9s, F-31400 Toulouse, France, 3CNRS, UMR5504, F-31400 Toulouse, France and 4Unit\u00e9 de Math\u00e9matiques et Informatique Appliqu\u00e9es, UR 875, INRA, F-31320 Castanet Tolosan, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sophie","family":"Barbe","sequence":"additional","affiliation":[{"name":"1 Universit\u00e9 de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France, 2INRA, UMR792, Ing\u00e9nierie des Syst\u00e8mes Biologiques et des Proc\u00e9d\u00e9s, F-31400 Toulouse, France, 3CNRS, UMR5504, F-31400 Toulouse, France and 4Unit\u00e9 de Math\u00e9matiques et Informatique Appliqu\u00e9es, UR 875, INRA, F-31320 Castanet Tolosan, France"},{"name":"1 Universit\u00e9 de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France, 2INRA, UMR792, Ing\u00e9nierie des Syst\u00e8mes Biologiques et des Proc\u00e9d\u00e9s, F-31400 Toulouse, France, 3CNRS, UMR5504, F-31400 Toulouse, France and 4Unit\u00e9 de Math\u00e9matiques et Informatique Appliqu\u00e9es, UR 875, INRA, F-31320 Castanet Tolosan, France"},{"name":"1 Universit\u00e9 de Toulouse; INSA, UPS, INP; LISBP, 135 Avenue de Rangueil, F-31077 Toulouse, France, 2INRA, UMR792, Ing\u00e9nierie des Syst\u00e8mes Biologiques et des Proc\u00e9d\u00e9s, F-31400 Toulouse, France, 3CNRS, UMR5504, F-31400 Toulouse, France and 4Unit\u00e9 de Math\u00e9matiques et Informatique Appliqu\u00e9es, UR 875, INRA, F-31320 Castanet Tolosan, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2013,7,10]]},"reference":[{"key":"2023012810463611200_btt374-B1","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1002\/jcc.20420","article-title":"Dramatic performance enhancements for the FASTER optimization algorithm","volume":"27","author":"Allen","year":"2006","journal-title":"J. Comput. Chem."},{"key":"2023012810463611200_btt374-B2","first-page":"840","article-title":"Computational protein design as a cost function network optimization problem","volume-title":"Proceedings of Principles and Practice of Constraint Programming\u2013CP 2012, Qu\u00e9bec City, QC, Canada","author":"Allouche","year":"2012"},{"key":"2023012810463611200_btt374-B3","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1089\/106652702760277336","article-title":"A combinatorial approach to protein docking with flexible side chains","volume":"9","author":"Althaus","year":"2002","journal-title":"J. Comput. Biol."},{"key":"2023012810463611200_btt374-B4","doi-asserted-by":"crossref","first-page":"22667","DOI":"10.1021\/jp055282+","article-title":"A residue-pairwise generalized born scheme suitable for protein design calculations","volume":"109","author":"Archontis","year":"2005","journal-title":"J. Phys. Chem. B"},{"key":"2023012810463611200_btt374-B5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1038\/35051731","article-title":"Combinatorial and computational challenges for biocatalyst design","volume":"409","author":"Arnold","year":"2001","journal-title":"Nature"},{"key":"2023012810463611200_btt374-B7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1111\/j.1432-1033.1977.tb11885.x","article-title":"The Protein Data Bank. A computer-based archival file for macromolecular structures","volume":"80","author":"Bernstein","year":"1977","journal-title":"Eur. J. Biochem."},{"key":"2023012810463611200_btt374-B8","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1002\/prot.20185","article-title":"Large-scale prediction of protein geometry and stability changes for arbitrary single point mutations","volume":"57","author":"Bordner","year":"2004","journal-title":"Proteins"},{"key":"2023012810463611200_btt374-B9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/A:1009812409930","article-title":"Radio link frequency assignment","volume":"4","author":"Cabon","year":"1999","journal-title":"Constraints"},{"key":"2023012810463611200_btt374-B10","volume-title":"AMBER 9","author":"Case","year":"2006"},{"key":"2023012810463611200_btt374-B11","doi-asserted-by":"crossref","first-page":"3764","DOI":"10.1073\/pnas.0900266106","article-title":"Computational structure-based redesign of enzyme activity","volume":"106","author":"Chen","year":"2009","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023012810463611200_btt374-B12","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/j.artint.2010.02.001","article-title":"Soft arc consistency revisited","volume":"174","author":"Cooper","year":"2010","journal-title":"Artif. Intell"},{"key":"2023012810463611200_btt374-B13","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1126\/science.278.5335.82","article-title":"De novo protein design: fully automated sequence selection","volume":"278","author":"Dahiyat","year":"1997","journal-title":"Science"},{"key":"2023012810463611200_btt374-B14","first-page":"84","article-title":"Existential arc consistency: getting closer to full arc consistency in weighted CSPs","volume-title":"Proceedings of 19th International Joint Conference on Artificial Intelligence","author":"De Givry","year":"2005"},{"key":"2023012810463611200_btt374-B15","article-title":"Mendelsoft: Mendelian error detection in complex pedigree using weighted constraint satisfaction techniques","volume-title":"Proceedings of 8th World Congress on Genetics Applied to Livestock Production","author":"De Givry","year":"2006"},{"key":"2023012810463611200_btt374-B16","doi-asserted-by":"crossref","first-page":"2006","DOI":"10.1002\/pro.5560041006","article-title":"De novo design of the hydrophobic cores of proteins","volume":"4","author":"Desjarlais","year":"1995","journal-title":"Protein Sci."},{"key":"2023012810463611200_btt374-B17","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1038\/356539a0","article-title":"The dead-end elimination theorem and its use in protein sidechain positioning","volume":"356","author":"Desmet","year":"1992","journal-title":"Nature"},{"key":"2023012810463611200_btt374-B18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/prot.10131","article-title":"Fast and accurate side-chain topology and energy refinement (FASTER) as a new method for protein structure optimization","volume":"48","author":"Desmet","year":"2002","journal-title":"Proteins"},{"key":"2023012810463611200_btt374-B19","doi-asserted-by":"crossref","first-page":"e1002335","DOI":"10.1371\/journal.pcbi.1002335","article-title":"Protein design using continuous rotamers","volume":"8","author":"Gainza","year":"2012","journal-title":"PLoS Comput. Biol."},{"key":"2023012810463611200_btt374-B20","doi-asserted-by":"crossref","first-page":"i185","DOI":"10.1093\/bioinformatics\/btm197","article-title":"Dead-end elimination with backbone flexibility","volume":"23","author":"Georgiev","year":"2007","journal-title":"Bioinformatics"},{"key":"2023012810463611200_btt374-B21","doi-asserted-by":"crossref","first-page":"1527","DOI":"10.1002\/jcc.20909","article-title":"The minimized dead-end elimination criterion and its application to protein redesign in a hybrid scoring and search algorithm for computing partition functions over molecular ensembles","volume":"29","author":"Georgiev","year":"2008","journal-title":"J. Comput. Chem."},{"key":"2023012810463611200_btt374-B22","doi-asserted-by":"crossref","first-page":"i196","DOI":"10.1093\/bioinformatics\/btn169","article-title":"Algorithm for backrub motions in protein design","volume":"24","author":"Georgiev","year":"2008","journal-title":"Bioinfmatics"},{"key":"2023012810463611200_btt374-B23","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1016\/S0969-2126(99)80176-2","article-title":"Branch-and-terminate: a combinatorial optimization algorithm for protein design","volume":"7","author":"Gordon","year":"1999","journal-title":"Structure"},{"key":"2023012810463611200_btt374-B24","first-page":"1727","article-title":"Mimicking biopolymers on a molecular scale: nano(bio)technology based on engineered proteins","volume":"367","author":"Grunwald","year":"2009","journal-title":"Philos. Trans. A Math. Phys. Eng. Sci."},{"key":"2023012810463611200_btt374-B25","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1002\/prot.24150","article-title":"Dead-end elimination with perturbations (DEEPer): a provable protein design algorithm with continuous sidechain and backbone flexibility","volume":"81","author":"Hallen","year":"2013","journal-title":"Proteins"},{"key":"2023012810463611200_btt374-B26","doi-asserted-by":"crossref","first-page":"19824","DOI":"10.1021\/jp961710n","article-title":"Parametrized models of aqueous free energies of solvation based on pairwise descreening of solute atomic charges from a dielectric medium","volume":"100","author":"Hawkins","year":"1996","journal-title":"J. Phys. Chem."},{"key":"2023012810463611200_btt374-B27","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1016\/0022-2836(91)90510-D","article-title":"Construction of new ligand binding sites in proteins of known structure: I. Computer-aided modeling of sites with pre-defined geometry","volume":"222","author":"Hellinga","year":"1991","journal-title":"J. Mol. Biol."},{"key":"2023012810463611200_btt374-B28","doi-asserted-by":"crossref","first-page":"1923","DOI":"10.1002\/jcc.21188","article-title":"Rotamer optimization for protein design through MAP estimation and problem-size reduction","volume":"30","author":"Hong","year":"2009","journal-title":"J. Comput. Chem."},{"key":"2023012810463611200_btt374-B29","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1002\/prot.21123","article-title":"Comparison of multiple Amber force fields and development of improved protein backbone parameters","volume":"65","author":"Hornak","year":"2006","journal-title":"Proteins"},{"key":"2023012810463611200_btt374-B30","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1016\/j.str.2008.09.012","article-title":"Prediction of protein-protein interface sequence diversity using flexible backbone computational protein design","volume":"16","author":"Humphris","year":"2008","journal-title":"Structure"},{"key":"2023012810463611200_btt374-B31","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/0022-2836(78)90408-4","article-title":"Conformation of amino acid sidechains in proteins","volume":"125","author":"Janin","year":"1978","journal-title":"J. Mol. Biol."},{"key":"2023012810463611200_btt374-B34","doi-asserted-by":"crossref","first-page":"1028","DOI":"10.1093\/bioinformatics\/bti144","article-title":"Solving and analyzing side-chain positioning problems using linear and integer programming","volume":"21","author":"Kingsford","year":"2005","journal-title":"Bioinformatics"},{"key":"2023012810463611200_btt374-B35","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1002\/jcc.20820","article-title":"GLYCAM06: a generalizable biomolecular force field. Carbohydrates","volume":"29","author":"Kirschner","year":"2008","journal-title":"J. Comput. Chem."},{"key":"2023012810463611200_btt374-B36","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/S1571-0653(05)80034-4","article-title":"Solving frequency assignment problems via tree-decomposition","volume":"3","author":"Koster","year":"1999","journal-title":"Electron. Notes Discrete Math."},{"key":"2023012810463611200_btt374-B37","doi-asserted-by":"crossref","first-page":"10383","DOI":"10.1073\/pnas.97.19.10383","article-title":"Native protein sequences are close to optimal for their structures","volume":"97","author":"Kuhlman","year":"2000","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023012810463611200_btt374-B38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2004.05.004","article-title":"Solving weighted CSP by maintaining arc consistency","volume":"159","author":"Larrosa","year":"2004","journal-title":"Artif. Intell."},{"key":"2023012810463611200_btt374-B39","first-page":"347","article-title":"Reversible DAC and other improvements for solving Max-CSP","volume-title":"Proceedings of the National Conference on Artificial Intelligence","author":"Larrosa","year":"1998"},{"key":"2023012810463611200_btt374-B40","first-page":"84","article-title":"Existential arc consistency: getting closer to full arc consistency in weighted CSPs","volume-title":"Proceedings of the 19th International Joint Conference on Artificial Intelligence","author":"Larrosa","year":"2005"},{"key":"2023012810463611200_btt374-B41","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/(SICI)1097-0134(19981101)33:2<227::AID-PROT7>3.0.CO;2-F","article-title":"Exploring the conformational space of protein side chains using dead-end elimination and the A* algorithm","volume":"33","author":"Leach","year":"1998","journal-title":"Proteins"},{"key":"2023012810463611200_btt374-B42","first-page":"16","article-title":"An adaptive dynamic programming algorithm for the side chain placement problem","author":"Leaver-Fay","year":"2005","journal-title":"Pac. Symp. Biocomput."},{"key":"2023012810463611200_btt374-B43","doi-asserted-by":"crossref","first-page":"1592","DOI":"10.1016\/j.artint.2009.09.002","article-title":"Reasoning from last conflict (s) in constraint programming","volume":"173","author":"Lecoutre","year":"2009","journal-title":"Artif. Intell."},{"key":"2023012810463611200_btt374-B45","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1038\/nbt1336","article-title":"Computational design of antibody affinity improvement beyond in vitro maturation","volume":"25","author":"Lippow","year":"2007","journal-title":"Nat. Biotechnol."},{"key":"2023012810463611200_btt374-B47","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.cbpa.2010.11.019","article-title":"Recent progress in industrial biocatalysis","volume":"15","author":"Nestl","year":"2011","journal-title":"Curr. Opin. Chem. Biol."},{"key":"2023012810463611200_btt374-B49","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1038\/301200a0","article-title":"Molecular technology: designing proteins and peptides","volume":"301","author":"Pabo","year":"1983","journal-title":"Nature"},{"key":"2023012810463611200_btt374-B50","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1093\/protein\/15.10.779","article-title":"Protein design is NP-hard","volume":"15","author":"Pierce","year":"2002","journal-title":"Protein Eng."},{"key":"2023012810463611200_btt374-B51","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1110\/ps.9.6.1106","article-title":"Prediction of amino acid sequence from structure","volume":"9","author":"Raha","year":"2000","journal-title":"Protein Sci."},{"key":"2023012810463611200_btt374-B53","first-page":"411","article-title":"Arc consistency for soft constraints","volume-title":"Proceedings of Principles and Practice of Constraint Programming\u2013CP 2000, Singapore","author":"Schiex","year":"2000"},{"key":"2023012810463611200_btt374-B54","first-page":"631","article-title":"Valued constraint satisfaction problems: hard and easy problems","volume":"14","author":"Schiex","year":"1995","journal-title":"Int. Joint Conf. Artif. Intell."},{"key":"2023012810463611200_btt374-B55","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1006\/jmbi.2000.3758","article-title":"Trading accuracy for speed: a quantitative comparison of search algorithms in protein sequence design","volume":"299","author":"Voigt","year":"2000","journal-title":"J. Mol. Biol."},{"key":"2023012810463611200_btt374-B56","first-page":"188","article-title":"Enhancements of branch and bound methods for the maximal constraint satisfaction problem","volume-title":"Proceedings of the thirteenth national conference on Artificial Intelligence (AAAI-96)","author":"Wallace","year":"1996"},{"key":"2023012810463611200_btt374-B57","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1002\/jcc.20035","article-title":"Development and testing of a general AMBER force field","volume":"25","author":"Wang","year":"2004","journal-title":"J. Comp. Chem."},{"key":"2023012810463611200_btt374-B58","doi-asserted-by":"crossref","first-page":"247260","DOI":"10.1016\/j.jmgm.2005.12.005","article-title":"Automatic atom type and bond type perception in molecular mechanical calculations","volume":"25","author":"Wang","year":"2006","journal-title":"J. Mol. Graph. Model."},{"key":"2023012810463611200_btt374-B59","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1006\/jmbi.2000.3984","article-title":"Automatic protein design with all atom force fields by exact and heuristic optimization","volume":"301","author":"Wernisch","year":"2000","journal-title":"J. Mol. Biol."},{"key":"2023012810463611200_btt374-B60","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10601-007-9033-9","article-title":"DARN! A weighted constraint solver for RNA motif localization","volume":"13","author":"Zytnicki","year":"2008","journal-title":"Constraints"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/29\/17\/2129\/48891667\/bioinformatics_29_17_2129.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/29\/17\/2129\/48891667\/bioinformatics_29_17_2129.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T12:34:53Z","timestamp":1674909293000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/29\/17\/2129\/246051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,10]]},"references-count":53,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2013,9,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btt374","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2013,9,1]]},"published":{"date-parts":[[2013,7,10]]}}}