Sciweavers

6 search results - page 1 / 2
» Searching Substructures with Superimposed Distance
Sort
View
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 6 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
13 years 9 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
BIBE
2007
IEEE
152views Bioinformatics» more  BIBE 2007»
13 years 5 months ago
SBLAST: Structural Basic Local Alignment Searching Tools using Geometric Hashing
While much research has been done on finding similarities between protein sequences, there has not been the same progress on finding similarities between protein structures. Here ...
Tom Milledge, Gaolin Zheng, Tim Mullins, Giri Nara...
CLUSTER
2007
IEEE
13 years 11 months ago
Sequential and parallel implementation of a constraint-based algorithm for searching protein structures
— Data mining in biological structure libraries can be a powerful tool to better understand biochemical processes. This article introduces the LISA algorithm which enables the re...
Sascha Hunold, Thomas Rauber, Georg Wille
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
14 years 6 months ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe