EDBT 2026 Demo / reviewers in the wild / expert
Michel F. Sanner
dblp:19/3095
· DBLP profile ↗
8ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0001-9342-327XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 5Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1Human-computer interaction and ubiquitous computing · 1Theory of computation · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
3 papers |
Bioinformatics and computational biology · 100% | |
| Theoretical computer science
1 paper |
Computational geometry · 100% |
Topics — the 8 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › molecular informatics › molecular modeling › molecular docking
protein-peptide docking |
0.4 | 1 | 2019 | AutoDock CrankPep: combining folding and docking to predict protein-peptide complexes · Bioinform. 2019 |
Bioinformatics and computational biology
structural bioinformatics |
0.4 | 1 | 2019 | AutoDock CrankPep: combining folding and docking to predict protein-peptide complexes · Bioinform. 2019 |
Bioinformatics and computational biology › gene regulation › binding site prediction
ligand binding site prediction |
0.2 | 1 | 2016 | AutoSite: an automated approach for pseudo-ligands prediction - from ligand-binding sites identification to predicting key ligand atoms · Bioinform. 2016 |
Bioinformatics and computational biology › structural bioinformatics
protein-ligand binding |
0.2 | 1 | 2016 | AutoSite: an automated approach for pseudo-ligands prediction - from ligand-binding sites identification to predicting key ligand atoms · Bioinform. 2016 |
Bioinformatics and computational biology › protein structure prediction
protein folding |
0.1 | 1 | 2019 | AutoDock CrankPep: combining folding and docking to predict protein-peptide complexes · Bioinform. 2019 |
Bioinformatics and computational biology › drug discovery
drug design |
0.1 | 1 | 2016 | AutoSite: an automated approach for pseudo-ligands prediction - from ligand-binding sites identification to predicting key ligand atoms · Bioinform. 2016 |
Bioinformatics and computational biology
molecular flexibility |
0.1 | 1 | 2006 | Hierarchical and multi-resolution representation of protein flexibility · Bioinform. 2006 |
Computational geometry
geometric modeling and processing |
0.0 | 1 | 1995 | Fast and Robust Computation of Molecular Surfaces · SCG 1995 |
Methods — techniques the papers use, named apart from their topics
molecular docking · 0.4conformational search · 0.4feature point extraction · 0.2clustering · 0.2hierarchical data structure · 0.1global search · 0.1geometric computation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | AutoDock CrankPep: combining folding and docking to predict protein-peptide complexesabstractMOTIVATION: Protein-peptide interactions mediate a wide variety of cellular and biological functions. Methods for predicting these interactions have garnered a lot of interest over the past few years, as witnessed by the rapidly growing number of peptide-based therapeutic molecules currently in clinical trials. The size and flexibility of peptides has shown to be challenging for existing automated docking software programs. RESULTS: Here we present AutoDock CrankPep or ADCP in short, a novel approach to dock flexible peptides into rigid receptors. ADCP folds a peptide in the potential field created by the protein to predict the protein-peptide complex. We show that it outperforms leading peptide docking methods on two protein-peptide datasets commonly used for benchmarking docking methods: LEADS-PEP and peptiDB, comprised of peptides with up to 15 amino acids in length. Beyond these datasets, ADCP reliably docked a set of protein-peptide complexes containing peptides ranging in lengths from 16 to 20 amino acids. The robust performance of ADCP on these longer peptides enables accurate modeling of peptide-mediated protein-protein interactions and interactions with disordered proteins. AVAILABILITY AND IMPLEMENTATION: ADCP is distributed under the LGPL 2.0 open source license and is available at http://adcp.scripps.edu. The source code is available at https://github.com/ccsb-scripps/ADCP. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Yuqi Zhang 0003, Michel F. Sanner |
Bioinform. | 2 |
| 2016 | AutoSite: an automated approach for pseudo-ligands prediction - from ligand-binding sites identification to predicting key ligand atomsabstractMOTIVATION: The identification of ligand-binding sites from a protein structure facilitates computational drug design and optimization, and protein function assignment. We introduce AutoSite: an efficient software tool for identifying ligand-binding sites and predicting pseudo ligand corresponding to each binding site identified. Binding sites are reported as clusters of 3D points called fills in which every point is labelled as hydrophobic or as hydrogen bond donor or acceptor. From these fills AutoSite derives feature points: a set of putative positions of hydrophobic-, and hydrogen-bond forming ligand atoms. RESULTS: We show that AutoSite identifies ligand-binding sites with higher accuracy than other leading methods, and produces fills that better matches the ligand shape and properties, than the fills obtained with a software program with similar capabilities, AutoLigand In addition, we demonstrate that for the Astex Diverse Set, the feature points identify 79% of hydrophobic ligand atoms, and 81% and 62% of the hydrogen acceptor and donor hydrogen ligand atoms interacting with the receptor, and predict 81.2% of water molecules mediating interactions between ligand and receptor. Finally, we illustrate potential uses of the predicted feature points in the context of lead optimization in drug discovery projects. AVAILABILITY AND IMPLEMENTATION: http://adfr.scripps.edu/AutoDockFR/autosite.html CONTACT: [email protected] information: Supplementary data are available at Bioinformatics online. Pradeep Anand Ravindranath, Michel F. Sanner |
Bioinform. | 2 |
| 2015 | AutoDockFR: Advances in Protein-Ligand Docking with Explicitly Specified Binding Site FlexibilityabstractAutomated docking of drug-like molecules into receptors is an essential tool in structure-based drug design. While modeling receptor flexibility is important for correctly predicting ligand binding, it still remains challenging. This work focuses on an approach in which receptor flexibility is modeled by explicitly specifying a set of receptor side-chains a-priori. The challenges of this approach include the: 1) exponential growth of the search space, demanding more efficient search methods; and 2) increased number of false positives, calling for scoring functions tailored for flexible receptor docking. We present AutoDockFR-AutoDock for Flexible Receptors (ADFR), a new docking engine based on the AutoDock4 scoring function, which addresses the aforementioned challenges with a new Genetic Algorithm (GA) and customized scoring function. We validate ADFR using the Astex Diverse Set, demonstrating an increase in efficiency and reliability of its GA over the one implemented in AutoDock4. We demonstrate greatly increased success rates when cross-docking ligands into apo receptors that require side-chain conformational changes for ligand binding. These cross-docking experiments are based on two datasets: 1) SEQ17 -a receptor diversity set containing 17 pairs of apo-holo structures; and 2) CDK2 -a ligand diversity set composed of one CDK2 apo structure and 52 known bound inhibitors. We show that, when cross-docking ligands into the apo conformation of the receptors with up to 14 flexible side-chains, ADFR reports more correctly cross-docked ligands than AutoDock Vina on both datasets with solutions found for 70.6% vs. 35.3% systems on SEQ17, and 76.9% vs. 61.5% on CDK2. ADFR also outperforms AutoDock Vina in number of top ranking solutions on both datasets. Furthermore, we show that correctly docked CDK2 complexes re-create on average 79.8% of all pairwise atomic interactions between the ligand and moving receptor atoms in the holo complexes. Finally, we show that down-weighting the receptor internal energy improves the ranking of correctly docked poses and that runtime for AutoDockFR scales linearly when side-chain flexibility is added. Pradeep Anand Ravindranath, Stefano Forli, David S. Goodsell, Arthur J. Olson, Michel F. Sanner |
PLoS Comput. Biol. | 5 |
| 2008 | Services Oriented Architecture for Managing Workflows of Avian Flu GridabstractThe avian flu grid is a virtual organization dedicated to the discovery of novel inhibitors for the pandemic avian flu threat, leveraging grid technologies and computational resources provided by PRAGMA and its partners. In this context it is essential to adopt tools which increase the productivity of the computational scientists without advanced training on grid technologies. To reduce the learning curve, we have augmented tools that most domain scientists are already familiar with, and hidden the complexity of the underlaying infrastructure, through automatic user interface generation and workflow support, beyond the standard command line based approach. Here we describe the current state of the infrastructure deployed and how it has facilitated the training of new researchers in the drug discovery area. We provide details on Vision, a visual programming environment used to define scientific workflows, and Opal, an automatic Web service wrappers for scientific applications on Grid resources, and how they are integrated with other established back-end technologies. Luca Clementi, Sriram Krishnan, Wesley Goodman, Jingyuan Ren, Wilfred W. Li, Peter W. Arzberger, Guillaume Vareille, Sargis Dallakyan, Michel F. Sanner |
eScience | 9 |
| 2006 | Building Cyberinfrastructure for Bioinformatics Using Service Oriented Architecture
Wilfred W. Li, Sriram Krishnan, Kurt Mueller, Kohei Ichikawa, Susumu Date, Sargis Dallakyan, Michel F. Sanner, Chris Misleh, Zhaohui Ding, Xiaohui Wei 0002, Osamu Tatebe, Peter W. Arzberger |
CCGRID | 7 |
| 2006 | Hierarchical and multi-resolution representation of protein flexibilityabstractMOTIVATION: Conformational rearrangements during molecular interactions are observed in a wide range of biological systems. However, computational methods that aim at simulating and predicting molecular interactions are still largely ignoring the flexible nature of biological macromolecules as the number of degrees of freedom is computationally intractable when using brute force representations. RESULTS: In this article, we present a computational data structure called the Flexibility Tree (FT) that enables a multi-resolution and hierarchical encoding of molecular flexibility. This tree-like data structure allows the encoding of relatively small, yet complex sub-spaces of a protein's conformational space. These conformational sub-spaces are parameterized by a small number of variables and can be searched efficiently using standard global search techniques. The FT structure makes it straightforward to combine and nest a wide variety of motion types such as hinge, shear, twist, screw, rotameric side chains, normal modes and essential dynamics. Moreover, the ability to assign shapes to the nodes in a FT allows the interactive manipulation of flexible protein shapes and the interactive visualization of the impact of conformational changes on the protein's overall shape. We describe the design of the FT and illustrate the construction of such trees to hierarchically combine motion information obtained from a variety of sources ranging from experiment to user intuition, and describing conformational changes at different biological scales. We show that the combination of various types of motion helps refine the encoded conformational sub-spaces to include experimentally determined structures, and we demonstrate searching these sub-spaces for specific conformations. Daniel Stoffler, Michel F. Sanner |
Bioinform. | 3 |
| 2004 | Augmented Reality with Tangible Auto-Fabricated Models for Molecular Biology ApplicationsabstractThe evolving technology of computer auto-fabrication ("3D printing") now makes it possible to produce physical models for complex biological molecules and assemblies. We report on an application that demonstrates the use of auto-fabricated tangible models and augmented reality for research and education in molecular biology, and for enhancing the scientific environment for collaboration and exploration. We have adapted an augmented reality system to allow virtual 3D representations (generated by the Python Molecular Viewer) to be overlaid onto a tangible molecular model. Users can easily change the overlaid information, switching between different representations of the molecule, displays of molecular properties such as electrostatics, or dynamic information. The physical model provides a powerful, intuitive interface for manipulating the computer models, streamlining the interface between human intent, the physical model, and the computational activity. Alexandre Gillet, Michel F. Sanner, Daniel Stoffler, David S. Goodsell, Arthur J. Olson |
IEEE Visualization | 2 |
| 1995 | Fast and Robust Computation of Molecular SurfacesabstractNo abstract available. Michel F. Sanner, Arthur J. Olson, Jean-Claude Spehner |
SCG | 1 |