Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Daniel A. Keedy is active.

Publication


Featured researches published by Daniel A. Keedy.


Acta Crystallographica Section D-biological Crystallography | 2010

MolProbity: all-atom structure validation for macromolecular crystallography

Vincent B. Chen; W. Bryan Arendall; Jeffrey J. Headd; Daniel A. Keedy; Robert M. Immormino; Gary J. Kapral; Laura Weston Murray; Jane S. Richardson; David C. Richardson

MolProbity structure validation will diagnose most local errors in macromolecular crystal structures and help to guide their correction.


Journal of Molecular Biology | 2011

Alternate States of Proteins Revealed by Detailed Energy Landscape Mapping

Michael D. Tyka; Daniel A. Keedy; Ingemar André; Frank DiMaio; Yifan Song; David C. Richardson; Jane S. Richardson; David Baker

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 detailed 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 <2.5xa0Å C(α)RMSD from the experimental structure; this result demonstrates that structure prediction accuracy for globular proteins is limited mainly by the ability to sample close to the native structure. While the lowest-energy models are similar to deposited structures, they are not identical; the largest deviations are most often in regions involved in ligand, quaternary, or crystal contacts. For ligand binding proteins, the low energy models may resemble the apo structures, and for oligomeric proteins, the monomeric assembly intermediates. The deviations between the low energy models and crystal structures largely disappear when landscapes are computed in the context of the crystal lattice or multimer. The computed low-energy ensembles, with tight crystal-structure-like packing in the core, but more NMR-structure-like variability in loops, may in some cases resemble the native state ensembles of proteins better than individual crystal or NMR structures, and can suggest experimentally testable hypotheses relating alternative states and structural heterogeneity to function.


Methods in Enzymology | 2013

osprey: Protein Design with Ensembles, Flexibility, and Provable Algorithms

Pablo Gainza; Kyle E. Roberts; Ivelin S. Georgiev; Ryan H. Lilien; Daniel A. Keedy; Cheng-Yu Chen; Faisal Reza; Amy C. Anderson; David C. Richardson; Jane S. Richardson; Bruce Randall Donald

UNLABELLEDnWe have developed a suite of protein redesign algorithms that improves realistic in silico modeling of proteins. These algorithms are based on three characteristics that make them unique: (1) improved flexibility of the protein backbone, protein side-chains, and ligand to accurately capture the conformational changes that are induced by mutations to the protein sequence; (2) modeling of proteins and ligands as ensembles of low-energy structures to better approximate binding affinity; and (3) a globally optimal protein design search, guaranteeing that the computational predictions are optimal with respect to the input model. Here, we illustrate the importance of these three characteristics. We then describe OSPREY, a protein redesign suite that implements our protein design algorithms. OSPREY has been used prospectively, with experimental validation, in several biomedically relevant settings. We show in detail how OSPREY has been used to predict resistance mutations and explain why improved flexibility, ensembles, and provability are essential for this application.nnnAVAILABILITYnOSPREY is free and open source under a Lesser GPL license. The latest version is OSPREY 2.0. The program, user manual, and source code are available at www.cs.duke.edu/donaldlab/[email protected].


intelligent systems in molecular biology | 2008

Algorithm for backrub motions in protein design

Ivelin S. Georgiev; Daniel A. Keedy; Jane S. Richardson; David C. Richardson; Bruce Randall Donald

Motivation: The Backrub is a small but kinematically efficient side-chain-coupled local backbone motion frequently observed in atomic-resolution crystal structures of proteins. A backrub shifts the Cα–Cβ orientation of a given side-chain by rigid-body dipeptide rotation plus smaller individual rotations of the two peptides, with virtually no change in the rest of the protein. Backrubs can therefore provide a biophysically realistic model of local backbone flexibility for structure-based protein design. Previously, however, backrub motions were applied via manual interactive model-building, so their incorporation into a protein design algorithm (a simultaneous search over mutation and backbone/side-chain conformation space) was infeasible. Results: We present a combinatorial search algorithm for protein design that incorporates an automated procedure for local backbone flexibility via backrub motions. We further derive a dead-end elimination (DEE)-based criterion for pruning candidate rotamers that, in contrast to previous DEE algorithms, is provably accurate with backrub motions. Our backrub-based algorithm successfully predicts alternate side-chain conformations from ≤0.9 Å resolution structures, confirming the suitability of the automated backrub procedure. Finally, the application of our algorithm to redesign two different proteins is shown to identify a large number of lower-energy conformations and mutation sequences that would have been ignored by a rigid-backbone model. Availability: Contact authors for source code. Contact: [email protected]


Proteins | 2009

The other 90% of the protein: Assessment beyond the Cαs for CASP8 template-based and high-accuracy models†‡

Daniel A. Keedy; Christopher J. Williams; Jeffrey J. Headd; W. Bryan Arendall; Vincent B. Chen; Gary J. Kapral; Robert A. Gillespie; Jeremy N. Block; Adam Zemla; David C. Richardson; Jane S. Richardson

