Campus Event Calendar
Event Entry
What and Who
"Efficient Similarity Search in Protein Structure Databases: Improving Clique-Detection through Clique Hashing"
Nils Weskamp
Talk
AG 1, AG 2, AG 3, AG 4
MPI Audience
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 11 September 2003
10:00
-- Not specified --
46.1 - MPII
022
Saarbrücken
Abstract
"In order to make the structural comparison of protein binding sites more
efficient, we propose a two-step method that combines advantages from
graph-based clique-detection and geometric hashing-techniques. The search
for protein similarity is completely independent of sequence and fold
information. Instead, it it based on a recent approach for the automatic
extraction of binding sites from protein structures and the representation
of their geometric and physicochemical properties. We also present some
empirical results for similarity search in a medium-sized dataset."
efficient, we propose a two-step method that combines advantages from
graph-based clique-detection and geometric hashing-techniques. The search
for protein similarity is completely independent of sequence and fold
information. Instead, it it based on a recent approach for the automatic
extraction of binding sites from protein structures and the representation
of their geometric and physicochemical properties. We also present some
empirical results for similarity search in a medium-sized dataset."
Contact
--email hidden
passcode not visible
logged in users only