Ryan G. Coleman
University of Pennsylvania
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Ryan G. Coleman.
Journal of Chemical Information and Modeling | 2012
John J. Irwin; Teague Sterling; Michael M. Mysinger; Erin S. Bolstad; Ryan G. Coleman
ZINC is a free public resource for ligand discovery. The database contains over twenty million commercially available molecules in biologically relevant representations that may be downloaded in popular ready-to-dock formats and subsets. The Web site also enables searches by structure, biological activity, physical property, vendor, catalog number, name, and CAS number. Small custom subsets may be created, edited, shared, docked, downloaded, and conveyed to a vendor for purchase. The database is maintained and curated for a high purchasing success rate and is freely available at zinc.docking.org.
Nature Biotechnology | 2007
Alan C. Cheng; Ryan G. Coleman; Kathleen T. Smyth; Qing Cao; Patricia Soulard; Daniel R. Caffrey; Anna C. Salzberg; Enoch S. Huang
Lead generation is a major hurdle in small-molecule drug discovery, with an estimated 60% of projects failing from lack of lead matter or difficulty in optimizing leads for drug-like properties. It would be valuable to identify these less-druggable targets before incurring substantial expenditure and effort. Here we show that a model-based approach using basic biophysical principles yields good prediction of druggability based solely on the crystal structure of the target binding site. We quantitatively estimate the maximal affinity achievable by a drug-like molecule, and we show that these calculated values correlate with drug discovery outcomes. We experimentally test two predictions using high-throughput screening of a diverse compound collection. The collective results highlight the utility of our approach as well as strategies for tackling difficult targets.
Nature Chemical Biology | 2011
Jens Carlsson; Ryan G. Coleman; Vincent Setola; John J. Irwin; Hao Fan; Avner Schlessinger; Andrej Sali; Bryan L. Roth; Brian K. Shoichet
G-Protein coupled receptors (GPCRs) are intensely studied as drug targets and for their role in signaling. With the determination of the first crystal structures, interest in structure-based ligand discovery has increased. Unfortunately, most GPCRs lack experimental structures. The determination of the D3 receptor structure, and a community challenge to predict it, enabled a fully prospective comparison of ligand discovery from a modeled structure versus that of the subsequently released crystal structure. Over 3.3 million molecules were docked against a homology model, and 26 of the highest ranking were tested for binding. Six had affinities from 0.2 to 3.1μM. Subsequently, the crystal structure was released and the docking screen repeated. Of the 25 compounds selected, five had affinities from 0.3 to 3.0μM. One of the novel ligands from the homology model screen was optimized for affinity to 81nM. The feasibility of docking screens against modeled GPCRs more generally is considered.
Nature Chemistry | 2014
Marcus Fischer; Ryan G. Coleman; J.S. Fraser; Brian K. Shoichet
Proteins fluctuate between alternative conformations, which presents a challenge for ligand discovery because such flexibility is difficult to treat computationally owing to problems with conformational sampling and energy weighting. Here, we describe a flexible-docking method that samples and weights protein conformations using experimentally-derived conformations as a guide. The crystallographically refined occupancies of these conformations, which are observable in an apo receptor structure, define energy penalties for docking. In a large prospective library screen, we identified new ligands that target specific receptor conformations of a cavity in Cytochrome c Peroxidase, and we confirm both ligand pose and associated receptor conformation predictions by crystallography. The inclusion of receptor flexibility led to ligands with new chemotypes and physical properties. By exploiting experimental measures of loop and side chain flexibility, this method can be extended to the discovery of new ligands for hundreds of targets in the Protein Data Bank where similar experimental information is available.
Journal of Chemical Information and Modeling | 2010
Ryan G. Coleman; Kim A. Sharp
The shape of the protein surface dictates what interactions are possible with other macromolecules, but defining discrete pockets or possible interaction sites remains difficult. First, there is the problem of defining the extent of the pocket. Second, one has to characterize the shape of each pocket. Third, one needs to make quantitative comparisons between pockets on different proteins. An elegant solution to these problems is to sort all surface and solvent points by travel depth and then collect a hierarchical tree of pockets. The connectivity of the tree is determined via the deepest saddle points between each pair of neighboring pockets. The resulting pocket surfaces tessellate the entire protein surface, producing a complete inventory of pockets. This method of identifying pockets also allows one to easily compute important shape metrics, including the problematic pocket volume, surface area, and mouth size. Pockets are also annotated with their lining residue lists and polarity and with other residue-based properties. Using this tree and the various shape metrics pockets can be merged, grouped, or filtered for further analysis. Since this method includes the entire surface, it guarantees that any pocket of interest will be found among the output pockets, unlike all previous methods of pocket identification. The resulting hierarchy of pockets is easy to visualize and aids users in higher level analysis. Comparison of pockets is done by using the shape metrics, avoiding the complex shape alignment problem. Example applications show that the method facilitates pocket comparison along mutational or time-dependent series. Pockets from families of proteins can be examined using multiple pocket tree alignments to see how ligand binding sites or how other pockets have changed with evolution. Our method is called CLIPPERS for complete liberal inventory of protein pockets elucidating and reporting on shape.
PLOS ONE | 2013
Ryan G. Coleman; Michael Carchia; Teague Sterling; John J. Irwin; Brian K. Shoichet
Molecular docking remains an important tool for structure-based screening to find new ligands and chemical probes. As docking ambitions grow to include new scoring function terms, and to address ever more targets, the reliability and extendability of the orientation sampling, and the throughput of the method, become pressing. Here we explore sampling techniques that eliminate stochastic behavior in DOCK3.6, allowing us to optimize the method for regularly variable sampling of orientations. This also enabled a focused effort to optimize the code for efficiency, with a three-fold increase in the speed of the program. This, in turn, facilitated extensive testing of the method on the 102 targets, 22,805 ligands and 1,411,214 decoys of the Directory of Useful Decoys - Enhanced (DUD-E) benchmarking set, at multiple levels of sampling. Encouragingly, we observe that as sampling increases from 50 to 500 to 2000 to 5000 to 20000 molecular orientations in the binding site (and so from about 1×1010 to 4×1010 to 1×1011 to 2×1011 to 5×1011 mean atoms scored per target, since multiple conformations are sampled per orientation), the enrichment of ligands over decoys monotonically increases for most DUD-E targets. Meanwhile, including internal electrostatics in the evaluation ligand conformational energies, and restricting aromatic hydroxyls to low energy rotamers, further improved enrichment values. Several of the strategies used here to improve the efficiency of the code are broadly applicable in the field.
Biophysical Journal | 2009
Ryan G. Coleman; Kim A. Sharp
We describe a new algorithm, CHUNNEL, to automatically find, characterize, and display tunnels or pores in proteins. The correctness and accuracy of the algorithm is verified on a constructed set of proteins and used to analyze large sets of real proteins. The verification set contains proteins with artificially created pores of known path and width profile. The previous benchmark algorithm, HOLE, is compared with the new algorithm. Results show that the major advantage of the new algorithm is that it can successfully find and characterize tunnels with no a priori guidance or clues about the location of the tunnel mouth, and it will successfully find multiple tunnels if present. CHUNNEL can also be used in conjunction with HOLE, with the former used toprime HOLE and the latter to track and characterize the pores. Analysis was conducted on families of membrane protein structures culled from the Protein Data Bank as well as on a set of transmembrane proteins with predicted membrane-aqueous phase interfaces, yielding the first completely automated examination of tunnels through membrane proteins, including tunnels that exit in the membrane bilayer.
Proteins | 2005
Ryan G. Coleman; Michael A. Burr; Diane L. Souvaine; Alan C. Cheng
A natural way to measure protein surface curvature is to generate the least squares fitted (LSF) sphere to a surface patch and use the radius as the curvature measure. While the concept is simple, the sphere‐fitting problem is not trivial and known means of protein surface curvature measurement use alternative schemes that are arguably less straightforward to interpret. We have developed an approach to solve the LSF sphere problem by turning the sphere‐fitting problem into a solvable plane‐fitting problem using a transformation known as geometric inversion. The approach works on any arbitrary surface patch, and returns a radius of curvature that has direct physical interpretation. Additionally, it is flexible in its ability to find the curvature of an arbitrary surface patch, and the “resolution” can be adjusted to highlight atomic features or larger features such as peptide binding sites. We include examples of applying the method to visualization of peptide recognition pockets and protein conformational change, as well as a comparison with a commonly used solid‐angle curvature method showing that the LSF method produces more pronounced curvature results. Proteins 2005.
Journal of Computer-aided Molecular Design | 2014
Ryan G. Coleman; Teague Sterling; Dahlia R. Weiss
The SAMPL4 challenges were used to test current automated methods for solvation energy, virtual screening, pose and affinity prediction of the molecular docking pipeline DOCK 3.7. Additionally, first-order models of binding affinity were proposed as milestones for any method predicting binding affinity. Several important discoveries about the molecular docking software were made during the challenge: (1) Solvation energies of ligands were five-fold worse than any other method used in SAMPL4, including methods that were similarly fast, (2) HIV Integrase is a challenging target, but automated docking on the correct allosteric site performed well in terms of virtual screening and pose prediction (compared to other methods) but affinity prediction, as expected, was very poor, (3) Molecular docking grid sizes can be very important, serious errors were discovered with default settings that have been adjusted for all future work. Overall, lessons from SAMPL4 suggest many changes to molecular docking tools, not just DOCK 3.7, that could improve the state of the art. Future difficulties and projects will be discussed.
Biochemical Pharmacology | 2013
Ryan T. Cameron; Ryan G. Coleman; Jon P. Day; Krishna C. Yalla; Miles D. Houslay; David R. Adams; Brian K. Shoichet; George S. Baillie
Graphical abstract