For template‐based modeling in the CASP8 Critical Assessment of Techniques for Protein Structure Prediction, this work develops and applies six new full‐model metrics. They are designed to complement and add value to the traditional template‐based assessment by the global distance test (GDT) and related scores (based on multiple superpositions of Cα atoms between target structure and predictions labeled “Model 1”). The new metrics evaluate each predictor group on each target, using all atoms of their best model with above‐average GDT. Two metrics evaluate how “protein‐like” the predicted model is: the MolProbity score used for validating experimental structures, and a mainchain reality score using all‐atom steric clashes, bond length and angle outliers, and backbone dihedrals. Four other new metrics evaluate match of model to target for mainchain and sidechain hydrogen bonds, sidechain end positioning, and sidechain rotamers. Group‐average Z‐score across the six full‐model measures is averaged with group‐average GDT Z‐score to produce the overall ranking for full‐model, high‐accuracy performance. Separate assessments are reported for specific aspects of predictor‐group performance, such as robustness of approximately correct template or fold identification, and self‐scoring ability at identifying the best of their models. Fold identification is distinct from but correlated with group‐average GDT Z‐score if target difficulty is taken into account, whereas self‐scoring is done best by servers and is uncorrelated with GDT performance. Outstanding individual models on specific targets are identified and discussed. Predictor groups excelled at different aspects, highlighting the diversity of current methodologies. However, good full‐model scores correlate robustly with high Cα accuracy. Proteins 2009.


Proteins | 2013

Dead-end elimination with perturbations (DEEPer): a provable protein design algorithm with continuous sidechain and backbone flexibility.

Mark A. Hallen; Daniel A. Keedy; Bruce Randall Donald

Computational protein and drug design generally require accurate modeling of protein conformations. This modeling typically starts with an experimentally determined protein structure and considers possible conformational changes due to mutations or new ligands. The DEE/A* algorithm provably finds the global minimum‐energy conformation (GMEC) of a protein assuming that the backbone does not move and the sidechains take on conformations from a set of discrete, experimentally observed conformations called rotamers. DEE/A* can efficiently find the overall GMEC for exponentially many mutant sequences. Previous improvements to DEE/A* include modeling ensembles of sidechain conformations and either continuous sidechain or backbone flexibility. We present a new algorithm, DEEPer (Dead‐End Elimination with Perturbations), that combines these advantages and can also handle much more extensive backbone flexibility and backbone ensembles. DEEPer provably finds the GMEC or, if desired by the user, all conformations and sequences within a specified energy window of the GMEC. It includes the new abilities to handle arbitrarily large backbone perturbations and to generate ensembles of backbone conformations. It also incorporates the shear, an experimentally observed local backbone motion never before used in design. Additionally, we derive a new method to accelerate DEE/A*‐based calculations, indirect pruning, that is particularly useful for DEEPer. In 67 benchmark tests on 64 proteins, DEEPer consistently identified lower‐energy conformations than previous methods did, indicating more accurate modeling. Additional tests demonstrated its ability to incorporate larger, experimentally observed backbone conformational changes and to model realistic conformational ensembles. These capabilities provide significant advantages for modeling protein mutations and protein–ligand interactions. Proteins 2013.


Journal of Structural and Functional Genomics | 2009

Autofix for backward-fit sidechains: using MolProbity and real-space refinement to put misfits in their place

Jeffrey J. Headd; Robert M. Immormino; Daniel A. Keedy; Paul Emsley; David C. Richardson; Jane S. Richardson

Misfit sidechains in protein crystal structures are a stumbling block in using those structures to direct further scientific inference. Problems due to surface disorder and poor electron density are very difficult to address, but a large class of systematic errors are quite common even in well-ordered regions, resulting in sidechains fit backwards into local density in predictable ways. The MolProbity web site is effective at diagnosing such errors, and can perform reliable automated correction of a few special cases such as 180° flips of Asn or Gln sidechain amides, using all-atom contacts and H-bond networks. However, most at-risk residues involve tetrahedral geometry, and their valid correction requires rigorous evaluation of sidechain movement and sometimes backbone shift. The current work extends the benefits of robust automated correction to more sidechain types. The Autofix method identifies candidate systematic, flipped-over errors in Leu, Thr, Val, and Arg using MolProbity quality statistics, proposes a corrected position using real-space refinement with rotamer selection in Coot, and accepts or rejects the correction based on improvement in MolProbity criteria and on χ angle change. Criteria are chosen conservatively, after examining many individual results, to ensure valid correction. To test this method, Autofix was run and analyzed for 945 representative PDB files and on the 50S ribosomal subunit of file 1YHQ. Over 40% of Leu, Val, and Thr outliers and 15% of Arg outliers were successfully corrected, resulting in a total of 3,679 corrected sidechains, or 4 per structure on average. Summary Sentences: A common class of misfit sidechains in protein crystal structures is due to systematic errors that place the sidechain backwards into the local electron density. A fully automated method called “Autofix” identifies such errors for Leu, Val, Thr, and Arg and corrects over one third of them, using MolProbity validation criteria and Coot real-space refinement of rotamers.


