Sciweavers

941 search results - page 79 / 189
» Efficient Testing of Large Graphs
Sort
View
BMCBI
2010
84views more  BMCBI 2010»
14 years 10 months ago
Testing the additional predictive value of high-dimensional molecular data
Background: While high-dimensional molecular data such as microarray gene expression data have been used for disease outcome prediction or diagnosis purposes for about ten years i...
Anne-Laure Boulesteix, Torsten Hothorn
BMCBI
2008
114views more  BMCBI 2008»
14 years 10 months ago
Testing the Coulomb/Accessible Surface Area solvent model for protein stability, ligand binding, and protein design
Background: Protein structure prediction and computational protein design require efficient yet sufficiently accurate descriptions of aqueous solvent. We continue to evaluate the ...
Marcel Schmidt am Busch, Anne Lopes, Najette Amara...
COMAD
2009
14 years 11 months ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan
ICDE
2006
IEEE
232views Database» more  ICDE 2006»
15 years 11 months ago
Dual Labeling: Answering Graph Reachability Queries in Constant Time
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
Haixun Wang, Hao He, Jeffrey Xu Yu, Jun Yang 0001,...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
15 years 7 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt