Sciweavers

102 search results - page 19 / 21
» Fast exact string matching algorithms
Sort
View
NOMS
2008
IEEE
139views Communications» more  NOMS 2008»
14 years 1 months ago
Fast similarity search in peer-to-peer networks
Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain function...
Thomas Bocek, Ela Hunt, David Hausheer, Burkhard S...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 24 days ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
LATA
2010
Springer
14 years 17 days ago
A Randomized Numerical Aligner (rNA)
With the advent of new sequencing technologies able to produce an enormous quantity of short genomic sequences, new tools able to search for them inside a references sequence genom...
Alberto Policriti, Alexandru I. Tomescu, Francesco...
PODS
2000
ACM
179views Database» more  PODS 2000»
13 years 11 months ago
Selectivity Estimation for Boolean Queries
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukris...
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
14 years 4 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra