Novel Algorithms for Computational Protein Design, with Applications to Enzyme Redesign and Small-Molecule Inhibitor Design

<p>Computational protein design aims at identifying protein mutations and conformations with desired target properties (such as increased protein stability, switch of substrate specificity, or novel function) from a vast combinatorial space of candidate solutions. The development of algorithms...

Full description

Bibliographic Details
Main Author: Georgiev, Ivelin Stefanov
Other Authors: Donald, Bruce R
Format: Others
Language:en_US
Published: 2009
Subjects:
Online Access:http://hdl.handle.net/10161/1113
id ndltd-DUKE-oai-dukespace.lib.duke.edu-10161-1113
record_format oai_dc
spelling ndltd-DUKE-oai-dukespace.lib.duke.edu-10161-11132013-01-07T20:07:15ZNovel Algorithms for Computational Protein Design, with Applications to Enzyme Redesign and Small-Molecule Inhibitor DesignGeorgiev, Ivelin StefanovComputer ScienceDeadEnd Eliminationprotein flexibilityproteinligand bindingprovablyaccurate algorithmssmallmolecule inhibitorsstructurebased protein design<p>Computational protein design aims at identifying protein mutations and conformations with desired target properties (such as increased protein stability, switch of substrate specificity, or novel function) from a vast combinatorial space of candidate solutions. The development of algorithms to efficiently and accurately solve problems in protein design has thus posed significant computational and modeling challenges. Despite the inherent hardness of protein design, a number of computational techniques have been previously developed and applied to a wide range of protein design problems. In many cases, however, the available computational protein design techniques are deficient both in computational power and modeling accuracy. Typical simplifying modeling assumptions for computational protein design are the rigidity of the protein backbone and the discretization of the protein side-chain conformations. Here, we present the derivation, proofs of correctness and complexity, implementation, and application of novel algorithms for computational protein design that, unlike previous approaches, have provably-accurate guarantees even when backbone or continuous side-chain flexibility are incorporated into the model. We also describe novel divide-and-conquer and dynamic programming algorithms for improved computational efficiency that are shown to result in speed-ups of up to several orders of magnitude as compared to previously-available techniques. Our novel algorithms are further incorporated as part of K*, a provably-accurate ensemble-based algorithm for protein-ligand binding prediction and protein design. The application of our suite of protein design algorithms to a variety of problems, including enzyme redesign and small-molecule inhibitor design, is described. Experimental validation, performed by our collaborators, of a set of our computational predictions confirms the feasibility and usefulness of our novel algorithms for computational protein design.</p>DissertationDonald, Bruce R2009Dissertation4917326 bytesapplication/pdfhttp://hdl.handle.net/10161/1113en_US
collection NDLTD
language en_US
format Others
sources NDLTD
topic Computer Science
Dead
End Elimination
protein flexibility
protein
ligand binding
provably
accurate algorithms
small
molecule inhibitors
structure
based protein design
spellingShingle Computer Science
Dead
End Elimination
protein flexibility
protein
ligand binding
provably
accurate algorithms
small
molecule inhibitors
structure
based protein design
Georgiev, Ivelin Stefanov
Novel Algorithms for Computational Protein Design, with Applications to Enzyme Redesign and Small-Molecule Inhibitor Design
description <p>Computational protein design aims at identifying protein mutations and conformations with desired target properties (such as increased protein stability, switch of substrate specificity, or novel function) from a vast combinatorial space of candidate solutions. The development of algorithms to efficiently and accurately solve problems in protein design has thus posed significant computational and modeling challenges. Despite the inherent hardness of protein design, a number of computational techniques have been previously developed and applied to a wide range of protein design problems. In many cases, however, the available computational protein design techniques are deficient both in computational power and modeling accuracy. Typical simplifying modeling assumptions for computational protein design are the rigidity of the protein backbone and the discretization of the protein side-chain conformations. Here, we present the derivation, proofs of correctness and complexity, implementation, and application of novel algorithms for computational protein design that, unlike previous approaches, have provably-accurate guarantees even when backbone or continuous side-chain flexibility are incorporated into the model. We also describe novel divide-and-conquer and dynamic programming algorithms for improved computational efficiency that are shown to result in speed-ups of up to several orders of magnitude as compared to previously-available techniques. Our novel algorithms are further incorporated as part of K*, a provably-accurate ensemble-based algorithm for protein-ligand binding prediction and protein design. The application of our suite of protein design algorithms to a variety of problems, including enzyme redesign and small-molecule inhibitor design, is described. Experimental validation, performed by our collaborators, of a set of our computational predictions confirms the feasibility and usefulness of our novel algorithms for computational protein design.</p> === Dissertation
author2 Donald, Bruce R
author_facet Donald, Bruce R
Georgiev, Ivelin Stefanov
author Georgiev, Ivelin Stefanov
author_sort Georgiev, Ivelin Stefanov
title Novel Algorithms for Computational Protein Design, with Applications to Enzyme Redesign and Small-Molecule Inhibitor Design
title_short Novel Algorithms for Computational Protein Design, with Applications to Enzyme Redesign and Small-Molecule Inhibitor Design
title_full Novel Algorithms for Computational Protein Design, with Applications to Enzyme Redesign and Small-Molecule Inhibitor Design
title_fullStr Novel Algorithms for Computational Protein Design, with Applications to Enzyme Redesign and Small-Molecule Inhibitor Design
title_full_unstemmed Novel Algorithms for Computational Protein Design, with Applications to Enzyme Redesign and Small-Molecule Inhibitor Design
title_sort novel algorithms for computational protein design, with applications to enzyme redesign and small-molecule inhibitor design
publishDate 2009
url http://hdl.handle.net/10161/1113
work_keys_str_mv AT georgievivelinstefanov novelalgorithmsforcomputationalproteindesignwithapplicationstoenzymeredesignandsmallmoleculeinhibitordesign
_version_ 1716473305399033856