Sciweavers

4860 search results - page 288 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 1 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
111
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
109
Voted
BMCBI
2008
178views more  BMCBI 2008»
15 years 25 days ago
Identification of coherent patterns in gene expression data using an efficient biclustering algorithm and parallel coordinate vi
Background: The DNA microarray technology allows the measurement of expression levels of thousands of genes under tens/hundreds of different conditions. In microarray data, genes ...
Kin-On Cheng, Ngai-Fong Law, Wan-Chi Siu, Alan Wee...
92
Voted
TACAS
2007
Springer
110views Algorithms» more  TACAS 2007»
15 years 6 months ago
Counterexamples in Probabilistic Model Checking
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
Tingting Han, Joost-Pieter Katoen
101
Voted
CPM
1993
Springer
125views Combinatorics» more  CPM 1993»
15 years 4 months ago
Detecting False Matches in String Matching Algorithms
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
S. Muthukrishnan