Sciweavers

124 search results - page 17 / 25
» The Cell Probe Complexity of Succinct Data Structures
Sort
View
PLDI
2004
ACM
14 years 1 months ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....
BMCBI
2010
108views more  BMCBI 2010»
13 years 7 months ago
Error, reproducibility and sensitivity : a pipeline for data processing of Agilent oligonucleotide expression arrays
Background: Expression microarrays are increasingly used to obtain large scale transcriptomic information on a wide range of biological samples. Nevertheless, there is still much ...
Benjamin Chain, Helen Bowen, John Hammond, Wilfrie...
CIKM
1994
Springer
13 years 11 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet
BMCBI
2005
116views more  BMCBI 2005»
13 years 7 months ago
Dynamic covariation between gene expression and proteome characteristics
Background: Cells react to changing intra- and extracellular signals by dynamically modulating complex biochemical networks. Cellular responses to extracellular signals lead to ch...
Mansour Taghavi Azar Sharabiani, Markku Siermala, ...
BMCBI
2010
118views more  BMCBI 2010»
13 years 7 months ago
Computing H/D-Exchange rates of single residues from data of proteolytic fragments
Background: Protein conformation and protein/protein interaction can be elucidated by solution-phase Hydrogen/ Deuterium exchange (sHDX) coupled to high-resolution mass analysis o...
Ernst Althaus, Stefan Canzar, Carsten Ehrler, Mark...