Comets (Constrained Optimization of Multistate Energies by Tree Search): A Provable and Efficient Algorithm to Optimize Binding Affinity and Specificity with Respect to Sequence
Practical protein design problems require designing sequences with a combination of affinity, stability, and specificity requirements. Multistate protein design algorithms model multiple structural or binding “states" of a protein to address these requirements. comets provides a new level of versatile, efficient, and provable multistate design. It provably returns the minimum with respect to sequence of any desired linear combination of the energies of multiple protein states, subject to constraints on other linear combinations. Thus, it can target nearly any combination of affinity (to one or multiple ligands), specificity, and stability (for multiple states if needed). Empirical calculations on 52 protein design problems showed comets is far more efficient than the previous state of the art for provable multistate design (exhaustive search over sequences). comets can handle a very wide range of protein flexibility and can enumerate a gap-free list of the best constraint-satisfying sequences in order of objective function value.
KeywordsProtein Design Sequence Space Exhaustive Search Conformational Space Unbind State
Unable to display preview. Download preview PDF.
- 5.Donald, B.R.: Algorithms in Structural Molecular Biology. MIT Press (2011)Google Scholar
- 7.Fromer, M.: A Probabilistic Approach to the Design of Structural Selectivity of Proteins. PhD thesis, Hebrew University of Jerusalem (2010)Google Scholar
- 9.Fromer, M., et al.: Design of multispecific protein sequences using probabilistic graphical modeling. Proteins: Structure, Function, and Bioinformatics 78(3), 530–547 (2010)Google Scholar
- 16.Georgiev, I., et al.: osprey (Open Source Protein Redesign for You) user manual (2009). http://www.cs.duke.edu/donaldlab/software.php; Updated, 2015. 96 pages
- 19.Hallen, M.A., et al.: Dead-end elimination with perturbations (DEEPer): A provable protein design algorithm with continuous sidechain and backbone flexibility. Proteins: Structure, Function and Bioinformatics 81(1), 18–39 (2013)Google Scholar
- 20.Supplementary material. http://www.cs.duke.edu/donaldlab/Supplementary/recomb15/comets/
- 33.Roberts, K.E.: Novel Computational Protein Design Algorithms with Applications to Cystic Fibrosis and HIV. PhD thesis, Duke University (2014)Google Scholar
- 35.Rudicell, R.S., et al.: Enhanced potency of a broadly neutralizing HIV-1 antibody in vitro improves protection against lentiviral infection in vivo. Journal of Virology (2014); Published online, 2014Google Scholar