Sciweavers

768 search results - page 71 / 154
» Efficient Correlation Search from Graph Databases
Sort
View
JCC
2011
154views more  JCC 2011»
14 years 6 months ago
Can we trust docking results? Evaluation of seven commonly used programs on PDBbind database
: Docking is one of the most commonly used techniques in drug design. It is used for both identifying correct poses of a ligand in the binding site of a protein as well as for the ...
Dariusz Plewczynski, Michal Lazniewski, Rafal Augu...
216
Voted
SIGMOD
2008
ACM
89views Database» more  SIGMOD 2008»
16 years 3 months ago
Towards identity anonymization on graphs
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
Kun Liu, Evimaria Terzi
145
Voted
BMCBI
2004
119views more  BMCBI 2004»
15 years 3 months ago
Identification of polymorphic tandem repeats by direct comparison of genome sequence from different bacterial strains : a web-ba
Background: Polymorphic tandem repeat typing is a new generic technology which has been proved to be very efficient for bacterial pathogens such as B. anthracis, M. tuberculosis, ...
France Denoeud, Gilles Vergnaud
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
14 years 6 months ago
Scalable query rewriting: a graph-based approach
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
George Konstantinidis, José Luis Ambite
202
Voted
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 4 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah