Sciweavers

6142 search results - page 1122 / 1229
» The Complexity of Partition Functions
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 9 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
FSTTCS
2009
Springer
15 years 10 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
BMCBI
2010
96views more  BMCBI 2010»
15 years 4 months ago
ChIPpeakAnno: a Bioconductor package to annotate ChIP-seq and ChIP-chip data
Background: Chromatin immunoprecipitation (ChIP) followed by high-throughput sequencing (ChIP-seq) or ChIP followed by genome tiling array analysis (ChIP-chip) have become standar...
Lihua J. Zhu, Claude Gazin, Nathan D. Lawson, Herv...
BMCBI
2008
129views more  BMCBI 2008»
15 years 4 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
119views more  BMCBI 2008»
15 years 4 months ago
Snagger: A user-friendly program for incorporating additional information for tagSNP selection
Background: There has been considerable effort focused on developing efficient programs for tagging single-nucleotide polymorphisms (SNPs). Many of these programs do not account f...
Christopher K. Edlund, Won H. Lee, Dalin Li, David...
« Prev « First page 1122 / 1229 Last » Next »