Sciweavers

20878 search results - page 4173 / 4176
» Database
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 11 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
DIMACS
1996
13 years 7 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
BMCBI
2008
146views more  BMCBI 2008»
13 years 5 months ago
EST Express: PHP/MySQL based automated annotation of ESTs from expression libraries
Background: Several biological techniques result in the acquisition of functional sets of cDNAs that must be sequenced and analyzed. The emergence of redundant databases such as U...
Robin P. Smith, William J. Buchser, Marcus B. Lemm...
BMCBI
2008
129views more  BMCBI 2008»
13 years 5 months ago
EMAAS: An extensible grid-based Rich Internet Application for microarray data analysis and management
Background: Microarray experimentation requires the application of complex analysis methods as well as the use of non-trivial computer technologies to manage the resultant large d...
Geraint Barton, J. C. Abbott, Norie Chiba, D. W. H...
BMCBI
2008
128views more  BMCBI 2008»
13 years 5 months ago
Meta-analysis of breast cancer microarray studies in conjunction with conserved cis-elements suggest patterns for coordinate reg
Background: Gene expression measurements from breast cancer (BrCa) tumors are established clinical predictive tools to identify tumor subtypes, identify patients showing poor/good...
David D. Smith, Pål Sætrom, Ola R. Sn&...
« Prev « First page 4173 / 4176 Last » Next »