Show simple item record

dc.contributor.advisorBruce Tidor.en_US
dc.contributor.authorBiddle, Jason Charlesen_US
dc.contributor.otherMassachusetts Institute of Technology. Computation for Design and Optimization Program.en_US
dc.date.accessioned2011-03-24T18:53:01Z
dc.date.available2011-03-24T18:53:01Z
dc.date.copyright2010en_US
dc.date.issued2010en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/61792
dc.descriptionThesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2010.en_US
dc.descriptionThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.en_US
dc.descriptionCataloged from student-submitted PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (p. 107-111).en_US
dc.description.abstractIn this thesis, we summarize our work on applications and methods for computational protein design. First, we apply computational protein design to address the problem of degradation in stored proteins. Specifically, we target cysteine, asparagine, glutamine, and methionine amino acid residues to reduce or eliminate a protein's susceptibility to degradation via aggregation, deamidation, and oxidation. We demonstrate this technique on a subset of degradation-prone amino acids in phosphotriesterase, an enzyme that hydrolyzes toxic organophosphates including pesticides and chemical warfare agents. Second, we introduce BroMAP/A*, an exhaustive branch-and- bound search technique with enumeration. We compare performance of BroMAP/A* to DEE/A*, the current standard for conformational search with enumeration in the protein design community. When limited computational resources are available, DEE/A* sometimes fails to find the global minimum energy conformation and/or enumerate the lowest-energy conformations for large designs. Given the same computational resources, we show how BroMAP/A* is able to solve large designs by efficiently dividing the search space into small, solvable subproblems.en_US
dc.description.statementofresponsibilityby Jason Charles Biddle.en_US
dc.format.extent111 p.en_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectComputation for Design and Optimization Program.en_US
dc.titleMethods and applications in computational protein designen_US
dc.typeThesisen_US
dc.description.degreeS.M.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computation for Design and Optimization Program
dc.identifier.oclc706802883en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record