Sciweavers

11211 search results - page 1825 / 2243
» Rank-Sensitive Data Structures
Sort
View
129
Voted
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
15 years 4 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
BMCBI
2004
142views more  BMCBI 2004»
15 years 4 months ago
GOTree Machine (GOTM): a web-based platform for interpreting sets of interesting genes using Gene Ontology hierarchies
Background: Microarray and other high-throughput technologies are producing large sets of interesting genes that are difficult to analyze directly. Bioinformatics tools are needed...
Bing Zhang, Denise Schmoyer, Stefan Kirov, Jay Sno...
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
16 years 4 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...
SPAA
2009
ACM
16 years 5 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
BMCBI
2010
167views more  BMCBI 2010»
15 years 4 months ago
Creating PWMs of transcription factors using 3D structure-based computation of protein-DNA free binding energies
Background: Knowledge of transcription factor-DNA binding patterns is crucial for understanding gene transcription. Numerous DNA-binding proteins are annotated as transcription fa...
Denitsa Alamanova, Philip Stegmaier, Alexander E. ...
« Prev « First page 1825 / 2243 Last » Next »