Branch-and-terminate: A combinatorial optimization algorithm for protein design

Structure

Volumn 7, Issue 9, 1999, Pages 1089-1098

  Gordon, D Benjamin ^a   Mayo, Stephen L ^b  

^a California Institute of Technology   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Branch and Bound; Dead end elimination; Global energy minimum; Protein design; Rotamers

Indexed keywords

ALGORITHM; ARTICLE; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL; PROTEIN ANALYSIS; PROTEIN STRUCTURE;

EID: 0033200183     PISSN: 09692126     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0969-2126(99)80176-2     Document Type: Article

References (32)

1. 1. Dahiyat, B.I. & Mayo, S.L. (1997). De novo design: fully automated sequence selection. Science 278, 82-87.
2. 2. Malakaukas S. & Mayo, S.L. (1998). Design, structure and stability of a hyperthermophilic protein variant. Nat. Struct. Biol. 5, 470-475.
3. 3. De Maeyer, M., Desmet, J. & Lasters, I. (1997). All in one: a highly detailed rotamer library improves both accuracy and speed in the modeling of side-chains by dead-end elimination. Fold. Des. 2, 53-56.
4. 4. Janin, J., Wodak, S., Levitt, M. & Maigret, D. (1978). Conformation of amino acid side-chains in proteins. J. Mol. Biol. 125, 357-386.
5. 5. Ponder, J. & Richards, F. (1987). Tertiary templates for proteins - use of packing criteria in the enumeration of allowed sequences for different structural classes. J. Mol. Biol. 193, 775-791.
6. 6. Lee, C. & Levitt, M. (1991 ). Accurate prediction of the stability and activity effects of site-directed mutagenesis on a protein core. Nature 352, 448-451.
7. 7. Hellinga, H.W. & Richards, P.M. (1994). Optimal sequence selection in proteins of known structure by simulated evolution. Proc. Natl Acad. Sci. USA 91, 5803-5807.
8. 8. Dahiyat, B.I. & Mayo, S.L. (1994). Protein design automation. Protein Sci. 5, 895-903.
9. 9. Koehl, P. & Delarue, M. (1994). Application of a self-consistent mean-field theory to predict protein side-chain's conformation and estimate their conformational entropy. J. Mol. Biol. 239, 249-275.
10. 10. Lee, C. (1994). Predicting protein mutant energetics by self-consistent ensemble optimization. J. Mol. Biol. 236, 918-939.
11. 11. Desmet, J., De Maeyer, M., Hazes, B. & Lasters, I. (1992). The dead-end elimination theorem and its use in protein side-chain positioning. Nature 356, 539-542.
12. 12. Lasters, I. & Desmet, J. (1993). The fuzzy-end elimination theorem - correctly implementing the side-chain placement algorithm based on the dead-end elimination theorem. Protein Eng. 6, 717-722.
13. 13. Goldstein, R.F. (1994). Efficient rotamer elimination applied to protein side-chains and related spin-glasses. Biophys. J. 66, 1335-1340.
14. 14. Gordon, D.B. & Mayo, S.L. (1998). Radical performance enhancements for combinatorial optimization algorithms based on the dead-end elimination theorem. J. Comp. Chem. 19, 1505-1514.
15. 15. Desmet, J., De Maeyer, M. & Lasters, I. (1994). In The Protein Folding Problem and Tertiary Structure Prediction. (Merz Jr., K. & Le Grand, S., eds), pp. 307, Birkhäuser, Boston, MA.
16. 16. Reingold, E.M., Nievergelt, J. & Deo, N. (1977). Combinatorial Algorithms. Theory and Practice. Prentice-Hall, New Jersey.
17. 17. Hellinga, H.W. & Richards, F.M. (1991 ). Construction of new ligand binding sites in proteins of known structure. J. Mol. Biol. 222, 763-785.
18. 18. Lathrop, R.H. & Smith, T.F. (1996). Global optimum protein threading with gapped alignment and empirical pair score functions. J. Mol. Biol. 255, 641-665.
19. 19. Escalier, V., Pothier, J., Soldano, H. & Viari, A. (1998). Pairwise and multiple identification of three-dimensional common substructures in proteins. J. Comp. Biol. 5, 41-56.
20. 20. Wang, C.S.E., Lozano-Perez, T. & Tidor, B. (1998). A systematic algorithm for packing of macromolecular structures with ambiguous distance constraints. Proteins 32, 26-42.
21. 21. Todorov, N.P. & Dean, P.M. (1998). A branch-and-bound method for optimal atom-type assignment in de novo ligand design. J. Comp. Aid. Mol. Des. 12, 335-349.
22. 22. Eyrich, V.A., Standley, D.M., Felts, A.K. & Friesner, R.A. (1999). Protein tertiary structure prediction using a branch and bound algorithm. Proteins 35, 41-57.
23. 23. Samudrala, R. & Moult, J. (1998). A graph-theoretic algorithm for comparative modeling of protein structure. J. Mol. Biol. 279, 287-302.
24. 24. Leach, A.R. & Lemon, A.P. (1998). Exploring the conformational space of protein side chains using dead-end elimination and the A * algorithm. Proteins 33, 227-239.
25. 25. Knuth, D.E. (1975). Estimating the efficiency of backtrack programs. Mathematics of Computation 29, 121-136.
26. 26. Dunbrack, R.L. & Karplus, M. (1993). Backbone-dependent rotamer library for proteins - application to side-chain prediction. J. Mol. Biol. 230, 543-574.
27. 27. E.K. O'Shea, E.K., Klemm, J.D., Kim, P.S. & Alber, T. (1991). X-ray structure of the GCN4 leucine zipper, a 2-stranded, parallel coiled coil. Science 254, 539-544.
28. 28. Gallagher, T., Alexander, P., Bryan, P. & Gilliland, G.L. (1994). Two crystal structures of the β1 immunoglobulin binding domain of streptococcal protein-G and comparison with NMR. Biochemistry 33, 4721-4728.
29. 29. Dahiyat B.I. & Mayo, S.L. (1997). Probing the role of packing specificity in protein design. Proc. Natl Acad. Sci. USA 94, 10172-10177.
30. 30. Dahiyat, B.I., Gordon, D.B. & Mayo, S.L. (1997). Automated design of the surface position of protein helices. Protein Sci. 6, 1333-1337.
31. 31. Street, A.G. & Mayo, S.L. (1998). Pairwise calculation of protein solvent-accessible surface areas. Fold. Des. 3, 253-258.
32. 32. Mayo, S.L., Olafson, B.D. & Goddard W.A. (1990). DREIDING - a generic force-field for molecular simulations. J. Phys. Chem. 94, 8897-8909.