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

Bilha Sandak

dblp:34/264 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1996
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
1 paper
Bioinformatics and computational biology · 100%
Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › molecular informatics › molecular modeling › molecular docking
flexible docking
0.011995
An automated computer vision and robotics-based technique for 3-D flexible biomolecular docking and matching · Comput. Appl. Biosci. 1995
Bioinformatics and computational biology › molecular informatics › molecular modeling
molecular docking
0.011995
An automated computer vision and robotics-based technique for 3-D flexible biomolecular docking and matching · Comput. Appl. Biosci. 1995
Multimedia analysis and retrieval
geometric hashing
0.011995
An automated computer vision and robotics-based technique for 3-D flexible biomolecular docking and matching · Comput. Appl. Biosci. 1995

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

geometric hashing · 0.0generalized hough transform · 0.0
YearPublicationVenuePosition
1996 Docking of Conformationally Flexible Proteins
Bilha Sandak, Ruth Nussinov, Haim J. Wolfson
CPM1
1995 An automated computer vision and robotics-based technique for 3-D flexible biomolecular docking and matching
abstract
The generation of binding modes between two molecules, also known as molecular docking, is a key problem in rational drug design and biomolecular recognition. Docking a ligand, e.g., a drug molecule or a protein molecule, to a protein receptor, involves recognition of molecular surfaces as molecules interact at their surface. Recent studies report that the activity of many molecules induces conformational transitions by 'hinge-bending', which involves movements of relatively rigid parts with respect to each other. In ligand-receptor binding, relative rotational movements of molecular substructures about their common hinges have been observed. For automatically predicting flexible molecular interactions, we adapt a new technique developed in Computer Vision and Robotics for the efficient recognition of partially occluded articulated objects. These type of objects consist of rigid parts which are connected by rotary joints (hinges). Our approach is based on an extension and generalization of the Geometric Hashing and Generalized Hough Transform paradigm for rigid object recognition. Unlike other techniques which match each part individually, our approach exploits forcefully and efficiently enough the fact that the different rigid parts do belong to the same flexible molecule. We show experimental results obtained by an implementation of the algorithm for rigid and flexible docking. While the 'correct', crystal-bound complex is obtained with a small RMSD, additional, predictive 'high scoring' binding modes are generated as well. The diverse applications and implications of this general, powerful tool are discussed.
Bilha Sandak, Ruth Nussinov, Haim J. Wolfson
Comput. Appl. Biosci.1