Protein Science | 2018

MolProbity: More and better reference data for improved all-atom structure validation

Christopher J. Williams; Jeffrey J. Headd; Nigel W. Moriarty; Michael G. Prisant; Lizbeth L. Videau; Lindsay N. Deis; Vishal Verma; Daniel A. Keedy; Bradley J. Hintze; Vincent B. Chen; Swati Jain; Steven M. Lewis; W. Bryan Arendall; Jack Snoeyink; Paul D. Adams; Simon C. Lovell; Jane S. Richardson; David C. Richardson

This paper describes the current update on macromolecular model validation services that are provided at the MolProbity website, emphasizing changes and additions since the previous review in 2010. There have been many infrastructure improvements, including rewrite of previous Java utilities to now use existing or newly written Python utilities in the open‐source CCTBX portion of the Phenix software system. This improves long‐term maintainability and enhances the thorough integration of MolProbity‐style validation within Phenix. There is now a complete MolProbity mirror site at http://molprobity.manchester.ac.uk. GitHub serves our open‐source code, reference datasets, and the resulting multi‐dimensional distributions that define most validation criteria. Coordinate output after Asn/Gln/His “flip” correction is now more idealized, since the post‐refinement step has apparently often been skipped in the past. Two distinct sets of heavy‐atom‐to‐hydrogen distances and accompanying van der Waals radii have been researched and improved in accuracy, one for the electron‐cloud‐center positions suitable for X‐ray crystallography and one for nuclear positions. New validations include messages at input about problem‐causing format irregularities, updates of Ramachandran and rotamer criteria from the million quality‐filtered residues in a new reference dataset, the CaBLAM Cα‐CO virtual‐angle analysis of backbone and secondary structure for cryoEM or low‐resolution X‐ray, and flagging of the very rare cis‐nonProline and twisted peptides which have recently been greatly overused. Due to wide application of MolProbity validation and corrections by the research community, in Phenix, and at the worldwide Protein Data Bank, newly deposited structures have continued to improve greatly as measured by MolProbitys unique all‐atom clashscore.


PLOS Computational Biology | 2012

The role of local backrub motions in evolved and designed mutations.

Daniel A. Keedy; Ivelin S. Georgiev; Edward Triplett; Bruce Randall Donald; David C. Richardson; Jane S. Richardson

Amino acid substitutions in protein structures often require subtle backbone adjustments that are difficult to model in atomic detail. An improved ability to predict realistic backbone changes in response to engineered mutations would be of great utility for the blossoming field of rational protein design. One model that has recently grown in acceptance is the backrub motion, a low-energy dipeptide rotation with single-peptide counter-rotations, that is coupled to dynamic two-state sidechain rotamer jumps, as evidenced by alternate conformations in very high-resolution crystal structures. It has been speculated that backrubs may facilitate sequence changes equally well as rotamer changes. However, backrub-induced shifts and experimental uncertainty are of similar magnitude for backbone atoms in even high-resolution structures, so comparison of wildtype-vs.-mutant crystal structure pairs is not sufficient to directly link backrubs to mutations. In this study, we use two alternative approaches that bypass this limitation. First, we use a quality-filtered structure database to aggregate many examples for precisely defined motifs with single amino acid differences, and find that the effectively amplified backbone differences closely resemble backrubs. Second, we directly apply a provably-accurate, backrub-enabled protein design algorithm to idealized versions of these motifs, and discover that the lowest-energy computed models match the average-coordinate experimental structures. These results support the hypothesis that backrubs participate in natural protein evolution and validate their continued use for design of synthetic proteins.


Archive | 2013

“THE PLOT” THICKENS: MORE DATA, MORE DIMENSIONS, MORE USES

Jane S. Richardson; Daniel A. Keedy; David C. Richardson

The scientific history of the Ramachandran plot is reviewed, emphasizing relationships to the title theme and to trends in current research. The growth and quality of macromolecular structure data have enabled the understanding of relationships with further variables and the application to an ever-widening set of uses such as prediction, simulation, design, motif identification, and structure validation and improvement. Then a current research example is explored, using a new dataset of 8000 selected protein chains and >1.5 million qualityfiltered residues. The new Ramachandran plots show an unprecedented level of detail, allow the valid addition of more subcategories and more dimensions, and point the way toward the feasibility of an essentially complete and robust treatment of torsional conformation in the near future.

Collaboration


Dive into the Daniel A. Keedy's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Jeffrey J. Headd

Lawrence Berkeley National Laboratory

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Ivelin S. Georgiev

National Institutes of Health

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge