Dissertations / Theses on the topic 'Computational protein design'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Computational protein design.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Traore, Seydou. "Computational approaches toward protein design." Thesis, Toulouse, INSA, 2014. http://www.theses.fr/2014ISAT0033/document.
Full textComputational Protein Design (CPD) is a very young research field which aims at providing predictive tools to complementprotein engineering. Indeed, in addition to the theoretical understanding of fundamental properties and function of proteins,protein engineering has important applications in a broad range of fields, including biomedical applications, biotechnology,nanobiotechnology and the design of green reagents. CPD seeks at accelerating the design of proteins with wanted propertiesby enabling the exploration of larger sequence space while limiting the financial and human costs at experimental level.To succeed this endeavor, CPD requires three ingredients to be appropriately conceived: 1) a realistic modeling of the designsystem; 2) an accurate definition of objective functions for the target biochemical function or physico-chemical property; 3)and finally an efficient optimization framework to handle large combinatorial sizes.In this thesis, we addressed CPD problems with a special focus on combinatorial optimization. In a first series of studies, weapplied for the first time the Cost Function Network optimization framework to solve CPD problems and found that incomparison to other existing methods, it brings several orders of magnitude speedup on a wide range of real CPD instancesthat include the stability design of proteins, protein-protein and protein-ligand complexes. A tailored criterion to define themutation space of residues was also introduced in order to constrain output sequences to those expected by natural evolutionthrough the integration of some structural properties of amino acids in the protein environment. The developed methods werefinally integrated into a CPD-dedicated software in order to facilitate its accessibility to the scientific community
Wood, Christopher Robin Wells. "Computational design of parameterisable protein folds." Thesis, University of Bristol, 2016. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.715832.
Full textHong, Eun-Jong 1975. "Exact rotamer optimization for computational protein design." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44421.
Full textIncludes bibliographical references (leaves 235-244).
The search for the global minimum energy conformation (GMEC) of protein side chains is an important computational challenge in protein structure prediction and design. Using rotamer models, the problem is formulated as a NP-hard optimization problem. Dead-end elimination (DEE) methods combined with systematic A* search (DEE/A*) have proven useful, but may not be strong enough as we attempt to solve protein design problems where a large number of similar rotamers is eligible and the network of interactions between residues is dense. In this thesis, we present an exact solution method, named BroMAP (branch-and-bound rotamer optimization using MAP estimation), for such protein design problems. The design goal of BroMAP is to be able to expand smaller search trees than conventional branch-and-bound methods while performing only a moderate amount of computation in each node, thereby reducing the total running time. To achieve that, BroMAP attempts reduction of the problem size within each node through DEE and elimination by energy lower bounds from approximate maximurn-a-posteriori (MAP) estimation. The lower bounds are also exploited in branching and subproblem selection for fast discovery of strong upper bounds. Our computational results show that BroMAP tends to be faster than DEE/A* for large protein design cases. BroMAP also solved cases that were not solvable by DEE/A* within the maximum allowed time, and did not incur significant disadvantage for cases where DEE/A* performed well. In the second part of the thesis, we explore several ways of improving the energy lower bounds by using Lagrangian relaxation. Through computational experiments, solving the dual problem derived from cyclic subgraphs, such as triplets, is shown to produce stronger lower bounds than using the tree-reweighted max-product algorithm.
(cont.) In the second approach, the Lagrangian relaxation is tightened through addition of violated valid inequalities. Finally, we suggest a way of computing individual lower bounds using the dual method. The preliminary results from evaluating BroMAP employing the dual bounds suggest that the use of the strengthened bounds does not in general improve the running time of BroMAP due to the longer running time of the dual method.
by Eun-Jong Hong.
Ph.D.
Biddle, Jason Charles. "Methods and applications in computational protein design." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/61792.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (p. 107-111).
In 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.
by Jason Charles Biddle.
S.M.
Fuller, Jonathan Christopher. "Computational approaches for drug design at the protein-protein interface." Thesis, University of Leeds, 2010. http://etheses.whiterose.ac.uk/1699/.
Full textDavey, James A. "Multistate Computational Protein Design: Theories, Methods, and Applications." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/35541.
Full textMARCHETTI, FILIPPO. "COMPUTATIONAL STUDIES OF PROTEIN-PROTEIN AND PROTEIN-ANTIBODY INTERACTIONS: IMPLICATION FOR MOLECULAR DESIGN." Doctoral thesis, Università degli Studi di Milano, 2021. http://hdl.handle.net/2434/825462.
Full textGrigoryan, Gevorg Ph D. Massachusetts Institute of Technology. "Computational approaches for the design and prediction of protein-protein interactions." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/38997.
Full textIncludes bibliographical references (leaves 167-187).
There is a large class of applications in computational structural biology for which atomic-level representation is crucial for understanding the underlying biological phenomena, yet explicit atomic-level modeling is computationally prohibitive. Computational protein design, homology modeling, protein interaction prediction, docking and structure recognition are among these applications. Models that are commonly applied to these problems combine atomic-level representation with assumptions and approximations that make them computationally feasible. In this thesis I focus on several aspects of this type of modeling, analyze its limitations, propose improvements and explore applications to the design and prediction of protein-protein interactions.
by Gevorg Grigoryan.
Ph.D.
Park, Daniel J. (Daniel John) 1979. "Computational tools for including specificity in protein design." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/87286.
Full textSisu, Cristina Smaranda Domnica. "Computational studies on protein similarity, specificity and design." Thesis, University of Cambridge, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609407.
Full textLucato, Arianna <1991>. "Computational design of novel protein-drug delivery systems." Master's Degree Thesis, Università Ca' Foscari Venezia, 2019. http://hdl.handle.net/10579/16136.
Full textOpuu, Vaitea. "Computational design of proteins and enzymes." Thesis, Institut polytechnique de Paris, 2020. http://www.theses.fr/2020IPPAX081.
Full textWe propose a set of methods to design molecular systems. We start from naturally optimized components, namely proteins. Proteins can act as structural components, information transporters, or catalysts. We use computational methods to complement experiments and design protein systems.First, we fully redesigned a PDZ domain involved in metabolic pathways. We used a physics-based approach combining molecular mechanics, continuum electrostatics, and Monte Carlo sampling. Thousands of variants predicted to adopt the PDZ fold were selected. Three were validated experimentally. Two showed binding of the natural peptide ligand.Next, we redesigned the active site of the methionyl-tRNA synthetase enzyme (MetRS). We used an adaptive Monte Carlo method to select variants for methionine (Met) binding. Out of 17 predicted variants that were tested experimentally, 17 were found to be active. We extended the method to transition state binding to select mutants directly according to their catalytic power.We redesigned the MetRS binding site to obtain activity towards two β-amino acids, in order to expand the genetic code. These unnatural amino acids can enhance the structural repertoire of proteins. 20 predicted mutants were tested. Although none had increased β-Met activity, three had a gain in selectivity for β-Met. We then implemented a method to select optimal positions for design and applied it to β-Met and β-Val. Around 20 variants are being experimental tested.Finally, in vivo protein modifications raise the question of their eventual drift away from the original design. We introduce here a design approach for overlapping genes coding PDZ domains. This overlap would reduce genetic drift and provide bio-confinement. We computationally produced almost 2000 pairs of overlapping PDZ domains. One was validated by 2 microsecond molecular dynamic simulations. Experiments are underway
Jiang, Lin. "Novel catalysts by computational enzyme design /." Thesis, Connect to this title online; UW restricted, 2007. http://hdl.handle.net/1773/9248.
Full textHumphris, Elisabeth Lyn. "Computational protein design with multiple functional and structural constraints." Diss., Search in ProQuest Dissertations & Theses. UC Only, 2009. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3390110.
Full textHenne, Randal Marlow. "Computational studies of G-protein coupled receptors /." Thesis, Connect to this title online; UW restricted, 1999. http://hdl.handle.net/1773/8048.
Full textChen, Tsan-Chou Scott. "Design of protein-protein interaction specificity using computational methods and experimental library screening." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/70386.
Full textCataloged from PDF version of thesis.
Includes bibliographical references.
Computational design of protein-protein interaction specificity is a powerful tool to examine and expand our understanding about how protein sequence determines interaction specificity. It also has many applications in basic bioscience and biotechnology. One of the major challenges for design is that current scoring functions relying on general physical principles do not always make reliable predictions about interaction specificity. In this thesis I described application of two approaches to address this problem. The first approach sought to improve scoring functions with experimental interaction specificity data related to the protein family of design interest. I used this approach to design inhibitor peptides against the viral bZIP protein BZLF 1. Specificity against design self-interaction was considered in the study. The second approach exploited the power of experimental library screening to characterize a large number of designed sequences at once, increasing the overall probability of identifying successful designs. I presented a novel framework for such library design approach and applied it to the design of anti-apoptotic Bcl-2 proteins with novel interaction specificity toward BH3 peptides. Finally I proposed how these two approaches can be combined together to further enhance our design capabilities.
by Tsan-Chou Scott Chen.
Ph.D.
Dantas, Gautam. "In silico protein evolution by intelligent design : creating new and improved protein structures /." Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/9236.
Full textMaffucci, I. "OPTIMIZATION AND APPLICATION OF COMPUTATIONAL METHODS FOR THE DESIGN OF PROTEIN-PROTEIN INTERACTIONS MODULATORS." Doctoral thesis, Università degli Studi di Milano, 2015. http://hdl.handle.net/2434/344181.
Full textJoughin, Brian Alan. "Novel methods in computational analysis and design of protein-protein interactions : applications to phosphoregulated interactions." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/38630.
Full textIncludes bibliographical references (p. 107-130).
This thesis presents a number of novel computational methods for the analysis and design of protein-protein complexes, and their application to the study of the interactions of phosphopeptides with phosphopeptide-binding domain interactions. A novel protein-protein interaction type, the action-at-a-distance interaction, is described in the complex of the TEM1 P-lactamase with the 3-lactamase inhibitor protein (BLIP). New action-at-a-distance interactions were designed on the surface of BLIP and computed to enhance the affinity of that complex. A new method is described for the characterization and prediction of protein ligand-binding sites. This method was used to analyze the phosphoresidue-contacting sites of known phosphopeptide-binding domains, and to predict the sites of phosphoresidue-contact on some protein domains for which the correct site was not known. The design of a library of variant WW domains that is predicted to be enriched in domains that might have specificity for "pS/pT-Q" peptide ligands is detailed. General methods for designing libraries of degenerate oligonucleotides for expressing protein libraries as accurately as possible are given, and applied to the described WW domain variant library.
by Brian Alan Joughin.
Ph.D.
Leaver-Fay, Andrew Snoeyink Jack. "Capturing atomic interactions with a graphical framework in computational protein design." Chapel Hill, N.C. : University of North Carolina at Chapel Hill, 2006. http://dc.lib.unc.edu/u?/etd,613.
Full textTitle from electronic title page (viewed Oct. 10, 2007). "... in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Computer Science." Discipline: Computer Science; Department/School: Computer Science.
Doudou, Slimane. "Computational modelling of protein-ligand binding : steps towards better drug design." Thesis, University of Manchester, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.498949.
Full textBastianelli, Giacomo. "Computational design of protein-based serine proteases inhibitors : tools and applications." Paris 7, 2009. http://www.theses.fr/2009PA077175.
Full textPfSUBl and PfSUB2 are two key regulators of the erythrocytic stage of the parasite and are interesting drug targets for developing new leading compounds against malaria. The major limitations to the drug discovery on PfSUBs are the absence of an experimental structure and the difficulties of expressing large quantities of the active enzymes, restricting the use of high-throughput screening of compounds. To overcome these obstacles, we set up a discovery process based on the computational design of protein-based inhibitors. The thesis focused on developing, validating and applying a series of bioinformatics tools to use in computational protein design. We used these tools to change the specificity of an existing scaffold towards a malaria enzyme, identifying a EETI-II mutant that inhibits PvSUBl with a Ki of 86 μM. Our computational protein design approach was also applied to reverse-engineer PcFKl, a spider-venom derived small protein that inhibits the erythrocytic stage of P. Falciparum. The hypothesis we made using these tools was experimentally confirmed by the in-vitro enzymatic testing on PfSUBl. Despite the challenges we faced, mostly due to the lack of a expérimental structure of PvSUBl, we successfully designed the first protein-based inhibitor of SUBI. The reverse-engineering we performed on PcFKl further confirms the reliability of thèse structural bioinformatics methods
Durani, Venuka. "The Cycle of Protein Engineering: Bioinformatics Design of Two Dimeric Proteins and Computational Design of a Small Globular Domain." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1338311626.
Full textLegault, Sandrine. "Investigating Different Rational Design Approaches to Increase Brightness in Red Fluorescent Proteins." Thesis, Université d'Ottawa / University of Ottawa, 2021. http://hdl.handle.net/10393/42740.
Full textVankayala, Sai Lakshmana Kumar. "Computational Approaches for Structure Based Drug Design and Protein Structure-Function Prediction." Scholar Commons, 2013. http://scholarcommons.usf.edu/etd/4601.
Full textToschi, Francesca. "The computational investigation of protein/ligand complexes : implications for rational drug design." Thesis, University of Southampton, 2004. https://eprints.soton.ac.uk/378844/.
Full textSt-Jacques, Antony D. "Engineering of Multi-Substrate Enzyme Specificity and Conformational Equilibrium Using Multistate Computational Protein Design." Thesis, Université d'Ottawa / University of Ottawa, 2018. http://hdl.handle.net/10393/38590.
Full textGagnon, Olivier. "Development and Validation of a Structure-Based Computational Method for the Prediction of Protein Specificity Profiles." Thesis, Université d'Ottawa / University of Ottawa, 2019. http://hdl.handle.net/10393/39643.
Full textShah, Premal S. Rees Douglas C. "Advances in force field development and sequence optimization methods for computational protein design /." Diss., Pasadena, Calif. : California Institute of Technology, 2005. http://resolver.caltech.edu/CaltechETD:etd-04042005-142719.
Full textStemm, Mina Catherine. "Computational and combinatorial design of protein-based inhibitors of human tyrosyl-DNA phosphodiesterase /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2005. http://wwwlib.umi.com/cr/ucsd/fullcit?p3166399.
Full textMignon, David. "Computational protein design : un outil pour l'ingénierie des protéines et la biologie synthétique." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLX089/document.
Full textComputational Protein Design, or CPD is the search for the amino acid sequences compatible with a targeted protein structure. The goal is to design a new function and/or add a new behavior. CPD has been developed in our laboratory for several years, with the software Proteus which has several successes to its credit. Our approach uses a physics-based energy model, and relies on the energy difference between the folded and unfolded states of the protein. During this thesis, we enriched Proteus on several points, including the addition of a Monte Carlo exploration method with Replica Exchange or REMC. We compared extensively three stochastic methods for the exploration of sequence space: REMC, plain Monte Carlo and a heuristic designed for CPD: Multistart Steepest Descent or MSD.These comparisons concerned nine proteins from three structural families: SH2, SH3 and PDZ. Using the exploration techniques above, we were able to identify the Global Minimum EnergyConformation, or GMEC for nearly all the test cases where up to10 positions of the polypeptide chain were free to mutate (the others retaining their native types). For the tests where 20positions were free to mutate, the GMEC was identified in 2/3 of the cases. Overall, REMC and MSD give very good sequences in terms of energy, often identical or very close to the GMEC. MSDperformed best in the tests with 30 mutating positions. REMCwith eight replicas and optimized parameters often gave the best result when all positions could mutate. Moreover, compared to an exact enumeration of the low energy sequences, REMC provided a sample of sequences with a high sequence diversity.In the second part of this work, we tested our CPD model forPDZ domain design. For the folded state, we used two variants ofa GB solvent model. The first used a mean, effective protein/solvent dielectric boundary; the second one, more rigorous, used an exact boundary that flucutated over the MCtrajectory. To characterize the unfolded state, we used a set of amino acid chemical potentials or reference energies. These reference energies were determined by maximizing a likelihoodfunction so as to reproduce the amino acid frequencies in naturalPDZ domains. The sequences designed by Proteus were compared to the natural sequences. Our sequences are globally similar to the Pfam sequences, in the sense of the BLOSUM40scores, with especially high scores for the residues in the core ofthe protein. The more rigorous GB variant always gives sequences similar to moderately distant natural homologues and perfect recognition by the the Super family fold recognition tool.Our sequences were also compared to those produced by the Rosetta software. The quality, according to the same criteria as before, was very similar, but the Rosetta sequences exhibit fewer mutations than the Proteus sequences
Hom, Geoffrey Deshaies Raymond Joseph. "Advances in computational protein design : development of more efficient search algorithms and their application to the full-sequence design of larger proteins /." Diss., Pasadena, Calif. : California Institute of Technology, 2005. http://resolver.caltech.edu/CaltechETD:etd-05302005-223153.
Full textGULOTTA, Maria Rita. "Computational methodologies applied to Protein-Protein Interactions for molecular insights in Medicinal Chemistry." Doctoral thesis, Università degli Studi di Palermo, 2021. http://hdl.handle.net/10447/479127.
Full textFeldmeier, Kaspar Konrad [Verfasser], and Birte [Akademischer Betreuer] Höcker. "Form and Function : Two computational protein design studies / Kaspar Konrad Feldmeier ; Betreuer: Birte Höcker." Tübingen : Universitätsbibliothek Tübingen, 2016. http://d-nb.info/1164169718/34.
Full textRoss, Gregory A. "Improving rapid affinity calculations for drug-protein interactions." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:62ccfb5e-10f1-40ec-9a2b-936277944d87.
Full textDenarie, Laurent. "Robotics-inspired methods to enhance protein design." Phd thesis, Toulouse, INPT, 2017. http://oatao.univ-toulouse.fr/18677/1/Denarie.pdf.
Full textCapelli, R. "COMPUTATIONAL MODELING OF PROTEINS: FROM STATISTICAL MECHANICS TO IMMUNOLOGY." Doctoral thesis, Università degli Studi di Milano, 2017. http://hdl.handle.net/2434/527950.
Full textBadieyan, Somayesadat. "Molecular Design and Mechanistic Characterization of Glycoside Hydrolases using Computational and Experimental Techniques." Diss., Virginia Tech, 2012. http://hdl.handle.net/10919/77989.
Full textPh. D.
Correia, Bruno Emanuel Ferreira de Sousa. "Computational design with flexible backbone sampling for protein remodeling and scaffolding of complex binding sites." Doctoral thesis, Universidade Nova de Lisboa. Instituto de Tecnologia Química e Biológica, 2010. http://hdl.handle.net/10362/5791.
Full textComputational protein design has achieved several milestones, including the design of a new protein fold, the design of enzymes for reactions that lack natural catalysts, and the re-engineering of protein-protein and protein-DNA binding speci city. These achievements have spurred demand to apply protein design methods to a wider array of research problems. However, the existing computational methods have largely relied on xed-backbone approaches that may limit the scope of problems that can be tackled. Here, we describe four computational protocols - side chain grafting, exible backbone remodeling, backbone grafting, and de novo sca old design - that expand the methodological protein design repertoire, three of which incorporate backbone exibility. Brie y, in the side chain grafting method, side chains of a structural motif are transplanted to a protein with a similar backbone conformation; in exible backbone remodeling, de novo segments of backbone are built and designed; in backbone grafting, structural motifs are explicitly grafted onto other proteins; and in de novo sca olding, a protein is folded and designed around a structural motif. We developed these new methods for the design of epitope-sca old vaccines in which viral neutralization epitopes of known three-dimensional structure were transplanted onto nonviral sca old proteins for conformational stabilization and immune presentation.(...)
Druart, Karen. "Défis algorithmiques pour les simulations biomoléculaires et la conception de protéines." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLX080/document.
Full textComputational protein design is a method to modify proteins and obtain new properties, using their 3D structure and molecular modelling. To make the method more predictive, the models need continued improvement. In this thesis, we addressed the problem of explicitly representing the flexibility of the protein backbone. We developed a "multi-state" design approach, based on a small library of backbone conformations, defined ahead of time. In a Monte Carlo framework, given the rugged protein energy landscape, large backbone motions can only be accepted if precautions are taken. Thus, to explore these conformations, along with sidechain mutations and motions, we have introduced a new type of Monte Carlo move. The move is a "hybrid" one, where the backbone changes its conformation, then a short Monte Carlo relaxation of the sidechains is done, followed by an acceptation test. To obtain a Boltzmann sampling of states, the acceptation probability should have a specific form, which involves a path integral that is difficult to calculate. Two approximate forms are explored: the first is based on a single relaxation path, or "generating path" (Single Path Approximation or SPA). The second is more complex and relies on a collection of paths, obtained by shuffling the elementary steps of the generating path (Permuted Path Approximation or PPA). These approximations are tested in depth and compared on two proteins. Free energy differences between the backbone conformations are computed using three different approaches, which move the system reversibly from one conformation to another, but follow very different routes. Good agreement is obtained between the methods and a wide range of parameterizations, indicating that the free energy behaves as a state function, as it should, and strongly suggesting that Boltzmann sampling is verified. The sampling method is applied to the tyrosyl-tRNA synthetase enzyme, allowing us to identify sequences that prefer either an open or a closed conformation of an active site loop, so that in principle we can control, or design the loop conformation. Finally, we describe preliminary work to make the protein backbone fully flexible, moving within a continuous and not a discrete space. This new conformational space requires a complete reorganization of the energy calculation and Monte Carlo simulation scheme, increases simulation cost substantially, and requires a much more aggressive parallelization of our software
Fang, Lei. "COMPUTATIONAL MODELING, DESIGN, AND CHARACTERIZATION OF COCAINE-METABOLIZING ENZYMES FOR ANTI-COCAINE MEDICATION." UKnowledge, 2013. http://uknowledge.uky.edu/pharmacy_etds/39.
Full textLi, Weiyi. "Protein Engineering Hydrophobic Core Residues of Computationally Designed Protein G and Single-Chain Rop: Investigating the Relationship between Protein Primary structure and Protein Stability through High-Throughput Approaches." The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1398956266.
Full textDomin, Gesine, Sven Findeiß, Manja Wachsmuth, Sebastian Will, Peter F. Stadler, and Mario Mörl. "Applicability of a computational design approach for synthetic riboswitches." Universitätsbibliothek Leipzig, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-218007.
Full textDomin, Gesine, Sven Findeiß, Manja Wachsmuth, Sebastian Will, Peter F. Stadler, and Mario Mörl. "Applicability of a computational design approach for synthetic riboswitches." Oxford University Press, 2016. https://ul.qucosa.de/id/qucosa%3A15259.
Full textMahasenan, Kiran V. "Discovery of novel small molecule enzyme inhibitors and receptor modulators through structure-based computational design." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1332367560.
Full textAltman, Michael Darren. "Computational ligand design and analysis in protein complexes using inverse methods, combinatorial search, and accurate solvation modeling." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36258.
Full textVita.
Includes bibliographical references (p. 207-230).
This thesis presents the development and application of several computational techniques to aid in the design and analysis of small molecules and peptides that bind to protein targets. First, an inverse small-molecule design algorithm is presented that can explore the space of ligands compatible with binding to a target protein using fast combinatorial search methods. The inverse design method was applied to design inhibitors of HIV-1 protease that should be less likely to induce resistance mutations because they fit inside a consensus substrate envelope. Fifteen designed inhibitors were chemically synthesized, and four of the tightest binding compounds to the wild-type protease exhibited broad specificity against a panel of drug resistance mutant proteases in experimental tests. Inverse protein design methods and charge optimization were also applied to improve the binding affinity of a substrate peptide for an inactivated mutant of HIV-1 protease, in an effort to learn more about the thermodynamics and mechanisms of peptide binding. A single mutant peptide calculated to have improved binding electrostatics exhibited greater than 10-fold improved affinity experimentally.
(cont.) The second half of this thesis presents an accurate method for evaluating the electrostatic component of solvation and binding in molecular systems, based on curved boundary-element method solutions of the linearized Poisson-Boltzmann equation. Using the presented FFTSVD matrix compression algorithm and other techniques, a full linearized Poisson-Boltzmann equation solver is described that is capable of solving multi-region problems in molecular continuum electrostatics to high precision.
Michael Darren Altman.
Ph.D.
Lanouette, Sylvain. "Characterization of the Protein Lysine Methyltransferase SMYD2." Thesis, Université d'Ottawa / University of Ottawa, 2015. http://hdl.handle.net/10393/32467.
Full textRadoux, Christopher John. "The automatic detection of small molecule binding hotspots on proteins : applying hotspots to structure-based drug design." Thesis, University of Cambridge, 2017. https://www.repository.cam.ac.uk/handle/1810/275133.
Full textAlmlöf, Martin. "Computational Methods for Calculation of Ligand-Receptor Binding Affinities Involving Protein and Nucleic Acid Complexes." Doctoral thesis, Uppsala University, Department of Cell and Molecular Biology, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-7421.
Full textThe ability to accurately predict binding free energies from computer simulations is an invaluable resource in understanding biochemical processes and drug action. Several methods based on microscopic molecular dynamics simulations exist, and in this thesis the validation, application, and development of the linear interaction energy (LIE) method is presented.
For a test case of several hydrophobic ligands binding to P450cam it is found that the LIE parameters do not change when simulations are performed with three different force fields. The nonpolar contribution to binding of these ligands is best reproduced with a constant offset and a previously determined scaling of the van der Waals interactions.
A new methodology for prediction of binding free energies of protein-protein complexes is investigated and found to give excellent agreement with experimental results. In order to reproduce the nonpolar contribution to binding, a different scaling of the van der Waals interactions is neccesary (compared to small ligand binding) and found to be, in part, due to an electrostatic preorganization effect not present when binding small ligands.
A new treatment of the electrostatic contribution to binding is also proposed. In this new scheme, the chemical makeup of the ligand determines the scaling of the electrostatic ligand interaction energies. These scaling factors are calibrated using the electrostatic contribution to hydration free energies and proposed to be applicable to ligand binding.
The issue of codon-anticodon recognition on the ribosome is adressed using LIE. The calculated binding free energies are in excellent agreement with experimental results, and further predict that the Leu2 anticodon stem loop is about 10 times more stable than the Ser stem loop in complex with a ribosome loaded with the Phe UUU codon. The simulations also support the previously suggested roles of A1492, A1493, and G530 in the codon-anticodon recognition process.
Park, In-Hee. "Computational Simulations of Protein-Ligand Molecular Recognition via Enhanced Samplings, Free Energy Calculations and Applications to Structure-Based Drug Design." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1276745410.
Full text