Sciweavers

76 search results - page 14 / 16
» Compounding of gossip graphs
Sort
View
WWW
2008
ACM
14 years 8 months ago
On incremental maintenance of 2-hop labeling of graphs
Recent interests on XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the re...
Ramadhana Bramandia, Byron Choi, Wee Keong Ng
BMCBI
2010
86views more  BMCBI 2010»
13 years 7 months ago
Reaction graph kernels predict EC numbers of unknown enzymatic reactions in plant secondary metabolism
Background: Understanding of secondary metabolic pathway in plant is essential for finding druggable candidate enzymes. However, there are many enzymes whose functions are not yet...
Hiroto Saigo, Masahiro Hattori, Hisashi Kashima, K...
BIBM
2009
IEEE
206views Bioinformatics» more  BIBM 2009»
14 years 2 months ago
Application of Kernel Functions for Accurate Similarity Search in Large Chemical Databases
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
Xiaohong Wang, Jun Huan, Aaron M. Smalter, Gerald ...
EDBT
2012
ACM
257views Database» more  EDBT 2012»
11 years 9 months ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...