Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Henry van den Bedem

dblp:19/3511 · DBLP profile ↗
← Back
10ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0003-2358-841XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 7Artificial intelligence and machine learning · 3 · 1 since 2021

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.

Artificial intelligence
1 paper
Generative modeling · 67% Graph learning · 33%
Interdisciplinary, comprehensive, and emerging computing
3 papers
Bioinformatics and computational biology · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
molecular graph
0.612022
An efficient graph generative model for navigating ultra-large combinatorial synthesis libraries · NeurIPS 2022
Machine learning › Generative modeling › molecular generation
molecular graph generation
0.612022
An efficient graph generative model for navigating ultra-large combinatorial synthesis libraries · NeurIPS 2022
Machine learning › Generative modeling
variational autoencoder
0.612022
An efficient graph generative model for navigating ultra-large combinatorial synthesis libraries · NeurIPS 2022
Bioinformatics and computational biology
drug discovery
0.612022
An efficient graph generative model for navigating ultra-large combinatorial synthesis libraries · NeurIPS 2022
Bioinformatics and computational biology › drug discovery
virtual screening
0.612022
An efficient graph generative model for navigating ultra-large combinatorial synthesis libraries · NeurIPS 2022
Bioinformatics and computational biology › structural bioinformatics
nucleic acid structure analysis
0.212015
KGSrna: Efficient 3D Kinematics-Based Sampling for Nucleic Acids · RECOMB 2015

Methods — techniques the papers use, named apart from their topics

