↓ Skip to main content

Computational Protein Design

Overview of attention for book
Cover of 'Computational Protein Design'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Framework of Computational Protein Design.
  3. Altmetric Badge
    Chapter 2 Achievements and Challenges in Computational Protein Design.
  4. Altmetric Badge
    Chapter 3 Production of Computationally Designed Small Soluble- and Membrane-Proteins: Cloning, Expression, and Purification.
  5. Altmetric Badge
    Chapter 4 Deterministic Search Methods for Computational Protein Design.
  6. Altmetric Badge
    Chapter 5 Geometric Potentials for Computational Protein Sequence Design.
  7. Altmetric Badge
    Chapter 6 Modeling Binding Affinity of Pathological Mutations for Computational Protein Design.
  8. Altmetric Badge
    Chapter 7 Multistate Computational Protein Design with Backbone Ensembles.
  9. Altmetric Badge
    Chapter 8 Integration of Molecular Dynamics Based Predictions into the Optimization of De Novo Protein Designs: Limitations and Benefits.
  10. Altmetric Badge
    Chapter 9 Applications of Normal Mode Analysis Methods in Computational Protein Design.
  11. Altmetric Badge
    Chapter 10 Computational Protein Design Under a Given Backbone Structure with the ABACUS Statistical Energy Function.
  12. Altmetric Badge
    Chapter 11 Computational Protein Design Through Grafting and Stabilization.
  13. Altmetric Badge
    Chapter 12 An Evolution-Based Approach to De Novo Protein Design.
  14. Altmetric Badge
    Chapter 13 Parallel Computational Protein Design.
  15. Altmetric Badge
    Chapter 14 Computational Protein Design
  16. Altmetric Badge
    Chapter 15 OSPREY Predicts Resistance Mutations Using Positive and Negative Computational Protein Design.
  17. Altmetric Badge
    Chapter 16 Evolution-Inspired Computational Design of Symmetric Proteins.
  18. Altmetric Badge
    Chapter 17 A Protocol for the Design of Protein and Peptide Nanostructure Self-Assemblies Exploiting Synthetic Amino Acids.
  19. Altmetric Badge
    Chapter 18 Probing Oligomerized Conformations of Defensin in the Membrane.
  20. Altmetric Badge
    Chapter 19 Computational Design of Ligand Binding Proteins.
  21. Altmetric Badge
    Chapter 20 EpiSweep: Computationally Driven Reengineering of Therapeutic Proteins to Reduce Immunogenicity While Maintaining Function.
  22. Altmetric Badge
    Chapter 21 Computational Tools for Aiding Rational Antibody Design.
  23. Altmetric Badge
    Chapter 22 Computational Design of Membrane Curvature-Sensing Peptides.
  24. Altmetric Badge
    Chapter 23 Computational Tools for Allosteric Drug Discovery: Site Identification and Focus Library Design.
Attention for Chapter 4: Deterministic Search Methods for Computational Protein Design.
Altmetric Badge

Citations

dimensions_citation
13 Dimensions

Readers on

mendeley
9 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Deterministic Search Methods for Computational Protein Design.
Chapter number 4
Book title
Computational Protein Design
Published in
Methods in molecular biology, January 2017
DOI 10.1007/978-1-4939-6637-0_4
Pubmed ID
Book ISBNs
978-1-4939-6635-6, 978-1-4939-6637-0
Authors

Seydou Traoré, David Allouche, Isabelle André, Thomas Schiex, Sophie Barbe

Editors

Ilan Samish

Abstract

One main challenge in Computational Protein Design (CPD) lies in the exploration of the amino-acid sequence space, while considering, to some extent, side chain flexibility. The exorbitant size of the search space urges for the development of efficient exact deterministic search methods enabling identification of low-energy sequence-conformation models, corresponding either to the global minimum energy conformation (GMEC) or an ensemble of guaranteed near-optimal solutions. In contrast to stochastic local search methods that are not guaranteed to find the GMEC, exact deterministic approaches always identify the GMEC and prove its optimality in finite but exponential worst-case time. After a brief overview on these two classes of methods, we discuss the grounds and merits of four deterministic methods that have been applied to solve CPD problems. These approaches are based either on the Dead-End-Elimination theorem combined with A* algorithm (DEE/A*), on Cost Function Networks algorithms (CFN), on Integer Linear Programming solvers (ILP) or on Markov Random Fields solvers (MRF). The way two of these methods (DEE/A* and CFN) can be used in practice to identify low-energy sequence-conformation models starting from a pairwise decomposed energy matrix is detailed in this review.

Mendeley readers

The data shown below were compiled from readership statistics for 9 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 9 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 5 56%
Student > Ph. D. Student 1 11%
Unknown 3 33%
Readers by discipline Count As %
Computer Science 3 33%
Agricultural and Biological Sciences 2 22%
Unknown 4 44%