28 results on '"Michael D. Tyka"'
Search Results
2. Toward a consensus framework to evaluate air–sea <scp> CO 2 </scp> equilibration for marine <scp> CO 2 </scp> removal
- Author
-
Lennart T. Bach, David T. Ho, Philip W. Boyd, and Michael D. Tyka
- Subjects
Aquatic Science ,Oceanography - Published
- 2023
3. Simulating context-driven activity cascades in online social networks on the google exacycle platform.
- Author
-
Arun V. Sathanur, Miao Sui, Vikram Jandhyala, Michael D. Tyka, and Nicole A. Deflaux
- Published
- 2014
- Full Text
- View/download PDF
4. Automated Reconstruction of a Serial-Section EM Drosophila Brain With Flood-Filling Networks and Local Realignment
- Author
-
Davi D. Bock, Laramie Leavitt, Eric Perlman, István Taisz, Feng Li, Larry Lindsey, Michał Januszewski, Peter H. Li, Jeremy Maitin-Shepard, Gregory S.X.E. Jefferis, Alexander Shakeel Bates, Michael D. Tyka, Matthew Nichols, Viren Jain, Zhihao Zheng, and Tim Blakely
- Subjects
business.industry ,Computer science ,Key (cryptography) ,Volume (computing) ,Pairwise sequence alignment ,Image content ,Segmentation ,Computer vision ,Serial section ,Artificial intelligence ,Tracing ,business ,Skeletonization - Abstract
Reconstruction of neural circuitry at single-synapse resolution is a key target for improving understanding of the nervous system in health and disease. Serial section transmission electron microscopy (ssTEM) is among the most prolific imaging methods employed in pursuit of such reconstructions. We demonstrate how Flood-Filling Networks (FFNs) can be used to computationally segment a forty-teravoxel whole-brain Drosophila ssTEM volume. To compensate for data irregularities and imperfect global alignment, FFNs were combined with procedures that locally re-align serial sections as well as dynamically adjust and synthesize image content. The proposed approach produced a largely merger-free segmentation of the entire ssTEM Drosophila brain, which we make freely available. As compared to manual tracing using an efficient skeletonization strategy, the segmentation enabled circuit reconstruction and analysis workflows that were an order of magnitude faster.
- Published
- 2021
5. Principles for computational design of binding antibodies
- Author
-
Sarel J. Fleishman, Tamar Unger, Orly Dym, Gideon Lapidoth, Dror Baran, Christoffer Norn, M. Gabriele Pszolla, Michael D. Tyka, and Shira Albeck
- Subjects
0301 basic medicine ,Models, Molecular ,Protein Conformation ,Computational biology ,Crystallography, X-Ray ,Ligands ,Antibodies ,03 medical and health sciences ,Molecular function ,Computational design ,Humans ,Insulin ,Immunoglobulin Fragments ,Multidisciplinary ,030102 biochemistry & molecular biology ,Chemistry ,V(D)J recombination ,Mycobacterium tuberculosis ,Biological Sciences ,Antigen binding ,Affinities ,Complementarity Determining Regions ,Crystallography ,030104 developmental biology ,Binding Sites, Antibody ,Acyl-Carrier Protein S-Acetyltransferase - Abstract
Natural proteins must both fold into a stable conformation and exert their molecular function. To date, computational design has successfully produced stable and atomically accurate proteins by using so-called “ideal” folds rich in regular secondary structures and almost devoid of loops and destabilizing elements, such as cavities. Molecular function, such as binding and catalysis, however, often demands nonideal features, including large and irregular loops and buried polar interaction networks, which have remained challenging for fold design. Through five design/experiment cycles, we learned principles for designing stable and functional antibody variable fragments (Fvs). Specifically, we (i) used sequence-design constraints derived from antibody multiple-sequence alignments, and (ii) during backbone design, maintained stabilizing interactions observed in natural antibodies between the framework and loops of complementarity-determining regions (CDRs) 1 and 2. Designed Fvs bound their ligands with midnanomolar affinities and were as stable as natural antibodies, despite having >30 mutations from mammalian antibody germlines. Furthermore, crystallographic analysis demonstrated atomic accuracy throughout the framework and in four of six CDRs in one design and atomic accuracy in the entire Fv in another. The principles we learned are general, and can be implemented to design other nonideal folds, generating stable, specific, and precise antibodies and enzymes.
- Published
- 2017
6. Automated Reconstruction of a Serial-Section EM Drosophila Brain with Flood-Filling Networks and Local Realignment
- Author
-
István Taisz, Michał Januszewski, Michael D. Tyka, Gregory S.X.E. Jefferis, Jeremy Maitin-Shepard, Viren Jain, Alexander Shakeel Bates, Eric Perlman, Zhihao Zheng, Laramie Leavitt, Feng Li, Matthew Nichols, Larry Lindsey, Tim Blakely, Peter H. Li, and Davi D. Bock
- Subjects
0303 health sciences ,Computer science ,business.industry ,Volume (computing) ,Serial section ,Skeletonization ,03 medical and health sciences ,0302 clinical medicine ,Transmission electron microscopy ,Segmentation ,Computer vision ,Artificial intelligence ,business ,030217 neurology & neurosurgery ,030304 developmental biology - Abstract
Reconstruction of neural circuitry at single-synapse resolution is a key target for improving understanding of the nervous system in health and disease. Serial section transmission electron microscopy (ssTEM) is among the most prolific imaging methods employed in pursuit of such reconstructions. We demonstrate how Flood-Filling Networks (FFNs) can be used to computationally segment a forty-teravoxel whole-brain Drosophila ssTEM volume. To compensate for data irregularities and imperfect global alignment, FFNs were combined with procedures that locally re-align serial sections as well as dynamically adjust and synthesize image content. The proposed approach produced a largely merger-free segmentation of the entire ssTEM Drosophila brain, which we make freely available. As compared to manual tracing using an efficient skeletonization strategy, the segmentation enabled circuit reconstruction and analysis workflows that were an order of magnitude faster.
- Published
- 2019
7. High-precision automated reconstruction of neurons with flood-filling networks
- Author
-
Art Pope, Tim Blakely, Peter H. Li, Michał Januszewski, Viren Jain, Jeremy Maitin-Shepard, Larry Lindsey, Winfried Denk, Michael D. Tyka, and Jörgen Kornfeld
- Subjects
0301 basic medicine ,Male ,Neurite ,Computer science ,Tracing ,Machine learning ,computer.software_genre ,Biochemistry ,Convolutional neural network ,Machine Learning ,03 medical and health sciences ,Mice ,0302 clinical medicine ,Imaging, Three-Dimensional ,Path length ,Microscopy, Electron, Transmission ,Biological neural network ,Image Processing, Computer-Assisted ,Neurites ,Animals ,Segmentation ,Molecular Biology ,Zebra finch ,TRACE (psycholinguistics) ,Neurons ,Computational neuroscience ,business.industry ,Brain ,Cell Biology ,Data set ,030104 developmental biology ,Test set ,Drosophila ,Artificial intelligence ,Finches ,Nerve Net ,business ,Algorithm ,computer ,030217 neurology & neurosurgery ,Algorithms ,Biotechnology - Abstract
Reconstruction of neural circuits from volume electron microscopy data requires the tracing of cells in their entirety, including all their neurites. Automated approaches have been developed for tracing, but their error rates are too high to generate reliable circuit diagrams without extensive human proofreading. We present flood-filling networks, a method for automated segmentation that, similar to most previous efforts, uses convolutional neural networks, but contains in addition a recurrent pathway that allows the iterative optimization and extension of individual neuronal processes. We used flood-filling networks to trace neurons in a dataset obtained by serial block-face electron microscopy of a zebra finch brain. Using our method, we achieved a mean error-free neurite path length of 1.1 mm, and we observed only four mergers in a test set with a path length of 97 mm. The performance of flood-filling networks was an order of magnitude better than that of previous approaches applied to this dataset, although with substantially increased computational costs.
- Published
- 2018
8. Automated Reconstruction of a Serial-Section EM Drosophila Brain with Flood-Filling Networks and Local Realignment
- Author
-
Larry Lindsey, Peter H. Li, Tim Blakely, Michał Januszewski, Jeremy Maitin-Shepard, Viren Jain, and Michael D. Tyka
- Subjects
Flood myth ,biology ,Computer science ,Serial section ,Drosophila (subgenus) ,biology.organism_classification ,Instrumentation ,Cartography - Published
- 2019
9. AbDesign: An algorithm for combinatorial backbone design guided by natural conformations and sequences
- Author
-
Dror Baran, Sarel J. Fleishman, Michael D. Tyka, Christoffer Norn, Assaf Alon, Gabriele M. Pszolla, and Gideon Lapidoth
- Subjects
chemistry.chemical_classification ,0303 health sciences ,Protein function ,Chemistry ,V(D)J recombination ,Sequence (biology) ,Backbone conformation ,Biochemistry ,Sequence identity ,Amino acid ,03 medical and health sciences ,0302 clinical medicine ,Structural Biology ,DOCK ,Molecular Biology ,Algorithm ,030217 neurology & neurosurgery ,030304 developmental biology ,Natural antibody - Abstract
Computational design of protein function has made substantial progress, generating new enzymes, binders, inhibitors, and nanomaterials not previously seen in nature. However, the ability to design new protein backbones for function--essential to exert control over all polypeptide degrees of freedom--remains a critical challenge. Most previous attempts to design new backbones computed the mainchain from scratch. Here, instead, we describe a combinatorial backbone and sequence optimization algorithm called AbDesign, which leverages the large number of sequences and experimentally determined molecular structures of antibodies to construct new antibody models, dock them against target surfaces and optimize their sequence and backbone conformation for high stability and binding affinity. We used the algorithm to produce antibody designs that target the same molecular surfaces as nine natural, high-affinity antibodies; in five cases interface sequence identity is above 30%, and in four of those the backbone conformation at the core of the antibody binding surface is within 1 A root-mean square deviation from the natural antibodies. Designs recapitulate polar interaction networks observed in natural complexes, and amino acid sidechain rigidity at the designed binding surface, which is likely important for affinity and specificity, is high compared to previous design studies. In designed anti-lysozyme antibodies, complementarity-determining regions (CDRs) at the periphery of the interface, such as L1 and H2, show greater backbone conformation diversity than the CDRs at the core of the interface, and increase the binding surface area compared to the natural antibody, potentially enhancing affinity and specificity.
- Published
- 2015
10. Relaxation of backbone bond geometry improves protein energy landscape modeling
- Author
-
David Baker, Frank DiMaio, Michael D. Tyka, David E. Konerding, and Patrick Conway
- Subjects
Protein fragment library ,Flexibility (engineering) ,Quantitative Biology::Biomolecules ,Protein structure ,Molecular geometry ,Chemistry ,Energy landscape ,Geometry ,Relaxation (approximation) ,Granularity ,Protein structure prediction ,Molecular Biology ,Biochemistry - Abstract
A key issue in macromolecular structure modeling is the granularity of the molecular representation. A fine-grained representation can approximate the actual structure more accurately, but may require many more degrees of freedom than a coarse-grained representation and hence make conformational search more challenging. We investigate this tradeoff between the accuracy and the size of protein conformational search space for two frequently used representations: one with fixed bond angles and lengths and one that has full flexibility. We performed large-scale explorations of the energy landscapes of 82 protein domains under each model, and find that the introduction of bond angle flexibility significantly increases the average energy gap between native and non-native structures. We also find that incorporating bonded geometry flexibility improves low resolution X-ray crystallographic refinement. These results suggest that backbone bond angle relaxation makes an important contribution to native structure energetics, that current energy functions are sufficiently accurate to capture the energetic gain associated with subtle deformations from chain ideality, and more speculatively, that backbone geometry distortions occur late in protein folding to optimize packing in the native state.
- Published
- 2013
11. Efficient sampling of protein conformational space using fast loop building and batch minimization on highly parallel computers
- Author
-
Michael D. Tyka, David Baker, and Kenneth G. Jung
- Subjects
Models, Molecular ,Speedup ,Theoretical computer science ,Protein Conformation ,Computer science ,Proteins ,Energy landscape ,General Chemistry ,Protein structure prediction ,Chip ,Article ,Force field (chemistry) ,Computational science ,Computational Mathematics ,Workflow ,Computer Simulation ,Minification ,Scaling ,Algorithms - Abstract
All-atom sampling is a critical and compute-intensive end stage to protein structural modeling. Because of the vast size and extreme ruggedness of conformational space, even close to the native structure, the high-resolution sampling problem is almost as difficult as predicting the rough fold of a protein. Here, we present a combination of new algorithms that considerably speed up the exploration of very rugged conformational landscapes and are capable of finding heretofore hidden low-energy states. The algorithm is based on a hierarchical workflow and can be parallelized on supercomputers with up to 128,000 compute cores with near perfect efficiency. Such scaling behavior is notable, as with Moore's law continuing only in the number of cores per chip, parallelizability is a critical property of new algorithms. Using the enhanced sampling power, we have uncovered previously invisible deficiencies in the Rosetta force field and created an extensive decoy training set for optimizing and testing force fields.
- Published
- 2012
12. Algorithm discovery by protein folding game players
- Author
-
Zoran Popović, David Baker, Foldit Players, Kefan Xu, Seth Cooper, Michael D. Tyka, Firas Khatib, and Ilya Makedon
- Subjects
Internet ,Protein Folding ,education.field_of_study ,Multidisciplinary ,Protein Conformation ,business.industry ,Computer science ,Population ,ComputingMilieux_PERSONALCOMPUTING ,Computational Biology ,Folding (DSP implementation) ,Biological Sciences ,ENCODE ,Group Processes ,Games, Experimental ,Crowd sourcing ,Benchmark (computing) ,Citizen science ,The Internet ,business ,education ,Algorithm ,Algorithms - Abstract
Foldit is a multiplayer online game in which players collaborate and compete to create accurate protein structure models. For specific hard problems, Foldit player solutions can in some cases outperform state-of-the-art computational methods. However, very little is known about how collaborative gameplay produces these results and whether Foldit player strategies can be formalized and structured so that they can be used by computers. To determine whether high performing player strategies could be collectively codified, we augmented the Foldit gameplay mechanics with tools for players to encode their folding strategies as “recipes” and to share their recipes with other players, who are able to further modify and redistribute them. Here we describe the rapid social evolution of player-developed folding algorithms that took place in the year following the introduction of these tools. Players developed over 5,400 different recipes, both by creating new algorithms and by modifying and recombining successful recipes developed by other players. The most successful recipes rapidly spread through the Foldit player population, and two of the recipes became particularly dominant. Examination of the algorithms encoded in these two recipes revealed a striking similarity to an unpublished algorithm developed by scientists over the same period. Benchmark calculations show that the new algorithm independently discovered by scientists and by Foldit players outperforms previously published methods. Thus, online scientific game frameworks have the potential not only to solve hard scientific problems, but also to discover and formalize effective new strategies and algorithms.
- Published
- 2011
13. Structure‐guided forcefield optimization
- Author
-
David Baker, Yifan Song, Michael D. Tyka, James Thompson, and Andrew Leaver-Fay
- Subjects
forcefield optimization ,Models, Molecular ,Quantitative Biology::Biomolecules ,Hydrogen bond ,Chemistry ,Structure (category theory) ,Double counting (proof technique) ,Proteins ,Torsion (mechanics) ,Hydrogen Bonding ,Biochemistry ,Quantum chemistry ,Protein Structure, Secondary ,hydrogen bond potential ,Distribution function ,Structural Biology ,Computational chemistry ,Thermodynamics ,Statistical physics ,Total energy ,Databases, Protein ,rotamer library ,Molecular Biology ,Research Articles - Abstract
Accurate modeling of biomolecular systems requires accurate forcefields. Widely used molecular mechanics (MM) forcefields obtain parameters from experimental data and quantum chemistry calculations on small molecules but do not have a clear way to take advantage of the information in high-resolution macromolecular structures. In contrast, knowledge-based methods largely ignore the physical chemistry of interatomic interactions, and instead derive parameters almost exclusively from macromolecular structures. This can involve considerable double counting of the same physical interactions. Here, we describe a method for forcefield improvement that combines the strengths of the two approaches. We use this method to improve the Rosetta all-atom forcefield, in which the total energy is expressed as the sum of terms representing different physical interactions as in MM forcefields and the parameters are tuned to reproduce the properties of macromolecular structures. To resolve inaccuracies resulting from possible double counting of interactions, we compare distribution functions from low-energy modeled structures to those from crystal structures. The structural and physical bases of the deviations between the modeled and reference structures are identified and used to guide forcefield improvements. We describe improvements resolving double counting between backbone hydrogen bond interactions and Lennard-Jones interactions in helices; between sidechain-backbone hydrogen bonds and the backbone torsion potential; and between the sidechain torsion potential and Lennard-Jones interactions. Discrepancies between computed and observed distributions are also used to guide the incorporation of an explicit Cα-hydrogen bond in β sheets. The method can be used generally to integrate different sources of information for forcefield improvement.
- Published
- 2011
14. Alternate States of Proteins Revealed by Detailed Energy Landscape Mapping
- Author
-
Ingemar André, David S. Richardson, Frank DiMaio, David Baker, Michael D. Tyka, Jane S. Richardson, Daniel A. Keedy, and Yifan Song
- Subjects
chemistry.chemical_classification ,Protein Conformation ,Chemistry ,Globular protein ,Protein domain ,Protein Data Bank (RCSB PDB) ,Proteins ,Energy landscape ,Hydrogen Bonding ,Context (language use) ,Crystal structure ,Crystallography, X-Ray ,Article ,Crystallography ,Protein structure ,Structural Biology ,Native state ,Thermodynamics ,Computer Simulation ,Crystallization ,Nuclear Magnetic Resonance, Biomolecular ,Molecular Biology - Abstract
What conformations do protein molecules populate in solution? Crystallography provides a high-resolution description of protein structure in the crystal environment, while NMR describes structure in solution but using less data. NMR structures display more variability, but is this because crystal contacts are absent or because of fewer data constraints? Here we report unexpected insight into this issue obtained through analysis of de tailed protein energy landscapes generated by large-scale, native-enhanced sampling of conformational space with Rosetta@home for 111 protein domains. In the absence of tightly associating binding partners or ligands, the lowest-energy Rosetta models were nearly all
- Published
- 2011
15. Prediction of structures of zinc-binding proteins through explicit modeling of metal coordination geometry
- Author
-
Oliver F. Lange, Michael D. Tyka, Chu Wang, Robert B. Vernon, and David Baker
- Subjects
Chemistry ,chemistry.chemical_element ,Zinc ,Protein structure prediction ,Biochemistry ,Crystallography ,Protein structure ,Protein methods ,Native state ,Protein folding ,Loop modeling ,Biological system ,Molecular Biology ,Coordination geometry - Abstract
Metal ions play an essential role in stabilizing protein structures and contributing to protein function. Ions such as zinc have well-defined coordination geometries, but it has not been easy to take advantage of this knowledge in protein structure prediction efforts. Here, we present a computational method to predict structures of zinc-binding proteins given knowledge of the positions of zinc-coordinating residues in the amino acid sequence. The method takes advantage of the “atom-tree” representation of molecular systems and modular architecture of the Rosetta3 software suite to incorporate explicit metal ion coordination geometry into previously developed de novo prediction and loop modeling protocols. Zinc cofactors are tethered to their interacting residues based on coordination geometries observed in natural zinc-binding proteins. The incorporation of explicit zinc atoms and their coordination geometry in both de novo structure prediction and loop modeling significantly improves sampling near the native conformation. The method can be readily extended to predict protein structures bound to other metal and/or small chemical cofactors with well-defined coordination or ligation geometry.
- Published
- 2010
16. Improving physical realism, stereochemistry, and side-chain accuracy in homology modeling: Four approaches that performed well in CASP8
- Author
-
Michael D. Tyka, Srivatsan Raman, David Baker, Jooyoung Lee, Keehyoung Joo, Kevin Karplus, James Thompson, Jinwoo Lee, and Elmar Krieger
- Subjects
Quantitative Biology::Biomolecules ,Stereochemistry ,business.industry ,Computer science ,MODELLER ,Biochemistry ,Force field (chemistry) ,Bond length ,Molecular dynamics ,Template ,Software ,Protein structure ,Structural Biology ,Homology modeling ,business ,Molecular Biology - Abstract
A correct alignment is an essential requirement in homology modeling. Yet in order to bridge the structural gap between template and target, which may not only involve loop rearrangements, but also shifts of secondary structure elements and repacking of core residues, high-resolution refinement methods with full atomic details are needed. Here, we describe four approaches that address this "last mile of the protein folding problem" and have performed well during CASP8, yielding physically realistic models: YASARA, which runs molecular dynamics simulations of models in explicit solvent, using a new partly knowledge-based all atom force field derived from Amber, whose parameters have been optimized to minimize the damage done to protein crystal structures. The LEE-SERVER, which makes extensive use of conformational space annealing to create alignments, to help Modeller build physically realistic models while satisfying input restraints from templates and CHARMM stereochemistry, and to remodel the side-chains. ROSETTA, whose high resolution refinement protocol combines a physically realistic all atom force field with Monte Carlo minimization to allow the large conformational space to be sampled quickly. And finally UNDERTAKER, which creates a pool of candidate models from various templates and then optimizes them with an adaptive genetic algorithm, using a primarily empirical cost function that does not include bond angle, bond length, or other physics-like terms.
- Published
- 2009
17. AbDesign: An algorithm for combinatorial backbone design guided by natural conformations and sequences
- Author
-
Gideon D, Lapidoth, Dror, Baran, Gabriele M, Pszolla, Christoffer, Norn, Assaf, Alon, Michael D, Tyka, and Sarel J, Fleishman
- Subjects
Fuzzy Logic ,Protein Conformation ,Sequence Analysis, Protein ,Molecular Sequence Data ,Computational Biology ,Humans ,Amino Acid Sequence ,Protein Engineering ,Complementarity Determining Regions ,Algorithms ,Article - Abstract
Computational design of protein function has made substantial progress, generating new enzymes, binders, inhibitors, and nanomaterials not previously seen in nature. However, the ability to design new protein backbones for function--essential to exert control over all polypeptide degrees of freedom--remains a critical challenge. Most previous attempts to design new backbones computed the mainchain from scratch. Here, instead, we describe a combinatorial backbone and sequence optimization algorithm called AbDesign, which leverages the large number of sequences and experimentally determined molecular structures of antibodies to construct new antibody models, dock them against target surfaces and optimize their sequence and backbone conformation for high stability and binding affinity. We used the algorithm to produce antibody designs that target the same molecular surfaces as nine natural, high-affinity antibodies; in five cases interface sequence identity is above 30%, and in four of those the backbone conformation at the core of the antibody binding surface is within 1 Å root-mean square deviation from the natural antibodies. Designs recapitulate polar interaction networks observed in natural complexes, and amino acid sidechain rigidity at the designed binding surface, which is likely important for affinity and specificity, is high compared to previous design studies. In designed anti-lysozyme antibodies, complementarity-determining regions (CDRs) at the periphery of the interface, such as L1 and H2, show greater backbone conformation diversity than the CDRs at the core of the interface, and increase the binding surface area compared to the natural antibody, potentially enhancing affinity and specificity.
- Published
- 2014
18. Simulating context-driven activity cascades in online social networks on the google exacycle platform
- Author
-
Miao Sui, Arun V. Sathanur, Nicole A. Deflaux, Michael D. Tyka, and Vikram Jandhyala
- Subjects
Computer science ,Human–computer interaction ,business.industry ,Context (language use) ,Artificial intelligence ,Machine learning ,computer.software_genre ,business ,computer - Published
- 2014
19. Relaxation of backbone bond geometry improves protein energy landscape modeling
- Author
-
Patrick, Conway, Michael D, Tyka, Frank, DiMaio, David E, Konerding, and David, Baker
- Subjects
Models, Molecular ,Quantitative Biology::Biomolecules ,Protein Folding ,Protein Conformation ,Proteins ,Thermodynamics ,Articles ,Crystallography, X-Ray ,Algorithms ,Protein Structure, Tertiary - Abstract
A key issue in macromolecular structure modeling is the granularity of the molecular representation. A fine-grained representation can approximate the actual structure more accurately, but may require many more degrees of freedom than a coarse-grained representation and hence make conformational search more challenging. We investigate this tradeoff between the accuracy and the size of protein conformational search space for two frequently used representations: one with fixed bond angles and lengths and one that has full flexibility. We performed large-scale explorations of the energy landscapes of 82 protein domains under each model, and find that the introduction of bond angle flexibility significantly increases the average energy gap between native and non-native structures. We also find that incorporating bonded geometry flexibility improves low resolution X-ray crystallographic refinement. These results suggest that backbone bond angle relaxation makes an important contribution to native structure energetics, that current energy functions are sufficiently accurate to capture the energetic gain associated with subtle deformations from chain ideality, and more speculatively, that backbone geometry distortions occur late in protein folding to optimize packing in the native state.
- Published
- 2013
20. Scientific Benchmarks for Guiding Macromolecular Energy Function Improvement
- Author
-
Jeffrey J. Gray, Sergey Lyskov, Jane S. Richardson, James J. Havranek, Ian W. Davis, David Baker, Michael D. Tyka, Roland A. Pache, Yifan Song, Tanja Kortemme, Brian Kuhlman, James Thompson, Jack Snoeyink, Elizabeth H. Kellogg, Ron Jacak, Matthew J. O’Meara, and Andrew Leaver-Fay
- Subjects
Biochemistry & Molecular Biology ,business.industry ,Estimation theory ,Computer science ,Macromolecular Substances ,Protein Conformation ,Bicubic spline ,Function (mathematics) ,Bioinformatics ,Article ,Range (mathematics) ,Software ,Modeling and design ,Biochemistry and Cell Biology ,business ,Algorithm ,Energy (signal processing) ,Algorithms ,Interpolation - Abstract
Accurate energy functions are critical to macromolecular modeling and design. We describe new tools for identifying inaccuracies in energy functions and guiding their improvement, and illustrate the application of these tools to the improvement of the Rosetta energy function. The feature analysis tool identifies discrepancies between structures deposited in the PDB and low-energy structures generated by Rosetta; these likely arise from inaccuracies in the energy function. The optE tool optimizes the weights on the different components of the energy function by maximizing the recapitulation of a wide range of experimental observations. We use the tools to examine three proposed modifications to the Rosetta energy function: improving the unfolded state energy model (reference energies), using bicubic spline interpolation to generate knowledge-based torisonal potentials, and incorporating the recently developed Dunbrack 2010 rotamer library (Shapovalov & Dunbrack, 2011). © 2013 Elsevier Inc.
- Published
- 2013
21. Modeling disordered regions in proteins using Rosetta
- Author
-
Kristina Krassovsky, Yan Han, Michael D. Tyka, David Baker, William Sheffler, and Ray Yu-Ruei Wang
- Subjects
Models, Molecular ,Protein Folding ,Protein Structure ,Protein Conformation ,Molecular Sequence Data ,Configuration entropy ,Biophysics ,lcsh:Medicine ,010402 general chemistry ,Bioinformatics ,Biophysics Simulations ,01 natural sciences ,03 medical and health sciences ,Protein structure ,Macromolecular Structure Analysis ,Native state ,Humans ,Amino Acid Sequence ,Statistical physics ,lcsh:Science ,Biology ,030304 developmental biology ,Physics ,0303 health sciences ,Quantitative Biology::Biomolecules ,Multidisciplinary ,Mathematical model ,Chemical shift ,lcsh:R ,Computational Biology ,Proteins ,Protein structure prediction ,Transition state ,0104 chemical sciences ,Protein folding ,lcsh:Q ,Software ,Research Article - Abstract
Protein structure prediction methods such as Rosetta search for the lowest energy conformation of the polypeptide chain. However, the experimentally observed native state is at a minimum of the free energy, rather than the energy. The neglect of the missing configurational entropy contribution to the free energy can be partially justified by the assumption that the entropies of alternative folded states, while very much less than unfolded states, are not too different from one another, and hence can be to a first approximation neglected when searching for the lowest free energy state. The shortcomings of current structure prediction methods may be due in part to the breakdown of this assumption. Particularly problematic are proteins with significant disordered regions which do not populate single low energy conformations even in the native state. We describe two approaches within the Rosetta structure modeling methodology for treating such regions. The first does not require advance knowledge of the regions likely to be disordered; instead these are identified by minimizing a simple free energy function used previously to model protein folding landscapes and transition states. In this model, residues can be either completely ordered or completely disordered; they are considered disordered if the gain in entropy outweighs the loss of favorable energetic interactions with the rest of the protein chain. The second approach requires identification in advance of the disordered regions either from sequence alone using for example the DISOPRED server or from experimental data such as NMR chemical shifts. During Rosetta structure prediction calculations the disordered regions make only unfavorable repulsive contributions to the total energy. We find that the second approach has greater practical utility and illustrate this with examples from de novo structure prediction, NMR structure calculation, and comparative modeling.
- Published
- 2011
22. Rosetta3
- Author
-
Sergey Lyskov, Zoran Popović, Monica Berrondo, Florian Richter, Jens Meiler, Stuart Mentzer, Steven M. Lewis, David Baker, Brian Kuhlman, Jacob E. Corn, William Sheffler, Adrien Treuille, Philip Bradley, John Karanicolas, Sarel J. Fleishman, David E. Kim, Rhiju Das, Jeffrey J. Gray, Seth Cooper, Daniel J. Mandell, Ian W. Davis, Yih-En Andrew Ban, Michael D. Tyka, Oliver F. Lange, P. Douglas Renfrew, James Thompson, Ron Jacak, James J. Havranek, Kristian W. Kaufman, Andrew Leaver-Fay, Tanja Kortemme, and Colin A. Smith
- Subjects
Rapid prototyping ,Object-oriented programming ,Software suite ,Source code ,Source lines of code ,Computer science ,business.industry ,media_common.quotation_subject ,Usability ,Software ,Architecture ,business ,Software engineering ,media_common - Abstract
We have recently completed a full re-architecturing of the ROSETTA molecular modeling program, generalizing and expanding its existing functionality. The new architecture enables the rapid prototyping of novel protocols by providing easy-to-use interfaces to powerful tools for molecular modeling. The source code of this rearchitecturing has been released as ROSETTA3 and is freely available for academic use. At the time of its release, it contained 470,000 lines of code. Counting currently unpublished protocols at the time of this writing, the source includes 1,285,000 lines. Its rapid growth is a testament to its ease of use. This chapter describes the requirements for our new architecture, justifies the design decisions, sketches out central classes, and highlights a few of the common tasks that the new software can perform.
- Published
- 2011
23. NMR structure determination for larger proteins using backbone-only data
- Author
-
Michael A. Kennedy, Oliver F. Lange, Gaohua Liu, Theresa Ramelot, David Baker, James M. Aramini, Gaetano T. Montelione, Michael D. Tyka, Paolo Rossi, Srivatsan Raman, Xu Wang, Alexander Eletsky, Thomas Szyperski, and James H. Prestegard
- Subjects
Models, Molecular ,Quantitative Biology::Biomolecules ,Protein Folding ,Multidisciplinary ,Chemistry ,Protein Conformation ,Chemical shift ,Structure (category theory) ,Resonance ,Proteins ,Article ,Folding (chemistry) ,Crystallography ,Dipole ,Protein structure ,Side chain ,Thermodynamics ,Protein folding ,Computer Simulation ,Monte Carlo Method ,Nuclear Magnetic Resonance, Biomolecular ,Software - Abstract
Examining the Backbone Determination of tertiary protein structures by nuclear magnetic resonance (NMR) currently relies heavily on side-chain NMR data. The assignment of side-chain atoms is challenging. In addition, proteins larger than 15 kilodaltons (kD) must be deuterated to improve resolution and this eliminates the possibility of measuring long-range interproton distance constraints. Now Raman et al. (p. 1014 , published online 4 February) use backbone-only NMR data—chemical shifts, residual dipolar coupling, and backbone amide proton distances—available from highly deuterated proteins to guide conformational searching in the Rosetta structure prediction protocol. Using this new protocol, they were able to generate accurate structures for proteins of up to 25 kD.
- Published
- 2010
24. Structure prediction for CASP8 with all-atom refinement using Rosetta
- Author
-
Bong Hyun Kim, David Baker, Nick V. Grishin, Elizabeth H. Kellogg, William Sheffler, Srivatsan Raman, Frank DiMaio, James Thompson, Robert B. Vernon, Lisa N. Kinch, Ruslan I. Sadreyev, Rhiju Das, Jimin Pei, David E. Kim, Oliver F. Lange, and Michael D. Tyka
- Subjects
Models, Molecular ,Protein Folding ,Computer science ,Protein Conformation ,Biochemistry ,Article ,Software ,Structural Biology ,Sequence Analysis, Protein ,Homology modeling ,Molecular Biology ,Structure (mathematical logic) ,business.industry ,Sampling (statistics) ,Computational Biology ,Proteins ,computer.file_format ,Protein structure prediction ,Protein Data Bank ,Data science ,Range (mathematics) ,Template ,business ,computer ,Algorithm ,Sequence Alignment - Abstract
We describe predictions made using the Rosetta structure prediction methodology for the Eighth Critical Assessment of Techniques for Protein Structure Prediction. Aggressive sampling and all-atom refinement were carried out for nearly all targets. A combination of alignment methodologies was used to generate starting models from a range of templates, and the models were then subjected to Rosetta all atom refinement. For the 64 domains with readily identified templates, the best submitted model was better than the best alignment to the best template in the Protein Data Bank for 24 cases, and improved over the best starting model for 43 cases. For 13 targets where only very distant sequence relationships to proteins of known structure were detected, models were generated using the Rosetta de novo structure prediction methodology followed by all-atom refinement; in several cases the submitted models were better than those based on the available templates. Of the 12 refinement challenges, the best submitted model improved on the starting model in seven cases. These improvements over the starting template-based models and refinement tests demonstrate the power of Rosetta structure refinement in improving model accuracy.
- Published
- 2009
25. Refinement of Protein Structures into Low-Resolution Density Maps using Rosetta
- Author
-
David Baker, Matthew L. Baker, Frank DiMaio, Wah Chiu, and Michael D. Tyka
- Subjects
Chemistry ,Cryo-electron microscopy ,Low resolution ,Resolution (electron density) ,Cryoelectron Microscopy ,Proteins ,Measure (mathematics) ,Article ,Crystallography ,Test case ,Protein structure ,Structural Biology ,Protein model ,Range (statistics) ,Image Processing, Computer-Assisted ,Molecular Biology ,Algorithm - Abstract
We describe a method based on Rosetta structure refinement for generating high-resolution, all-atom protein models from electron cryomicroscopy density maps. A local measure of the fit of a model to the density is used to directly guide structure refinement and to identify regions incompatible with the density that are then targeted for extensive rebuilding. Over a range of test cases using both simulated and experimentally generated data, the method consistently increases the accuracy of starting models generated either by comparative modeling or by hand-tracing the density. The method can achieve near-atomic resolution starting from density maps at 4-6 A resolution.
- Published
- 2009
26. Structure prediction for CASP7 targets using extensive all-atom refinement with Rosetta@home
- Author
-
Chu Wang, David Baker, Sagar D. Khare, Philip Bradley, Rhiju Das, William Sheffler, Ingemar André, Lars Malmström, Dylan Chivian, Robert B. Vernon, David E. Kim, Divya Bhat, James Thompson, Andrew M. Wollacott, Michael D. Tyka, Srivatsan Raman, and Bin Qian
- Subjects
Models, Molecular ,business.industry ,Computer science ,Protein Conformation ,Sampling (statistics) ,Computational Biology ,Proteins ,Function (mathematics) ,Protein structure prediction ,computer.software_genre ,Biochemistry ,Software ,Template ,Structural Biology ,Iterative refinement ,Thermodynamics ,Data mining ,business ,CASP ,Molecular Biology ,computer ,Energy (signal processing) ,Algorithms - Abstract
We describe predictions made using the Rosetta structure prediction methodology for both template-based modeling and free modeling categories in the Seventh Critical Assessment of Techniques for Protein Structure Prediction. For the first time, aggressive sampling and all-atom refinement could be carried out for the majority of targets, an advance enabled by the Rosetta@home distributed computing network. Template-based modeling predictions using an iterative refinement algorithm improved over the best existing templates for the majority of proteins with less than 200 residues. Free modeling methods gave near-atomic accuracy predictions for several targets under 100 residues from all secondary structure classes. These results indicate that refinement with an all-atom energy function, although computationally expensive, is a powerful method for obtaining accurate structure predictions.
- Published
- 2007
27. Absolute free-energy calculations of liquids using a harmonic reference state
- Author
-
Michael D. Tyka, Richard B. Sessions, and Anthony R. Clarke
- Subjects
Annihilation ,Chemistry ,Solvation ,Thermodynamic integration ,Water ,Harmonic (mathematics) ,Surfaces, Coatings and Films ,Normal mode ,Position (vector) ,Materials Chemistry ,Solvents ,Molecule ,Quantum Theory ,Thermodynamics ,Computer Simulation ,Gases ,Physical and Theoretical Chemistry ,Atomic physics ,Argon ,Energy (signal processing) ,Algorithms - Abstract
Absolute free-energy methods provide a potential solution to the overlap problem in free-energy calculations. In this paper, we report an extension of the previously published confinement method (J. Phys. Chem. B 2006, 110, 17212-20) to fluid simulations. Absolute free energies of liquid argon and liquid water are obtained accurately and compared with results from thermodynamic integration. The method works by transforming the liquid state into a harmonic, solid reference state. This is achieved using a special restraint potential that allows molecules to change their restraint position during the simulation, which circumvents the need for the molecules to sample the full extent of their translational freedom. The absolute free energy of the completely restrained reference state is obtained from a normal mode calculation. Because of the generic reference state used, the method is applicable to nonhomogeneous, diffusive systems and could provide an alternative method in situations in which solute annihilation fails due to the size of the solute. Potential applications include calculation of solvation energies of large molecules and free energies of peptide conformational changes in explicit solvent.
- Published
- 2007
28. An Efficient, Path-Independent Method for Free-Energy Calculations.
- Author
-
Michael D. Tyka, Anthony R. Clarke, and Richard B. Sessions
- Subjects
- *
GIBBS' free energy , *ENTROPY , *SURFACE energy , *THERMODYNAMICS - Abstract
Classical free-energy methods depend on the definition of physical or nonphysical integration paths to calculate free-energy differences between states. This procedure can be problematic and computationally expensive when the states of interest do not overlap and are far apart in phase space. Here we introduce a novel method to calculate free-energy differences that is path-independent by transforming each end state into a reference state in which the vibrational entropy is the sole component of the total entropy, thus allowing direct computation of the relative free energy. We apply the method to calculate side-chain entropies of a -hairpin-forming peptide in a variety of backbone conformations, demonstrating its importance in determining structural propensities. We find that low-free-energy conformations achieve their stability through optimal trade off between enthalpic gains due to favorable interatomic interactions and entropic losses incurred by the same. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.