variational autoencoder · 1.1graph generation · 1.1molecular junctions · 0.3kinematics-based morphing · 0.3constraint manifold · 0.3kinematics-based sampling · 0.2
YearPublicationVenuePosition
2022 An efficient graph generative model for navigating ultra-large combinatorial synthesis libraries
abstract
Virtual, make-on-demand chemical libraries have transformed early-stage drug discovery by unlocking vast, synthetically accessible regions of chemical space. Recent years have witnessed rapid growth in these libraries from millions to trillions of compounds, hiding undiscovered, potent hits for a variety of therapeutic targets. However, they are quickly approaching a size beyond that which permits explicit enumeration, presenting new challenges for virtual screening. To overcome these challenges, we propose the Combinatorial Synthesis Library Variational Auto-Encoder (CSLVAE). The proposed generative model represents such libraries as a differentiable, hierarchically-organized database. Given a compound from the library, the molecular encoder constructs a query for retrieval, which is utilized by the molecular decoder to reconstruct the compound by first decoding its chemical reaction and subsequently decoding its reactants. Our design minimizes autoregression in the decoder, facilitating the generation of large, valid molecular graphs. Our method performs fast and parallel batch inference for ultra-large synthesis libraries, enabling a number of important applications in early-stage drug discovery. Compounds proposed by our method are guaranteed to be in the library, and thus synthetically and cost-effectively accessible. Importantly, CSLVAE can encode out-of-library compounds and search for in-library analogues. In experiments, we demonstrate the capabilities of the proposed method in the navigation of massive combinatorial synthesis libraries.
Aryan Pedawi, Pawel Gniewek, Chaoyi Chang, Brandon M. Anderson, Henry van den Bedem
NeurIPS5
2020 Sequence-guided protein structure determination using graph convolutional and recurrent networks
abstract
Single particle, cryogenic electron microscopy (cryoEM) experiments now routinely produce high-resolution data for large proteins and their complexes. Building an atomic model into a cryo-EM density map is challenging, particularly when no structure for the target protein is known a priori. Existing protocols for this type of task often rely on significant human intervention and can take hours to many days to produce an output. Here, we present a fully automated, template-free model building approach that is based entirely on neural networks. We use a graph convolutional network (GCN) to generate an embedding from a set of rotamer-based amino acid identities and candidate 3-dimensional Cα locations. Starting from this embedding, we use a bidirectional long short-term memory (LSTM) module to order and label the candidate identities and atomic locations consistent with the input protein sequence to obtain a structural model. Our approach paves the way for determining protein structures from cryo-EM densities at a fraction of the time of existing approaches and without the need for human intervention.
Po-Nan Li, Saulo Henrique Pires de Oliveira, Soichi Wakatsuki, Henry van den Bedem
BIBE4
2017 Fast, clash-free RNA conformational morphing using molecular junctions
abstract
MOTIVATION: Non-coding ribonucleic acids (ncRNA) are functional RNA molecules that are not translated into protein. They are extremely dynamic, adopting diverse conformational substates, which enables them to modulate their interaction with a large number of other molecules. The flexibility of ncRNA provides a challenge for probing their complex 3D conformational landscape, both experimentally and computationally. RESULTS: Despite their conformational diversity, ncRNAs mostly preserve their secondary structure throughout the dynamic ensemble. Here we present a kinematics-based procedure to morph an RNA molecule between conformational substates, while avoiding inter-atomic clashes. We represent an RNA as a kinematic linkage, with fixed groups of atoms as rigid bodies and rotatable bonds as degrees of freedom. Our procedure maintains RNA secondary structure by treating hydrogen bonds between base pairs as constraints. The constraints define a lower-dimensional, secondary-structure constraint manifold in conformation space, where motions are largely governed by molecular junctions of unpaired nucleotides. On a large benchmark set, we show that our morphing procedure compares favorably to peer algorithms, and can approach goal conformations to within a low all-atom RMSD by directing fewer than 1% of its atoms. Our results suggest that molecular junctions can modulate 3D structural rearrangements, while secondary structure elements guide large parts of the molecule along the transition to the correct final conformation. AVAILABILITY AND IMPLEMENTATION: The source code, binaries and data are available at https://simtk.org/home/kgs . CONTACT: [email protected] or [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Amélie Héliou, Dominik Budday, Rasmus Fonseca, Henry van den Bedem
Bioinform.4
2015 KGSrna: Efficient 3D Kinematics-Based Sampling for Nucleic Acids
Rasmus Fonseca, Henry van den Bedem, Julie Bernauer
RECOMB2
2015 Exposing Hidden Alternative Backbone Conformations in X-ray Crystallography Using qFit
abstract
Proteins must move between different conformations of their native ensemble to perform their functions. Crystal structures obtained from high-resolution X-ray diffraction data reflect this heterogeneity as a spatial and temporal conformational average. Although movement between natively populated alternative conformations can be critical for characterizing molecular mechanisms, it is challenging to identify these conformations within electron density maps. Alternative side chain conformations are generally well separated into distinct rotameric conformations, but alternative backbone conformations can overlap at several atomic positions. Our model building program qFit uses mixed integer quadratic programming (MIQP) to evaluate an extremely large number of combinations of sidechain conformers and backbone fragments to locally explain the electron density. Here, we describe two major modeling enhancements to qFit: peptide flips and alternative glycine conformations. We find that peptide flips fall into four stereotypical clusters and are enriched in glycine residues at the n+1 position. The potential for insights uncovered by new peptide flips and glycine conformations is exemplified by HIV protease, where different inhibitors are associated with peptide flips in the "flap" regions adjacent to the inhibitor binding site. Our results paint a picture of peptide flips as conformational switches, often enabled by glycine flexibility, that result in dramatic local rearrangements. Our results furthermore demonstrate the power of large-scale computational analysis to provide new insights into conformational heterogeneity. Overall, improved modeling of backbone heterogeneity with high-resolution X-ray data will connect dynamics to the structure-function relationship and help drive new design strategies for inhibitors of biomedically important systems.
Daniel A. Keedy, James S. Fraser, Henry van den Bedem
PLoS Comput. Biol.3
2015 Nullspace Sampling with Holonomic Constraints Reveals Molecular Mechanisms of Protein Gαs
abstract
Proteins perform their function or interact with partners by exchanging between conformational substates on a wide range of spatiotemporal scales. Structurally characterizing these exchanges is challenging, both experimentally and computationally. Large, diffusional motions are often on timescales that are difficult to access with molecular dynamics simulations, especially for large proteins and their complexes. The low frequency modes of normal mode analysis (NMA) report on molecular fluctuations associated with biological activity. However, NMA is limited to a second order expansion about a minimum of the potential energy function, which limits opportunities to observe diffusional motions. By contrast, kino-geometric conformational sampling (KGS) permits large perturbations while maintaining the exact geometry of explicit conformational constraints, such as hydrogen bonds. Here, we extend KGS and show that a conformational ensemble of the α subunit Gαs of heterotrimeric stimulatory protein Gs exhibits structural features implicated in its activation pathway. Activation of protein Gs by G protein-coupled receptors (GPCRs) is associated with GDP release and large conformational changes of its α-helical domain. Our method reveals a coupled α-helical domain opening motion while, simultaneously, Gαs helix α5 samples an activated conformation. These motions are moderated in the activated state. The motion centers on a dynamic hub near the nucleotide-binding site of Gαs, and radiates to helix α4. We find that comparative NMA-based ensembles underestimate the amplitudes of the motion. Additionally, the ensembles fall short in predicting the accepted direction of the full activation pathway. Taken together, our findings suggest that nullspace sampling with explicit, holonomic constraints yields ensembles that illuminate molecular mechanisms involved in GDP release and protein Gs activation, and further establish conformational coupling between key structural elements of Gαs.
Dimitar V. Pachov, Henry van den Bedem
PLoS Comput. Biol.2
2008 Modeling Structural Heterogeneity in Proteins from X-Ray Data
Ankur Dhanik, Henry van den Bedem, Ashley Deacon, Jean-Claude Latombe
WAFR2
2008 Efficient Algorithms to Explore Conformation Spaces of Flexible Protein Loops
abstract
Several applications in biology - e.g., incorporation of protein flexibility in ligand docking algorithms, interpretation of fuzzy X-ray crystallographic data, and homology modeling - require computing the internal parameters of a flexible fragment (usually, a loop) of a protein in order to connect its termini to the rest of the protein without causing any steric clash. One must often sample many such conformations in order to explore and adequately represent the conformational range of the studied loop. While sampling must be fast, it is made difficult by the fact that two conflicting constraints - kinematic closure and clash avoidance - must be satisfied concurrently. This paper describes two efficient and complementary sampling algorithms to explore the space of closed clash-free conformations of a flexible protein loop. The "seed sampling" algorithm samples broadly from this space, while the "deformation sampling" algorithm uses seed conformations as starting points to explore the conformation space around them at a finer grain. Computational results are presented for various loops ranging from 5 to 25 residues. More specific results also show that the combination of the sampling algorithms with a functional site prediction software (FEATURE) makes it possible to compute and recognize calcium-binding loop conformations. The sampling algorithms are implemented in a toolkit (LoopTK), which is available at https://simtk.org/home/looptk.
Peggy Yao, Ankur Dhanik, Nathan Marz, Ryan Propper, Charles Kou, Guanfeng Liu 0001, Henry van den Bedem, Jean-Claude Latombe, Inbal Halperin-Landsberg, Russ B. Altman
IEEE ACM Trans. Comput. Biol. Bioinform.7
2007 Efficient Algorithms to Explore Conformation Spaces of Flexible Protein Loops
Ankur Dhanik, Peggy Yao, Nathan Marz, Ryan Propper, Charles Kou, Guanfeng Liu 0001, Henry van den Bedem, Jean-Claude Latombe
WABI7
2004 Computing Protein Structures from Electron Density Maps: The Missing Fragment Problem
Itay Lotan, Henry van den Bedem, Ashley Deacon, Jean-Claude Latombe
WAFR2