Skip to main content
Springer Nature Link
Log in

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

  • Conference paper
Research in Computational Molecular Biology (RECOMB 2006)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 3909))

  • 1308 Accesses

Abstract

Novel molecular function can be achieved by redesigning an enzyme’s active site so that it will perform its chemical reaction on a novel substrate. One of the main challenges for protein redesign is the efficient evaluation of a combinatorial number of candidate structures. The modeling of protein flexibility, typically by using a rotamer library of commonly-observed low-energy side-chain conformations, further increases the complexity of the redesign problem. A dominant algorithm for protein redesign is Dead-End Elimination (DEE), which prunes the majority of candidate conformations by eliminating rigid rotamers that provably are not part of the Global Minimum Energy Conformation (GMEC). The identified GMEC consists of rigid rotamers that have not been energy-minimized and is referred to as the rigid-GMEC. As a post-processing step, the conformations that survive DEE may be energy-minimized. When energy minimization is performed after pruning with DEE, the combined protein design process becomes heuristic, and is no longer provably accurate: That is, the rigid-GMEC and the conformation with the lowest energy among all energy-minimized conformations (the minimized-GMEC, or minGMEC) are likely to be different. While the traditional DEE algorithm succeeds in not pruning rotamers that are part of the rigid-GMEC, it makes no guarantees regarding the identification of the minGMEC. In this paper we derive a novel, provable, and efficient DEE-like algorithm, called minimized-DEE (MinDEE), that guarantees that rotamers belonging to the minGMEC will not be pruned, while still pruning a combinatorial number of conformations. We show that MinDEE is useful not only in identifying the minGMEC, but also as a filter in an ensemble-based scoring and search algorithm for protein redesign that exploits energy-minimized conformations. We compare our results both to our previous computational predictions of protein designs and to biological activity assays of predicted protein mutants. Our provable and efficient minimized-DEE algorithm is applicable in protein redesign, protein-ligand binding prediction, and computer-aided drug design.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bolon, D., Mayo, S.: Enzyme-like proteins by computational design. Proc. Natl. Acad. Sci. USA 98, 14274–14279 (2001)

    Article  Google Scholar 

  2. Cane, D., Walsh, C., Khosla, C.: Harnessing the biosynthetic code: combinations, permutations, and mutations. Science 282, 63–68 (1998)

    Article  Google Scholar 

  3. Challis, G., Ravel, J., Townsend, C.: Predictive, structure-based model of amino acid recognition by nonribosomal peptide synthetase adenylation domains. Chem. Biol. 7, 211–224 (2000)

    Article  Google Scholar 

  4. Conti, E., Stachelhaus, T., Marahiel, M., Brick, P.: Structural basis for the activation of phenylalanine in the non-ribosomal biosynthesis of Gramicidin S. EMBO J. 16, 4174–4183 (1997)

    Article  Google Scholar 

  5. Cornell, W., Cieplak, P., Bayly, C., Gould, I., Merz, K., Ferguson, D., Spellmeyer, D., Fox, T., Caldwell, J., Kollman, P.: A second generation force field for the simulation of proteins, nucleic acids and organic molecules. J. Am. Chem. Soc. 117, 5179–5197 (1995)

    Article  Google Scholar 

  6. Desmet, J., Maeyer, M., Hazes, B., Lasters, I.: The dead-end elimination theorem and its use in protein side-chain positioning. Nature 356, 539–542 (1992)

    Article  Google Scholar 

  7. Doekel, S., Marahiel, M.: Dipeptide formation on engineered hybrid peptide synthetases. Chem. Biol. 7, 373–384 (2000)

    Article  Google Scholar 

  8. Eppelmann, K., Stachelhaus, T., Marahiel, M.: Exploitation of the selectivity-conferring code of nonribosomal peptide synthetases for the rational design of novel peptide antibiotics. Biochemistry 41, 9718–9726 (2002)

    Article  Google Scholar 

  9. Georgiev, I., Lilien, R., Donald, B.R.: 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. Technical Report 570, Dartmouth Computer Science Dept. (2006), http://www.cs.dartmouth.edu/reports/abstracts/TR2006-570

  10. Goldstein, R.: Efficient rotamer elimination applied to protein side-chains and related spin glasses. Biophys. J. 66, 1335–1340 (1994)

    Article  Google Scholar 

  11. Gordon, D., Mayo, S.: Radical performance enhancements for combinatorial optimization algorithms based on the dead-end elimination theorem. J. Comput. Chem. 19, 1505–1514 (1998)

    Article  Google Scholar 

  12. Hellinga, H., Richards, F.: Construction of new ligand binding sites in proteins of known structure: I. Computer-aided modeling of sites with pre-defined geometry. J. Mol. Biol. 222, 763–785 (1991)

    Article  Google Scholar 

  13. Jaramillo, A., Wernisch, L., Héry, S., Wodak, S.: Automatic procedures for protein design. Comb. Chem. High Throughput Screen. 4, 643–659 (2001)

    Google Scholar 

  14. Jin, W., Kambara, O., Sasakawa, H., Tamura, A., Takada, S.: De novo design of foldable proteins with smooth folding funnel: Automated negative design and experimental verification. Structure 11, 581–591 (2003)

    Article  Google Scholar 

  15. Keating, A., Malashkevich, V., Tidor, B., Kim, P.: Side-chain repacking calculations for predicting structures and stabilities of heterodimeric coiled coils. Proc. Natl. Acad. Sci. USA 98, 14825–14830 (2001)

    Article  Google Scholar 

  16. Leach, A., Lemon, A.: Exploring the conformational space of protein side chains using dead-end elimination and the A* algorithm. Proteins 33, 227–239 (1998)

    Article  Google Scholar 

  17. Lilien, R., Stevens, B., Anderson, A., Donald, B.R.: 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 (2005)

    Article  Google Scholar 

  18. Looger, L., Dwyer, M., Smith, J., Hellinga, H.: Computational design of receptor and sensor proteins with novel functions. Nature 423, 185–190 (2003)

    Article  Google Scholar 

  19. Lovell, S., Word, J., Richardson, J., Richardson, D.: The penultimate rotamer library. Proteins 40, 389–408 (2000)

    Article  Google Scholar 

  20. Marvin, J., Hellinga, H.: Conversion of a maltose receptor into a zinc biosensor by computational design. PNAS 98, 4955–4960 (2001)

    Article  Google Scholar 

  21. Mootz, H., Schwarzer, D., Marahiel, M.: Construction of hybrid peptide synthetases by module and domain fusions. Proc. Natl. Acad. Sci. USA 97, 5848–5853 (2000)

    Article  Google Scholar 

  22. Najmanovich, R., Kuttner, J., Sobolev, V., Edelman, M.: Side-chain flexibility in proteins upon ligand binding. Proteins 39(3), 261–268 (2000)

    Article  Google Scholar 

  23. Pierce, N., Spriet, J., Desmet, J., Mayo, S.: Conformational splitting: a more powerful criterion for dead-end elimination. J. Comput. Chem. 21, 999–1009 (2000)

    Article  Google Scholar 

  24. Pierce, N., Winfree, E.: Protein design is NP-hard. Protein Eng. 15, 779–782 (2002)

    Article  Google Scholar 

  25. Ponder, J., Richards, F.: Tertiary templates for proteins: use of packing criteria in the enumeration of allowed sequences for different structural classes. J. Mol. Biol. 193, 775–791 (1987)

    Article  Google Scholar 

  26. Schneider, A., Stachelhaus, T., Marahiel, M.: Targeted alteration of the substrate specificity of peptide synthetases by rational module swapping. Mol. Gen. Genet. 257, 308–318 (1998)

    Article  Google Scholar 

  27. Schwarzer, D., Finking, R., Marahiel, M.: Nonribosomal peptides: from genes to products. Nat. Prod. Rep. 20, 275–287 (2003)

    Article  Google Scholar 

  28. Stachelhaus, T., Mootz, H., Marahiel, M.: The specificiy-conferring code of adenylation domains in nonribosomal peptide synthetases. Chem. Biol. 6, 493–505 (1999)

    Article  Google Scholar 

  29. Stachelhaus, T., Schneider, A., Marahiel, M.: Rational design of peptide antibiotics by targeted replacement of bacterial and fungal domains. Science 269, 69–72 (1995)

    Article  Google Scholar 

  30. Street, A., Mayo, S.: Computational protein design. Structure 7, R105–R109 (1999)

    Google Scholar 

  31. Weiner, S., Kollman, P., Case, D., Singh, U., Ghio, C., Alagona, G., Profeta, S., Weiner, P.: A new force field for molecular mechanical simulation of nucleic acids and proteins. J. Am. Chem. Soc. 106, 765–784 (1984)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dartmouth Computer Science Department, Hanover, NH, 03755, USA

    Ivelin Georgiev, Ryan H. Lilien & Bruce R. Donald

  2. Dartmouth Medical School, Hanover, NH

    Ryan H. Lilien

  3. Dartmouth Center for Structural Biology and Computational Chemistry, Hanover, NH

    Ryan H. Lilien & Bruce R. Donald

  4. Dartmouth Department of Chemistry, Hanover, NH

    Bruce R. Donald

  5. Dartmouth Department of Biological Sciences, Hanover, NH

    Bruce R. Donald

Authors
  1. Ivelin Georgiev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ryan H. Lilien
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bruce R. Donald
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology and Università di Padova,  

    Alberto Apostolico

  2. Topic Chairs, P.O. Box

    Concettina Guerra

  3. Center for Molecular Biology and Computer Sciecne Department, Brown University, 115 Waterman St., 02912, Providence, RI, USA

    Sorin Istrail

  4. University of California, San Diego, USA

    Pavel A. Pevzner

  5. Department of Molecular and Computational Biology, University of Southern California, 1050 Childs Way, 90089-2910, Los Angeles, CA, USA

    Michael Waterman

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Georgiev, I., Lilien, R.H., 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: Apostolico, A., Guerra, C., Istrail, S., Pevzner, P.A., Waterman, M. (eds) Research in Computational Molecular Biology. RECOMB 2006. Lecture Notes in Computer Science(), vol 3909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11732990_44

Download citation

  • DOI: https://doi.org/10.1007/11732990_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33295-4

  • Online ISBN: 978-3-540-33296-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics