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

Izhar Wallach

dblp:22/7068 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2009
0000-0002-7212-3048ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 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
2 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › structural bioinformatics
protein-ligand binding
0.222009
Prediction of sub-cavity binding preferences using an adaptive physicochemical structure representation · Bioinform. 2009
The protein-small-molecule database, a non-redundant structural resource for the analysis of protein-ligand binding · Bioinform. 2009
Bioinformatics and computational biology
structural bioinformatics
0.222009
Prediction of sub-cavity binding preferences using an adaptive physicochemical structure representation · Bioinform. 2009
The protein-small-molecule database, a non-redundant structural resource for the analysis of protein-ligand binding · Bioinform. 2009
Bioinformatics and computational biology › structural bioinformatics
protein structure database
0.012009
The protein-small-molecule database, a non-redundant structural resource for the analysis of protein-ligand binding · Bioinform. 2009

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

sub-cavity comparison · 0.1redundancy removal · 0.1physicochemical structure representation · 0.1automated database construction · 0.1
YearPublicationVenuePosition
2009 The protein-small-molecule database, a non-redundant structural resource for the analysis of protein-ligand binding
abstract
MOTIVATION: An enabling resource for drug discovery and protein function prediction is a large, accurate and actively maintained collection of protein/small-molecule complex structures. Models of binding are typically constructed from these structural libraries by generalizing the observed interaction patterns. Consequently, the quality of the model is dependent on the quality of the structural library. An ideal library should be non-biased and comprehensive, contain high-resolution structures and be actively maintained. RESULTS: We present a new protein/small-molecule database (the PSMDB) that offers a non-redundant set of holo PDB complexes. The database was designed to allow frequent updates through a fully automated process without manual annotation or filtering. Our method of database construction addresses redundancy at both the protein and the small-molecule level. By efficiently handling structures with covalently bound ligands, we allow our database to include a larger number of structures than previous methods. Multiple versions of the database are available at our web site, including structures of split complexes--the proteins without their binding ligands and the non-covalently bound ligands within their native coordinate frame. AVAILABILITY: http://compbio.cs.toronto.edu/psmdb
Izhar Wallach, Ryan H. Lilien
Bioinform.1
2009 Prediction of sub-cavity binding preferences using an adaptive physicochemical structure representation
abstract
MOTIVATION: The ability to predict binding profiles for an arbitrary protein can significantly improve the areas of drug discovery, lead optimization and protein function prediction. At present, there are no successful algorithms capable of predicting binding profiles for novel proteins. Existing methods typically rely on manually curated templates or entire active site comparison. Consequently, they perform best when analyzing proteins sharing significant structural similarity with known proteins (i.e. proteins resulting from divergent evolution). These methods fall short when used to characterize the binding profile of a novel active site or one for which a template is not available. In contrast to previous approaches, our method characterizes the binding preferences of sub-cavities within the active site by exploiting a large set of known protein-ligand complexes. The uniqueness of our approach lies not only in the consideration of sub-cavities, but also in the more complete structural representation of these sub-cavities, their parametrization and the method by which they are compared. By only requiring local structural similarity, we are able to leverage previously unused structural information and perform binding inference for proteins that do not share significant structural similarity with known systems. RESULTS: Our algorithm demonstrates the ability to accurately cluster similar sub-cavities and to predict binding patterns across a diverse set of protein-ligand complexes. When applied to two high-profile drug targets, our algorithm successfully generates a binding profile that is consistent with known inhibitors. The results suggest that our algorithm should be useful in structure-based drug discovery and lead optimization.
Izhar Wallach, Ryan H. Lilien
Bioinform.1