Improved pruning algorithms and divide-and-conquer strategies for Dead-End Elimination, with application to protein design

Bioinformatics

Volumn 22, Issue 14, 2006, Pages

  Georgiev, Ivelin ^a   Lilien, Ryan H ^a,b,c   Donald, Bruce R ^a,c,d  

^a Dartmouth Department of Computer Science_Dartmouth College   (United States)

^b DARTMOUTH MEDICAL SCHOOL   (United States)

^c DARTMOUTH COLLEGE   (United States)

^d Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAMICIDIN S SYNTHETASE; PLASTOCYANIN; PROTEIN G;

ACCURACY; ALGORITHM; BIOENGINEERING; CONFERENCE PAPER; MATHEMATICAL COMPUTING; MUTATION; PRIORITY JOURNAL; PROTEIN ANALYSIS; PROTEIN BINDING; PROTEIN CONFORMATION; PROTEIN FOLDING; PROTEIN FUNCTION; PROTEIN STRUCTURE;

EID: 33747882591     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btl220     Document Type: Conference Paper

References (30)

1. Bolon,D. and Mayo,S. (2001) Enzyme-like proteins by computational design. PNAS USA, 98, 14274-14279.
2. Chazelle,B., Kingsford,C. and Singh,M. (2004) A semidefinite programming approach to side-chain positioning with new rounding strategies. INFORMS Journal on Computing, Computational Biology Special Issue, 16(4), 380-392.
3. Conti,E., Stachelhaus,T., Marahiel,M. and Brick,P. (1997) Structural basis for the activation of phenylalanine in the non-ribosomal biosynthesis of Gramicidin S. EMBO J., 16: 4174.
4. Cornell,W., Cieplak,P., Bayly,C., Gould,I., Merz,K., Ferguson,D., Spellmeyer,D., Fox,T., Caldwell,J. and Kollman,P. (1995) A second generation force field for the simulation of proteins, nucleic acids and organic molecules. JACS, 117, 5179-5197.
5. Desmet,J., Maeyer,M., Hazes,B. and Lasters,I. (1992) The dead-end elimination theorem and its use in protein side-chain positioning. Nature, 356, 539-542.
6. Desmet,J., Maeyer,M.D. and Lasters,I. (1997) Theoretical and algorithmical optimization of the dead-end elimination theorem. In Altman,R., Dunker,A., Hunter,L. and Klein,T. (eds), Pac Symp Biocomput., 122-33.
7. Desmet,J., Spriet,J. and Lasters,I. (2002) Fast and accurate side-chain topology and energy refinement (FASTER) as a new method for protein structure optimization. Proteins, 48, 31-43.
8. Gallagher,T., Alexander,P., Bryan,P. and Gilliland,G.L. (1994) Two crystal structures of the B1 immunoglobulin-binding domain of streptococcal protein G and comparison with NMR. Biochemistry, 33, 4721-4729.
9. Garrett,T.P., Clingeleffer,D.J., Guss,J.M., Rogers,S.J. and Freeman,H.C. (1984) The crystal structure of poplar apoplastocyanin at 1.8-a resolution. The geometry of the copper-binding site is created by the polypeptide. J. Biol. Chem., 259, 2822-2825.
10. Georgiev,I., Lilien,R. and Donald,B.R. (2006) A novel 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. In Proceedings of The Tenth Annual International Conference on Research in Computational Molecular Biology (RECOMB), pp. 530-545. Venice, Italy. Springer Berlin, RECOMB 2006, Lecture Notes in Computer Science, LNBI 3909.
11. Goldstein,R. (1994) Efficient rotamer elimination applied to protein side-chains and related spin glasses. Biophys. J., 66, 1335.
12. Gordon,D., Hom,G., Mayo,S. and Pierce,N. (2003) Exact rotamer optimization for protein design. J Comput Chem, 24, 232-243.
13. Gordon,D. and Mayo,S. (1998) Radical performance enhancements for combinatorial optimization algorithms based on the dead-end elimination theorem. J. Comput. Chem., 19, 1505-1514.
14. Jaramillo,A., Wernisch,L., Heéry,S. and Wodak,S. (2001) Automatic procedures for protein design. Comb. Chem. High Throughput Screen., 4, 643-659.
15. Jin,W., Kambara,O., Sasakawa,H., Tamura,A. and Takada,S. (2003) De novo design of foldable proteins with smooth folding funnel: Automated negative design and experimental verification. Structure, 11, 581-591.
16. Kuhlman,B. and Baker,D. (2000) Native protein sequences are close to optimal for their structures. PNAS, 97, 10383-10388.
17. Lasters,I. and 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.
18. Leach,A. and Lemon,A. (1998) Exploring the conformational space of protein side chains using dead-end elimination and the Aa algorithm. Proteins, 33, 227-239.
19. Lilien,R., Stevens,B., Anderson,A. and Donald,B.R. (2005) A novel ensemble-based scoring and search algorithm for protein redesign, and its application to modify the substrate specificity of the Gramicidin Synthetase A phenylalanine adenylation enzyme. Journal of Computational Biology, 12(6-7), 740-761.
20. Looger,L., Dwyer,M., Smith,J. and Hellinga,H. (2003) Computational design of receptor and sensor proteins with novel functions. Nature, 423, 185-190.
21. Looger,L. and Hellinga,H. (2001) Generalized dead-end elimination algorithms make large-scale protein side-chain structure prediction tractable: Implications for protein design and structural genomics. J. Mol. Biol., 307, 429-445.
22. Lovell,S., Word,J., Richardson,J. and Richardson,D. (2000) The penultimate rotamer library. Proteins, 40, 389-408.
23. Marvin,J. and Hellinga,H. (2001) Conversion of a maltose receptor into a zinc biosensor by computational design. PNAS, 98, 4955-4960.
24. Najmanovich,R., Kuttner,J., Sobolev,V. and Edelman,M. (2000) Side-chain flexibility in proteins upon ligand binding. Proteins, 39(3), 261-8.
25. Pierce,N., Spriet,J., Desmet,J. and Mayo,S. (2000) Conformational splitting: A more powerful criterion for dead-end elimination. J. Comput. Chem., 21, 999-1009.
26. Pierce,N. and Winfree,E. (2002) Protein design is NP-hard. Protein Eng., 15, 779-782.
27. Ponder,J. and 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.
28. Shah,P., Hom,G. and Mayo,S. (2004) Preprocessing of rotamers for protein design calculations. J Comput Chem, 25, 1797-1800.
29. Street,A. and Mayo,S. (1999) Computational protein design. Structure, 7, R105-R109.
30. Weiner,S., Kollman,P., Case,D., Singh,U., Ghio,C., Alagona,G., Profeta,S. and Weiner,P. (1984) A new force field for molecular mechanical simulation of nucleic acids and proteins. J. Am. Chem. Soc., 106, 765-784.