Sciweavers

927 search results - page 168 / 186
» Algorithms for Finding Gene Clusters
Sort
View
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
16 years 4 days ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
IJHPCA
2008
131views more  IJHPCA 2008»
14 years 11 months ago
De Novo Ultrascale Atomistic Simulations On High-End Parallel Supercomputers
We present a de novo hierarchical simulation framework for first-principles based predictive simulations of materials and their validation on high-end parallel supercomputers and ...
Aiichiro Nakano, Rajiv K. Kalia, Ken-ichi Nomura, ...
RECOMB
2007
Springer
16 years 1 days ago
An Efficient and Accurate Graph-Based Approach to Detect Population Substructure
Currently, large-scale projects are underway to perform whole genome disease association studies. Such studies involve the genotyping of hundreds of thousands of SNP markers. One o...
Srinath Sridhar, Satish Rao, Eran Halperin
EDBT
2009
ACM
145views Database» more  EDBT 2009»
15 years 3 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...
BMCBI
2010
136views more  BMCBI 2010»
14 years 12 months ago
Bias correction and Bayesian analysis of aggregate counts in SAGE libraries
Background: Tag-based techniques, such as SAGE, are commonly used to sample the mRNA pool of an organism's transcriptome. Incomplete digestion during the tag formation proces...
Russell L. Zaretzki, Michael A. Gilchrist, William...