Sciweavers

3146 search results - page 32 / 630
» Efficient Consequence Finding
Sort
View
BMCBI
2005
94views more  BMCBI 2005»
13 years 9 months ago
A method for finding single-nucleotide polymorphisms with allele frequencies in sequences of deep coverage
Background: The allele frequencies of single-nucleotide polymorphisms (SNPs) are needed to select an optimal subset of common SNPs for use in association studies. Sequence-based m...
Jianmin Wang, Xiaoqiu Huang
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 10 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 10 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 10 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
BMCBI
2006
145views more  BMCBI 2006»
13 years 10 months ago
Fast-Find: A novel computational approach to analyzing combinatorial motifs
Background: Many vital biological processes, including transcription and splicing, require a combination of short, degenerate sequence patterns, or motifs, adjacent to defined seq...
Micah Hamady, Erin Peden, Rob Knight, Ravinder Sin...